Back to Search Start Over

Sparse fast Clifford Fourier transform

Authors :
Yi-xuan Zhou
Yan-liang Jin
Rui Wang
Wenming Cao
Source :
Frontiers of Information Technology & Electronic Engineering. 18:1131-1141
Publication Year :
2017
Publisher :
Zhejiang University Press, 2017.

Abstract

The Clifford Fourier transform (CFT) can be applied to both vector and scalar fields. However, due to problems with big data, CFT is not efficient, because the algorithm is calculated in each semaphore. The sparse fast Fourier transform (sFFT) theory deals with the big data problem by using input data selectively. This has inspired us to create a new algorithm called sparse fast CFT (SFCFT), which can greatly improve the computing performance in scalar and vector fields. The experiments are implemented using the scalar field and grayscale and color images, and the results are compared with those using FFT, CFT, and sFFT. The results demonstrate that SFCFT can effectively improve the performance of multivector signal processing.

Details

ISSN :
20959230 and 20959184
Volume :
18
Database :
OpenAIRE
Journal :
Frontiers of Information Technology & Electronic Engineering
Accession number :
edsair.doi...........928586dca51bd871ec69fc9d29b66dfc
Full Text :
https://doi.org/10.1631/fitee.1500452