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 co-ordinates, 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.
Chapter PDF
Similar content being viewed by others
References
Teague, M.R.: Image analysis via the general theory of moments. J. Opt. Soc. Am. 70(8), 920–930 (1980)
Teh, C., Chin, R.T.: On image analysis by the methods of moments. IEEE Trans. Pattern anal. Mach. Intell. 10(4), 496–513 (1988)
Khotanzad, A., Hong, Y.H.: Rotation invariant image recognition using features selected via a systematic method. Pattern Recognition 23(10), 1089–1101 (1990)
Liao, S.X., Pawlak, M.: On the accuracy of Zernike moments for image analysis. IEEE Trans. Pattern anal. Mach. Intell. 20, 1358–1364 (1998)
Bisaws, S.N., Chaudhuri, B.B.: On the generation of discrete circular objects and their properties. Comput. Vision, Graphics Image
Jiang, X.Y., Bunke, H.: Simple and fast computation of moments. Pattern Recognition 24(8), 801–806 (1991)
Li, B.C., Shen, J.: Fast computation of moment invariant. Pattern Recognition 24(8), 807–813 (1991)
Mukundan, R., Ramakrishnan, K.R.: Fast computation of Legendre and Zernike moments. Pattern Recognition 28(9), 1433–1442 (1995)
Belkasim, S.O., Ahmadi, M., Sridhar, M.: Efficient algorithm for fast computation of Zernike moments. J. Franklin Inst. Eng. Appl. Math. 333, 577–581 (1996)
Chan, F.H.Y., Lam, F.K.: An all adder systolic structure for fast computation of moments. J. VLSI Signal Process. 12, 159–175 (1996)
Shu, H.Z., Luo, L.M., Yu, W.X., Fu, Y.: A new fast method computing Legendre moments. Pattern Recognition 33(2), 341–348 (2000)
Gu, J., Su, H.Z., Toumoulin, C., Luo, L.M.: A novel algorithm for fast computation of Zernike moments. Pattern Recognition 35, 2905–2911 (2002)
Xin, Y., Pawlak, M., Liao, S.: Accurate computation of Zernike moments in polar coordinates. IEEE Trans. on Image Processing 16(2), 581–587 (2007)
Wee, C.Y., Raveendran, P.: On the computational aspects of Zernike moments. Image and Vision Computing 25(6), 967–980 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biswas, R., Biswas, S. (2011). Discrete Circular Mapping for Computation of Zernike Moments. In: Kuznetsov, S.O., Mandal, D.P., Kundu, M.K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2011. Lecture Notes in Computer Science, vol 6744. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21786-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21786-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21785-2
Online ISBN: 978-3-642-21786-9
eBook Packages: Computer ScienceComputer Science (R0)