By Topic

Efficient algorithm for fast computation of Zernike moments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Belkasim, S.O. ; Dept. of Electr. Eng., Windsor Univ., Ont., Canada ; Ahmadi, M. ; Shridhar, M.

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

Published in:

Circuits and Systems, 1996., IEEE 39th Midwest symposium on  (Volume:3 )

Date of Conference:

18-21 Aug 1996