DocumentCode :
3409806
Title :
A fast algorithm for computing Chebyshev-Fourier moments
Author :
Jiang, Yongjing ; Ping, Ziliang ; Gao, Laibin
Author_Institution :
Sch. of Electron. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
Volume :
2
fYear :
2010
fDate :
9-10 Oct. 2010
Firstpage :
425
Lastpage :
428
Abstract :
In this paper, the invariant orthogonal moments, Chebyshev-Fourier moments (CHFMs), and the computation of CHFMs are introduced. With the specific symmetrical or anti-symmetrical properties of the Chebyshev-Fourier (CHF) basis functions, a fast algorithm for computing the CHFMs is given. Both theoretical analysis and experimental testing show that the fast algorithm makes the time for computing the CHFMs shorter than the direct method.
Keywords :
Chebyshev approximation; Fourier analysis; image processing; Chebyshev-Fourier moments; fast algorithm; invariant orthogonal moments; Chebyshev approximation; base functions; chebyshev-fourier moments; fast algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Future Information Technology and Management Engineering (FITME), 2010 International Conference on
Conference_Location :
Changzhou
Print_ISBN :
978-1-4244-9087-5
Type :
conf
DOI :
10.1109/FITME.2010.5656210
Filename :
5656210
Link To Document :
بازگشت