Discrete circular mapping for computation of Zernike moments

Authors:
Rajarshi Biswas;Sambhunath Biswas
Affiliations:
Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India;Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India
Venue:
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
Year:
2011

Citing 8
Cited 0

On Image Analysis by the Methods of Moments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Rotation invariant image recognition using features selected via a systematic method

Pattern Recognition
Simple and fast computation of moments

Pattern Recognition
Fast computation of moment invariants

Pattern Recognition
An all adder systolic structure for fast computation of moments

Journal of VLSI Signal Processing Systems
On the Accuracy of Zernike Moments for Image Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the computational aspects of Zernike moments

Image and Vision Computing
Accurate Computation of Zernike Moments in Polar Coordinates

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Zernike moments are found to have potentials in pattern recognition, image analysis, image processing and in computer vision, apart from its traditional field of optics. Their invariance and orthogonality are attractive in many applications. However, the study of its computational structure can lead to some efficient and fast algorithms. In this paper, we have examined the use of a discrete circular map to compute Zernike moments in polar coordinates. It should be noted that such a discrete circular map, to represent a garylevel image in polar coordinates, does not require any special kind of sampling. Hence, zernike moments in polar coordinates can be computed easily. Comparison shows the proposed method is also efficient in computation.