DocumentCode
1932214
Title
Efficient algorithm for fast computation of Zernike moments
Author
Belkasim, S.O. ; Ahmadi, M. ; Shridhar, M.
Author_Institution
Dept. of Electr. Eng., Windsor Univ., Ont., Canada
Volume
3
fYear
1996
fDate
18-21 Aug 1996
Firstpage
1401
Abstract
Zernike moments have been used as shape descriptors in several object recognition applications. The classical method of computing Zernike moments is dependent on the regular moments which makes them computationally expensive and inefficient. In this paper, we present an efficient and fast algorithm for the direct computation of Zernike moments. This algorithm is based on using some properties of Zernike polynomials
Keywords
object recognition; polynomials; Zernike moments; Zernike polynomials; algorithm; fast computation; object recognition; shape descriptors; Equations; Hydrogen; Sampling methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996., IEEE 39th Midwest symposium on
Conference_Location
Ames, IA
Print_ISBN
0-7803-3636-4
Type
conf
DOI
10.1109/MWSCAS.1996.593209
Filename
593209
Link To Document