Fast Complexified Quaternion Fourier Transform
- 14 March 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 56 (4) , 1522-1531
Abstract
In this paper, we consider the extension of the Fourier transform to biquaternion-valued signals. We introduce a transform that we call the biquaternion Fourier transform (BiQFT). After giving some general properties of this transform, we show how it can be used to generalize the notion of analytic signal to complex-valued signals. We introduce the notion of hyperanalytic signal. We also study the Hermitian symmetries of the BiQFT and their relation to the geometric nature of a biquaternion-valued signal. Finally, we present a fast algorithm for the computation of the BiQFT. This algorithm is based on a (complex) change of basis and four standard complex FFTs.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Hypercomplex Fourier Transforms of Color ImagesIEEE Transactions on Image Processing, 2006
- A Clifford algebra analysis of polarization-mode dispersion and polarization-dependent lossIEEE Photonics Technology Letters, 2006
- Biquaternion (Complexified Quaternion) Roots of −1Advances in Applied Clifford Algebras, 2006
- Clifford Fourier Transform on Vector FieldsIEEE Transactions on Visualization and Computer Graphics, 2005
- A novel block truncation coding of color images by using quaternion-moment-preserving principle2002
- The monogenic signalIEEE Transactions on Signal Processing, 2001
- Hypercomplex Wiener-Khintchine theorem with application to color image correlation2000
- Quaternions and Cayley Numbers1997
- Fourier transforms of colour images usingquaternion or hypercomplex, numbersElectronics Letters, 1996
- Arithmetic methods in the theory of discrete orthogonal transforms1995