2-D and 1-D multipaired transforms: Frequency-time type wavelets

被引:59
作者
Grigoryan, AM [1 ]
机构
[1] Texas A&M Univ, Dept Elect Engn, Comp Assisted Med Diagnost Imaging Lab, College Stn, TX 77843 USA
关键词
discrete Fourier; Hadamard; and Haar transforms; paired transforms; wavelets;
D O I
10.1109/78.902116
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In the present paper, a concept of multipaired unitary transforms is introduced. These kinds of transforms reveal the mathematical structure of Fourier transforms and can be considered intermediate unitary transforms when transferring processed data from the original real space of signals to the complex or frequency space of their images. Considering paired transforms, we analyze simultaneously the splitting of the multidimensional Fourier transform as well as the presentation of the processed multidimensional signal in the form of the short one-dimensional (1-D) "signals," that determine such splitting. The main properties of the orthogonal system of paired functions are described, and the matrix decompositions of the Fourier and Hadamard transforms via the paired transforms are given. The multiplicative complexity of the two-dimensional (2-D) 2(r) x 2(r) -point discrete Fourier transform by the paired transforms is 4(r) / 2(r - 7/3) + 8/3 - 12 (r > 3), which shows the maximum splitting of the 2-D Fourier transform into the number of the short 1-D Fourier transforms. The 2-D paired transforms are not separable and represent themselves as frequency-time-type wavelets for which two parameters are united: frequency and time. The decomposition of the signal is performed in a way that is different from the traditional Haar system of functions.
引用
收藏
页码:344 / 353
页数:10
相关论文
共 29 条
[1]  
Ahmed N, 1975, ORTHOGONAL TRANSFORM
[2]  
[Anonymous], FOURIER RELATED TRAN
[3]  
[Anonymous], 1985, LECT NOTES MATH
[4]  
[Anonymous], FUNDAMENTALS WAVELET
[5]  
[Anonymous], 1982, P IEEE
[6]  
[Anonymous], 1997, Wavelet analysis with application to image processing
[7]  
[Anonymous], 1985, DFT FFT CONVOLUTION
[8]  
BLAHUT RE, 1985, FAST ALGORITHMS DIGI
[9]   SPLIT VECTOR-RADIX FAST FOURIER-TRANSFORM [J].
CHAN, SC ;
HO, KL .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1992, 40 (08) :2029-2039
[10]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&