Fast Complexified Quaternion Fourier Transform
From MaRDI portal
Publication:4568615
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.
Cited in
(17)- Quaternion hyperbolic Fourier transforms and uncertainty principles
- Uncertainty principles for the biquaternion offset linear canonical transform
- Constructing prolate spheroidal quaternion wave functions on the sphere
- Tensor transform-based quaternion Fourier transform algorithm
- Quaternion Fourier-Mellin moments for color images
- Quaternion convolutional neural networks: current advances and future directions
- Denoising color images based on local orientation estimation and CNN classifier
- Complex and hypercomplex discrete Fourier transforms based on matrix exponential form of Euler's formula
- Short-time special affine Fourier transform for quaternion-valued functions
- Three‐dimensional generalized analytic signal associated with linear canonical transform in Clifford biquaternion domain
- Locating the closest singularity in a polynomial homotopy
- Local quaternion Fourier transform and color image texture analysis
- Clifford multivector toolbox (for MATLAB)
- Theories and applications associated with biquaternion linear canonical transform
- Continuous quaternion Fourier and wavelet transforms
- Geometric roots of \(-1\) in Clifford algebras \(C \ell_{p,q}\) with \(p + q \leq 4\)
- scientific article; zbMATH DE number 5773640 (Why is no real title available?)
This page was built for publication: Fast Complexified Quaternion Fourier Transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568615)