Efficient implementation of quaternion Fourier transform, convolution, and correlation by 2-D complex FFT

The concepts of quaternion Fourier transform (QFT), quaternion convolution (QCV), and quaternion correlation, which are based on quaternion algebra, have been found to be useful for color image processing. However, the necessary computational algorithms and their complexity still need some attention. We develop efficient algorithms for QFT, QCV, and quaternion correlation. The conventional complex two-dimensional (2-D) Fourier transform (FT) is used to implement these quaternion operations very efficiently. With these algorithms, we only need two complex 2-D FTs to implement a QFT, six complex 2-D FTs to implement a one-side QCV or a quaternion correlation and 12 complex 2-D FTs to implement a two-side QCV, and the efficiency of these quaternion operations is much improved. Meanwhile, we also discuss two additional topics. The first one is about how to use QFT and QCV for quaternion linear time-invariant (QLTI) system analysis. This topic is important for quaternion filter design and color image processing. Besides, we also develop the spectrum-product QCV. It is an improvement of the conventional form of QCV. For any arbitrary input functions, it always corresponds to the product operation in the frequency domain. It is very useful for quaternion filter design.

[1]  Soo-Chang Pei,et al.  Color image processing by using binary quaternion-moment-preserving thresholding technique , 1999, IEEE Trans. Image Process..

[2]  Stephen J. Sangwine,et al.  Colour image edge detector based on quaternion convolution , 1998 .

[3]  Pierre Duhamel,et al.  Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data , 1986, IEEE Trans. Acoust. Speech Signal Process..

[4]  Stephen J. Sangwine,et al.  The discrete quaternion Fourier transform , 1997 .

[5]  William Rowan Hamilton,et al.  Elements of Quaternions , 1969 .

[6]  Ching-Min Cheng,et al.  A novel block truncation coding of color images using a quaternion-moment-preserving principle , 1997, IEEE Trans. Commun..

[7]  Stephen J. Sangwine,et al.  Colour-sensitive edge detection using hypercomplex filters , 2000, 2000 10th European Signal Processing Conference.

[8]  Soo-Chang Pei,et al.  A novel block truncation coding of color images by using quaternion-moment-preserving principle , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[9]  S. Sangwine.  Fourier transforms of colour images using quaternion or hypercomplex, numbers , 1996 .

[10]  Stephen J. Sangwine,et al.  Hypercomplex color-sensitive smoothing filters , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[11]  Stephen J. Sangwine,et al.  Decomposition of 2D Hypercomplex Fourier transforms into pairs of complex fourier transforms , 2000, 2000 10th European Signal Processing Conference.

[12]  A. S. Solodovnikov,et al.  Hypercomplex Numbers: An Elementary Introduction to Algebras , 1989 .

[13]  Thomas Bülow,et al.  Multi-Dimensional Signal Processin Using an Algebraically Extended Signal Representation , 1997, AFPAC.

[14]  T. Ell,et al.  Quaternion-Fourier transforms for analysis of two-dimensional linear time-invariant partial differential systems , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[15]  T. Ell.  Hypercomplex spectral transformations , 1992 .

[16]  Thomas Bülow,et al.  Hypercomplex spectral signal representations for the processing and analysis of images , 1999 .

[17]  Stephen J. Sangwine,et al.  Hypercomplex Wiener-Khintchine theorem with application to color image correlation , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).