DocumentCode :
557656
Title :
Euler´s formula in computing hyper-complex fourier transform
Author :
Wang, Dan ; Nian, Gui-Jun ; Wang, Ke
Author_Institution :
Sch. of Phys. & Sch. of Commun. Eng., Jilin Univ., Changchun, China
Volume :
2
fYear :
2011
fDate :
15-17 Oct. 2011
Firstpage :
755
Lastpage :
759
Abstract :
The Euler´s formula e = cos θ + j sin θ has been proved to be useful in simplifying the evaluation of complex and hyper-complex fourier transform by turning the multiplications of quaternion directly into matrices´s addition. In this paper we point out that while further considering the formula e s = eÂ+B̂+1/2[Â,B̂], the above analytic computations can be proceeded farther, thus the numerical process is simplified. We also illustrate the relationship of this formula with the rotation in physics system, which is helpful for us to do the rotation when discussing the image filters using the quaternion operators. Additionally, we use a special algebraic summation convention Σm AmBm = Ai Bi to reduce the complexity of non-commutivity in calculating the quaternion Fourier transform and the discrete quaternion Fourier transform. This technique is expected to simplify further the corresponding numerical programme.
Keywords :
discrete Fourier transforms; matrix algebra; Euler formula; discrete quaternion Fourier transform; hyper-complex Fourier transform; image filters; matrices addition; physics system; quaternion operators; special algebraic summation convention; Educational institutions; Equations; Fourier transforms; Physics; Quaternions; Vectors; Writing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image and Signal Processing (CISP), 2011 4th International Congress on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-9304-3
Type :
conf
DOI :
10.1109/CISP.2011.6100259
Filename :
6100259
Link To Document :
بازگشت