Fast complexified quaternion Fourier transform
arXiv:math/0603578 · doi:10.1109/TSP.2007.910477
Abstract
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex quaternion-valued. It is shown how to compute the transform using four standard complex Fourier transforms and the properties of the transform are briefly discussed.
References in corpus (1)
Cited by in corpus (8)
- The Theory of Quaternion Matrix Derivatives
- A Survey of Orthogonal Moments for Image Representation: Theory, Implementation, and Evaluation
- Quaternion Convolutional Neural Networks: Current Advances and Future Directions
- Quaternions in mathematical physics (1): Alphabetical bibliography
- Complex and Hypercomplex Discrete Fourier Transforms Based on Matrix Exponential Form of Euler's Formula
- A unique polar representation of the hyperanalytic signal
- 3-D generalized analytic signal associated with linear canonical transform in Clifford biquaternion domain
- Hardware-Efficient Schemes of Quaternion Multiplying Units for 2D Discrete Quaternion Fourier Transform Processors