This paper details a comparative analysis on time taken by the present
and proposed methods to compute the Zernike moments, Zpq. 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.
%0 Journal Article
%1 Chong2003
%A Chong, Chee-Way
%A Raveendran, P.
%A Mukundan, R.
%D 2003
%K Belkasim's Coefficient Kintner's Prata's Zernike method; polynomials radial
%N 3
%P 731-742
%T A comparative analysis of algorithms for fast computation of Zernike
moments
%V 36
%X This paper details a comparative analysis on time taken by the present
and proposed methods to compute the Zernike moments, Zpq. 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.
@article{Chong2003,
abstract = {This paper details a comparative analysis on time taken by the present
and proposed methods to compute the Zernike moments, Zpq. 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.},
added-at = {2011-03-27T19:35:34.000+0200},
author = {Chong, Chee-Way and Raveendran, P. and Mukundan, R.},
bibsource = {DBLP, http://dblp.uni-trier.de},
biburl = {https://www.bibsonomy.org/bibtex/2ecce5d77a31045378e56ba3d431c3bc4/cocus},
ee = {http://dx.doi.org/10.1016/S0031-3203(02)00091-2},
interhash = {6a82ac1b958a632931cf5ea4b67182d4},
intrahash = {ecce5d77a31045378e56ba3d431c3bc4},
journaltitle = {#PR#},
keywords = {Belkasim's Coefficient Kintner's Prata's Zernike method; polynomials radial},
number = 3,
pages = {731-742},
timestamp = {2011-03-27T19:35:37.000+0200},
title = {A comparative analysis of algorithms for fast computation of Zernike
moments},
volume = 36,
year = 2003
}