Accurate and Efficient Computation of High Order Zernike Moments

Zernike Moments are useful tools in pattern recognition and image analysis due to their orthogonality and rotation invariance property. However, direct computation of these moments is very expensive, limiting their use especially at high orders. There have been some efforts to reduce the computational cost by employing quantized polar coordinate systems, which also reduce the accuracy of the moments. In this paper, we propose an efficient algorithm to accurately calculate Zernike moments at high orders. To preserve accuracy, we do not use any form of coordinate transformation and employ arbitrary precision arithmetic. The computational complexity is reduced by detecting the common terms in Zernike moments with different order and repetition. Experimental results show that our method is more accurate than other methods and it has comparable computational complexity especially in case of using large images and high order moments.

Authors and Affiliations

1. Computer Vision Laboratory, University of Nevada, Reno, NV, 89557, USA

   Gholamreza Amayeh, Ali Erol, George Bebis & Mircea Nicolescu

Editors and Affiliations

1. Department of Computer Science and Engineering, University of Nevada, Reno, USA

   George Bebis

2. NASA Ames Research Center, Moffett Field, CA, USA

   Richard Boyle

3. Desert Research Institute, Reno, NV, USA

   Darko Koracin

4. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

   Bahram Parvin

Reprints and permissions

© 2005 Springer-Verlag Berlin Heidelberg

Policies and ethics