Results 1  10
of
71
DeNoising By SoftThresholding
, 1992
"... Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an a ..."
Abstract

Cited by 1253 (14 self)
 Add to MetaCart
Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an amount p 2 log(n) = p n. We prove two results about that estimator. [Smooth]: With high probability ^ fn is at least as smooth as f, in any of a wide variety of smoothness measures. [Adapt]: The estimator comes nearly as close in mean square to f as any measurable estimator can come, uniformly over balls in each of two broad scales of smoothness classes. These two properties are unprecedented in several ways. Our proof of these results develops new facts about abstract statistical inference and its connection with an optimal recovery model.
Nonlinear Wavelet Image Processing: Variational Problems, Compression, and Noise Removal through Wavelet Shrinkage
 IEEE Trans. Image Processing
, 1996
"... This paper examines the relationship between waveletbased image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of variational problems; in particular, we show that wavelet shrinkage can be considered the exact minimizer of the following pro ..."
Abstract

Cited by 258 (12 self)
 Add to MetaCart
(Show Context)
This paper examines the relationship between waveletbased image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of variational problems; in particular, we show that wavelet shrinkage can be considered the exact minimizer of the following problem: given an image F defined on a square I, minimize over all g in the Besov space B 1 1 (L1 (I)) the functional #F  g# 2 L 2 (I) + ##g# B 1 1 (L 1 (I)) .Weusethetheoryof nonlinear wavelet image compression in L2 (I) to derive accurate error bounds for noise removal through wavelet shrinkage applied to images corrupted with i.i.d., mean zero, Gaussian noise. A new signaltonoise ratio, which we claim more accurately reflects the visual perception of noise in images, arises in this derivation. We present extensive computations that support the hypothesis that nearoptimal shrinkage parameters can be derived if one knows (or can estimate) only two parameters about an image F:thelarge...
Large Sample Sieve Estimation of SemiNonparametric Models
 Handbook of Econometrics
, 2007
"... Often researchers find parametric models restrictive and sensitive to deviations from the parametric specifications; seminonparametric models are more flexible and robust, but lead to other complications such as introducing infinite dimensional parameter spaces that may not be compact. The method o ..."
Abstract

Cited by 182 (19 self)
 Add to MetaCart
Often researchers find parametric models restrictive and sensitive to deviations from the parametric specifications; seminonparametric models are more flexible and robust, but lead to other complications such as introducing infinite dimensional parameter spaces that may not be compact. The method of sieves provides one way to tackle such complexities by optimizing an empirical criterion function over a sequence of approximating parameter spaces, called sieves, which are significantly less complex than the original parameter space. With different choices of criteria and sieves, the method of sieves is very flexible in estimating complicated econometric models. For example, it can simultaneously estimate the parametric and nonparametric components in seminonparametric models with or without constraints. It can easily incorporate prior information, often derived from economic theory, such as monotonicity, convexity, additivity, multiplicity, exclusion and nonnegativity. This chapter describes estimation of seminonparametric econometric models via the method of sieves. We present some general results on the large sample properties of the sieve estimates, including consistency of the sieve extremum estimates, convergence rates of the sieve Mestimates, pointwise normality of series estimates of regression functions, rootn asymptotic normality and efficiency of sieve estimates of smooth functionals of infinite dimensional parameters. Examples are used to illustrate the general results.
Interpolating Wavelet Transform
, 1992
"... We describe several "wavelet transforms" which characterize smoothness spaces and for which the coefficients are obtained by sampling rather than integration. We use them to reinterpret the empirical wavelet transform, i.e. the common practice of applying pyramid filters to samples of a f ..."
Abstract

Cited by 153 (13 self)
 Add to MetaCart
We describe several "wavelet transforms" which characterize smoothness spaces and for which the coefficients are obtained by sampling rather than integration. We use them to reinterpret the empirical wavelet transform, i.e. the common practice of applying pyramid filters to samples of a function.
Nonlinear Wavelet Methods for Recovery of Signals, Densities, and Spectra from Indirect and Noisy Data
 In Proceedings of Symposia in Applied Mathematics
, 1993
"... . We describe wavelet methods for recovery of objects from noisy and incomplete data. The common themes: (a) the new methods utilize nonlinear operations in the wavelet domain; (b) they accomplish tasks which are not possible by traditional linear/Fourier approaches to such problems. We attempt to i ..."
Abstract

Cited by 133 (5 self)
 Add to MetaCart
. We describe wavelet methods for recovery of objects from noisy and incomplete data. The common themes: (a) the new methods utilize nonlinear operations in the wavelet domain; (b) they accomplish tasks which are not possible by traditional linear/Fourier approaches to such problems. We attempt to indicate the heuristic principles, theoretical foundations, and possible application areas for these methods. Areas covered: (1) Wavelet DeNoising. (2) Wavelet Approaches to Linear Inverse Problems. (4) Wavelet Packet DeNoising. (5) Segmented MultiResolutions. (6) Nonlinear Multiresolutions. 1. Introduction. With the rapid development of computerized scientific instruments comes a wide variety of interesting problems for data analysis and signal processing. In fields ranging from Extragalactic Astronomy to Molecular Spectroscopy to Medical Imaging to Computer Vision, one must recover a signal, curve, image, spectrum, or density from incomplete, indirect, and noisy data. What can wavelets ...
Recovering Edges in IllPosed Inverse Problems: Optimality of Curvelet Frames
, 2000
"... We consider a model problem of recovering a function f(x1,x2) from noisy Radon data. The function f to be recovered is assumed smooth apart from a discontinuity along a C2 curve – i.e. an edge. We use the continuum white noise model, with noise level ɛ. Traditional linear methods for solving such in ..."
Abstract

