Wavelet transforms associated with finite cyclic groups

Multiresolution analysis via decomposition on wavelet bases has emerged as an important tool in the analysis of signals and images when these objects are viewed as sequences of complex or real numbers. An important class of multiresolution decompositions are the Laplacian pyramid schemes, in which the resolution is successively halved by recursively low-pass filtering the signal under analysis and decimating it by a factor of two. In general, the principal framework within which multiresolution techniques have been studied and applied is the same as that used in the discrete-time Fourier analysis of sequences of complex numbers. An analogous framework is developed for the multiresolution analysis of finite-length sequences of elements from arbitrary fields. Attention is restricted to sequences of length 2/sup n/, for n a positive integer, so that the resolution may be recursively halved to completion. As in finite-length Fourier analysis, a cyclic group structure of the index set of such sequences is exploited to characterize the transforms of interest for the particular cases of complex and finite fields. >

[1]  Ingrid Daubechies,et al.  The wavelet transform, time-frequency localization and signal analysis , 1990, IEEE Trans. Inf. Theory.

[2]  J.L. Massey,et al.  Theory and practice of error control codes , 1986, Proceedings of the IEEE.

[3]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[4]  R. Coifman,et al.  Fast wavelet transforms and numerical algorithms I , 1991 .

[5]  Ahmed H. Tewfik,et al.  Discrete orthogonal M-band wavelet decompositions , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  A. Grossmann,et al.  Wavelet Transforms and Edge Detection , 1988 .

[7]  A. Grossmann,et al.  Cycle-octave and related transforms in seismic signal analysis , 1984 .

[8]  J. Pollard,et al.  The fast Fourier transform in a finite field , 1971 .

[9]  J.-C. Pesquet Orthonormal wavelets for finite sequences , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  Gilbert Strang,et al.  Wavelets and Dilation Equations: A Brief Introduction , 1989, SIAM Rev..

[11]  D. Pollen,et al.  _{}(2,[,1/]) for a subfield of , 1990 .

[12]  P. Lewis,et al.  The finite Fourier transform , 1969 .

[13]  Robert L. Grossman,et al.  Wavelet transforms associated with finite cyclic groups , 1992, [1992] Conference Record of the Twenty-Sixth Asilomar Conference on Signals, Systems & Computers.

[14]  John J. Benedetto,et al.  Gabor Representations and Wavelets. , 1987 .

[15]  Christopher Heil,et al.  Continuous and Discrete Wavelet Transforms , 1989, SIAM Rev..

[16]  Richard E. Blahut,et al.  Fast Algorithms for Digital Signal Processing , 1985 .

[17]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  P. Vaidyanathan Quadrature mirror filter banks, M-band extensions and perfect-reconstruction techniques , 1987, IEEE ASSP Magazine.

[19]  Garry M. Jacyna,et al.  WIGNER TRANSFORMS, GABOR COEFFICIENTS, AND WEYL-HEISENBERG WAVELETS , 1991 .

[20]  I. Daubechies Orthonormal bases of compactly supported wavelets , 1988 .

[21]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[22]  P. P. Vaidyanathan,et al.  Multirate digital filters, filter banks, polyphase networks, and applications: a tutorial , 1990, Proc. IEEE.

[23]  Richard Kronland-Martinet,et al.  Analysis of Sound Patterns through Wavelet transforms , 1987, Int. J. Pattern Recognit. Artif. Intell..

[24]  V. Zingarelli,et al.  An analytical formula for the design of quadrature mirror filters , 1984 .

[25]  Rolf Johannesson,et al.  Algebraic methods for signal processing and communications coding , 1995 .

[26]  D. Pollen SU I (2, F [ z,1/z ]) for F A Subfield of C , 1990 .