Results 1  10
of
53
Splines: A Perfect Fit for Signal/Image Processing
 IEEE SIGNAL PROCESSING MAGAZINE
, 1999
"... ..."
Sampling—50 years after Shannon
 Proceedings of the IEEE
, 2000
"... This paper presents an account of the current state of sampling, 50 years after Shannon’s formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefited from a strong research revival during the past few years, thanks in part to the math ..."
Abstract

Cited by 211 (22 self)
 Add to MetaCart
This paper presents an account of the current state of sampling, 50 years after Shannon’s formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefited from a strong research revival during the past few years, thanks in part to the mathematical connections that were made with wavelet theory. To introduce the reader to the modern, Hilbertspace formulation, we reinterpret Shannon’s sampling procedure as an orthogonal projection onto the subspace of bandlimited functions. We then extend the standard sampling paradigm for a representation of functions in the more general class of “shiftinvariant” functions spaces, including splines and wavelets. Practically, this allows for simpler—and possibly more realistic—interpolation models, which can be used in conjunction with a much wider class of (antialiasing) prefilters that are not necessarily ideal lowpass. We summarize and discuss the results available for the determination of the approximation error and of the sampling rate when the input of the system is essentially arbitrary; e.g., nonbandlimited. We also review variations of sampling that can be understood from the same unifying perspective. These include wavelets, multiwavelets, Papoulis generalized sampling, finite elements, and frames. Irregular sampling and radial basis functions are briefly mentioned. Keywords—Bandlimited functions, Hilbert spaces, interpolation, least squares approximation, projection operators, sampling,
The Structure of Finitely Generated ShiftInvariant Spaces in ...
, 1992
"... : A simple characterization is given of finitely generated subspaces of L 2 (IR d ) which are invariant under translation by any (multi)integer, and used to give conditions under which such a space has a particularly nice generating set, namely a basis, and, more than that, a basis with desirable ..."
Abstract

Cited by 99 (20 self)
 Add to MetaCart
: A simple characterization is given of finitely generated subspaces of L 2 (IR d ) which are invariant under translation by any (multi)integer, and used to give conditions under which such a space has a particularly nice generating set, namely a basis, and, more than that, a basis with desirable properties, such as stability, orthogonality, or linear independence. The last property makes sense only for `local' spaces, i.e., shiftinvariant spaces generated by finitely many compactly supported functions, and special attention is paid to such spaces. As an application, we prove that the approximation order provided by a given local space is already provided by the shiftinvariant space generated by just one function, with this function constructible as a finite linear combination of the finite generating set for the whole space, hence compactly supported. This settles a question of some 20 years' standing. AMS (MOS) Subject Classifications: primary: 41A25, 41A63, 46C99; secondary: 4...
Quantitative Fourier Analysis of Approximation Techniques: Part II  Wavelets
 IEEE Trans. Signal Processing
, 1999
"... In a previous paper, we proposed a general Fourier method that provides an accurate prediction of the approximation error, irrespective of the scaling properties of the approximating functions. Here, we apply our results when these functions satisfy the usual twoscale relation encountered in dyadic ..."
Abstract

Cited by 66 (28 self)
 Add to MetaCart
In a previous paper, we proposed a general Fourier method that provides an accurate prediction of the approximation error, irrespective of the scaling properties of the approximating functions. Here, we apply our results when these functions satisfy the usual twoscale relation encountered in dyadic multiresolution analysis. As a consequence of this additional constraint, the quantities introduced in our previous paper can be computed explicitly as a function of the refinement filter. This is, in particular, true for the asymptotic expansion of the approximation error for biorthonormal wavelets as the scale tends to zero. One of the contributions of this paper is the computation of sharp, asymptotically optimal upper bounds for the leastsquares approximation error. Another contribution is the application of these results to Bsplines and Daubechies scaling functions, which yields explicit asymptotic developments and upper bounds. Thanks to these explicit expressions, we can quantify ...
A chronology of interpolation: From ancient astronomy to modern signal and image processing
 Proceedings of the IEEE
, 2002
"... This paper presents a chronological overview of the developments in interpolation theory, from the earliest times to the present date. It brings out the connections between the results obtained in different ages, thereby putting the techniques currently used in signal and image processing into histo ..."
Abstract

Cited by 62 (0 self)
 Add to MetaCart
This paper presents a chronological overview of the developments in interpolation theory, from the earliest times to the present date. It brings out the connections between the results obtained in different ages, thereby putting the techniques currently used in signal and image processing into historical perspective. A summary of the insights and recommendations that follow from relatively recent theoretical as well as experimental studies concludes the presentation. Keywords—Approximation, convolutionbased interpolation, history, image processing, polynomial interpolation, signal processing, splines. “It is an extremely useful thing to have knowledge of the true origins of memorable discoveries, especially those that have been found not by accident but by dint of meditation. It is not so much that thereby history may attribute to each man his own discoveries and others should be encouraged to earn like commendation, as that the art of making discoveries should be extended by considering noteworthy examples of it. ” 1 I.
Multivariate refinement equations and convergence of subdivision schemes
 SIAM J. Math. Anal
, 1998
"... Abstract. Refinement equations play an important role in computer graphics and wavelet analysis. In this paper we investigate multivariate refinement equations associated with a dilation matrix and a finitely supported refinement mask. We characterize the Lpconvergence of a subdivision scheme in te ..."
Abstract

Cited by 61 (45 self)
 Add to MetaCart
Abstract. Refinement equations play an important role in computer graphics and wavelet analysis. In this paper we investigate multivariate refinement equations associated with a dilation matrix and a finitely supported refinement mask. We characterize the Lpconvergence of a subdivision scheme in terms of the pnorm joint spectral radius of a collection of matrices associated with the refinement mask. In particular, the 2norm joint spectral radius can be easily computed by calculating the eigenvalues of a certain linear operator on a finite dimensional linear space. Examples are provided to illustrate the general theory.
Approximation Order Provided by Refinable Function Vectors
 CONSTR. APPROX.
, 1995
"... In this paper, we consider Lp{approximation byinteger translates of a finite set of functions ( =0�:::�r; 1) which are not necessarily compactly supported, but have a suitable decay rate. Assuming that the function vector = ( ) r;1 =0 is refinable, necessary and sufficient conditions for the refinem ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
In this paper, we consider Lp{approximation byinteger translates of a finite set of functions ( =0�:::�r; 1) which are not necessarily compactly supported, but have a suitable decay rate. Assuming that the function vector = ( ) r;1 =0 is refinable, necessary and sufficient conditions for the refinement mask are derived. In particular, if algebraic polynomials can be exactly reproduced by integer translates of, then a factorization of the refinement mask of can be given. This result is a natural generalization of the result for a single function, where the refinement mask