Cited by 78 (14 self)
 Add to MetaCart
(Show Context)
We consider a model problem of recovering a function f(x1,x2) from noisy Radon data. The function f to be recovered is assumed smooth apart from a discontinuity along a C2 curve – i.e. an edge. We use the continuum white noise model, with noise level ɛ. Traditional linear methods for solving such inverse problems behave poorly in the presence of edges. Qualitatively, the reconstructions are blurred near the edges; quantitatively, they give in our model Mean Squared Errors (MSEs) that tend to zero with noise level ɛ only as O(ɛ1/2)asɛ → 0. A recent innovation – nonlinear shrinkage in the wavelet domain – visually improves edge sharpness and improves MSE convergence to O(ɛ2/3). However, as we show here, this rate is not optimal. In fact, essentially optimal performance is obtained by deploying the recentlyintroduced tight frames of curvelets in this setting. Curvelets are smooth, highly anisotropic elements ideally suited for detecting and synthesizing curved edges. To deploy them in the Radon setting, we construct a curveletbased biorthogonal decomposition
Wavelets on Closed Subsets of the Real Line
 in: Topics in the Theory and Applications of Wavelets, L.L. Schumaker and
"... . We construct orthogonal and biorthogonal wavelets on a given closed subset of the real line. We also study wavelets satisfying certain types of boundary conditions. We introduce the concept of "wavelet probing ", which is closely related to our construction of wavelets. This technique al ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
(Show Context)
. We construct orthogonal and biorthogonal wavelets on a given closed subset of the real line. We also study wavelets satisfying certain types of boundary conditions. We introduce the concept of "wavelet probing ", which is closely related to our construction of wavelets. This technique allows us to very quickly perform a number of different numerical tasks associated with wavelets. x1. Introduction Wavelets and multiscale analysis have emerged in a number of different fields, from harmonic analysis and partial differential equations in pure mathematics to signal and image processing in computer science and electrical engineering. Typically a general function, signal, or image is broken up into linear combinations of translated and scaled versions of some simple, basic building blocks. Multiscale analysis comes with a natural hierarchical structure obtained by only considering the linear combinations of building blocks up to a certain scale. This hierarchical structure is particularly...
Smooth Wavelet Decompositions with Blocky Coefficient Kernels
, 1993
"... We describe bases of smooth wavelets where the coefficients are obtained by integration against (finite combinations of) boxcar kernels rather than against traditional smooth wavelets. Bases of this type were first developed in work of Tchamitchian and of Cohen, Daubechies, and Feauveau. Our approac ..."
Abstract

Cited by 60 (12 self)
 Add to MetaCart
(Show Context)
We describe bases of smooth wavelets where the coefficients are obtained by integration against (finite combinations of) boxcar kernels rather than against traditional smooth wavelets. Bases of this type were first developed in work of Tchamitchian and of Cohen, Daubechies, and Feauveau. Our approach emphasizes the idea of averageinterpolation  synthesizing a smooth function on the line having prescribed boxcar averages  and the link between averageinterpolation and DubucDeslauriers interpolation. We also emphasize characterizations of smooth functions via their coefficients. We describe boundarycorrected expansions for the interval, which have a simple and revealing form. We use these results to reinterpret the empirical wavelet transform  i.e. finite, discrete wavelet transforms of data arising from boxcar integrators (e.g. CCD devices).
Wavelet theory demystified
 IEEE Trans. Signal Process
, 2003
"... Abstract—In this paper, we revisit wavelet theory starting from the representation of a scaling function as the convolution of a Bspline (the regular part of it) and a distribution (the irregular or residual part). This formulation leads to some new insights on wavelets and makes it possible to red ..."
Abstract

Cited by 57 (26 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we revisit wavelet theory starting from the representation of a scaling function as the convolution of a Bspline (the regular part of it) and a distribution (the irregular or residual part). This formulation leads to some new insights on wavelets and makes it possible to rederive the main results of the classical theory—including some new extensions for fractional orders—in a selfcontained, accessible fashion. In particular, we prove that the Bspline component is entirely responsible for five key wavelet properties: order of approximation, reproduction of polynomials, vanishing moments, multiscale differentiation property, and smoothness (regularity) of the basis functions. We also investigate the interaction of wavelets with differential operators giving explicit time domain formulas for the fractional derivatives of the basis functions. This allows us to specify a corresponding dual wavelet basis and helps us understand why the wavelet transform provides a stable characterization of the derivatives of a signal. Additional results include a new peeling theory of smoothness, leading to the extended notion of wavelet differentiability in thesense and a sharper theorem stating that smoothness implies order. Index Terms—Approximation order, Besov spaces, Hölder smoothness, multiscale differentiation, splines, vanishing moments, wavelets. I.