zbMATH — the first resource for mathematics

Portraits of frames. (English) Zbl 0851.42030
Summary: We introduce two methods for generating frames of a Hilbert space $$\mathcal H$$. The first method uses bounded operators on $$\mathcal H$$. The other method uses bounded linear operators on $$l_2$$ to generate frames of $$\mathcal H$$. We characterize all the mappings that transform frames into other frames. We also show how to construct all frames of a given Hilbert space $$\mathcal H$$, starting from any given one. We illustrate the results by giving some examples from multiresolution and wavelet theory.

MSC:
 42C15 General harmonic expansions, frames
Full Text:
References:
 [1] Akram Aldroubi and Michael Unser, Sampling procedures in function spaces and asymptotic equivalence with Shannon’s sampling theory, Numer. Funct. Anal. Optim. 15 (1994), no. 1-2, 1 – 21. · Zbl 0794.41024 [2] -, Families of wavelet transforms in connection with Shannon’s sampling theory and the Gabor transform, Wavelets–A Tutorial in Theory and Applications, 2 , Academic Press, New York, 1992, pp. 509-528. · Zbl 0769.42014 [3] Akram Aldroubi and Michael Unser, Families of multiresolution and wavelet spaces with optimal properties, Numer. Funct. Anal. Optim. 14 (1993), no. 5-6, 417 – 446. · Zbl 0798.94007 [4] Akram Aldroubi, Murray Eden, and Michael Unser, Discrete spline filters for multiresolutions and wavelets of \?$$_{2}$$, SIAM J. Math. Anal. 25 (1994), no. 5, 1412 – 1432. · Zbl 0803.42024 [5] John J. Benedetto, Gabor representations and wavelets, Commutative harmonic analysis (Canton, NY, 1987) Contemp. Math., vol. 91, Amer. Math. Soc., Providence, RI, 1989, pp. 9 – 27. · Zbl 0687.42006 [6] John J. Benedetto, Irregular sampling and frames, Wavelets, Wavelet Anal. Appl., vol. 2, Academic Press, Boston, MA, 1992, pp. 445 – 507. · Zbl 0777.42009 [7] J. J. Benedetto and S. Li, Multiresolution analysis frames with applications, IEEE-ICASSP 3 (1993), 304-307. [8] Ingrid Daubechies, The wavelet transform, time-frequency localization and signal analysis, IEEE Trans. Inform. Theory 36 (1990), no. 5, 961 – 1005. · Zbl 0738.94004 [9] Ingrid Daubechies, Ten lectures on wavelets, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 61, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992. · Zbl 0776.42018 [10] R. J. Duffin and A. C. Schaeffer, A class of nonharmonic Fourier series, Trans. Amer. Math. Soc. 72 (1952), 341 – 366. · Zbl 0049.32401 [11] Christopher E. Heil and David F. Walnut, Continuous and discrete wavelet transforms, SIAM Rev. 31 (1989), no. 4, 628 – 666. · Zbl 0683.42031 [12] Stephane G. Mallat, Multiresolution approximations and wavelet orthonormal bases of \?²(\?), Trans. Amer. Math. Soc. 315 (1989), no. 1, 69 – 87. · Zbl 0686.42018 [13] -, A theory of multiresolution signal decomposition: the wavelet representation, IEEE Trans. Pattern Anal. Machine Intell. PAMI-11 (1989), 674-693. · Zbl 0709.94650 [14] Wim Sweldens and Robert Piessens, Quadrature formulae and asymptotic error expansions for wavelet approximations of smooth functions, SIAM J. Numer. Anal. 31 (1994), no. 4, 1240 – 1264. · Zbl 0822.65013 [15] Akram Aldroubi and Michael Unser, Sampling procedures in function spaces and asymptotic equivalence with Shannon’s sampling theory, Numer. Funct. Anal. Optim. 15 (1994), no. 1-2, 1 – 21. · Zbl 0794.41024 [16] Michael Unser, Akram Aldroubi, and Murray Eden, On the asymptotic convergence of \?-spline wavelets to Gabor functions, IEEE Trans. Inform. Theory 38 (1992), no. 2, 864 – 872. · Zbl 0757.41022 [17] -, A family of polynomial spline wavelet transforms, Signal Process. 30 (1993), 141-162. · Zbl 0768.41012 [18] M. Vetterli and C. Herley, Wavelets and filter banks, IEEE Trans. Signal Proc. 40 (1992), 2207-2231. · Zbl 0825.94059
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.