A comparative analysis of algorithms for fast computation of Zernike moments

Chong, C (2003) A comparative analysis of algorithms for fast computation of Zernike moments. Pattern Recognition, 36 (3). pp. 731-742. ISSN 00313203

[img] Text
1840.pdf
Restricted to Repository staff only

Download (293kB)
Official URL: http://dx.doi.org/10.1016/S0031-3203(02)00091-2

Abstract

This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Z(pq). The present method comprises of Direct, Belkasim's, Prata's, Kintner's and Coefficient methods. We propose a new technique, denoted as q-recursive method, specifically for fast computation of Zernike moments. It uses radial polynomials of fixed order p with a varying index q to compute Zernike moments. Fast computation is achieved because it uses polynomials of higher index q to derive the polynomials of lower index q and it does not use any factorial terms. Individual order of moments can be calculated independently without employing lower- or higher-order moments. This is especially useful in cases where only selected orders of Zernike moments are needed as pattern features. The performance of the present and proposed methods are experimentally analyzed by calculating Zernike moments of orders 0 to p and specific order p using binary and grayscale images. In both the cases, the q-recursive method takes the shortest time to compute Zernike moments. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 23 Aug 2011 07:13
Last Modified: 06 Feb 2014 03:48
URI: http://shdl.mmu.edu.my/id/eprint/2580

Actions (login required)

View Item View Item