Fast complexified quaternion Fourier transform
Numerical Analysis
2008-03-19 v1 Functional Analysis
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.
Cite
@article{arxiv.math/0603578,
title = {Fast complexified quaternion Fourier transform},
author = {Salem Said and Nicolas Le Bihan and Stephen J. Sangwine},
journal= {arXiv preprint arXiv:math/0603578},
year = {2008}
}