Refined Method for the Fast and Exact Computation of Moment Invariants
Conference paper
Abstract
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have been presented up to now. Recently, Sossa, Yañez and Díaz [Pattern Recognition, 34(2):271-276, 2001] proposed a new algorithm based on a morphologic decomposition of the image into a set of closed disks. Their algorithm yields approximative results. In this paper we propose a refinement of their method that performs as fast as the original one but gives exact results.
Download
to read the full conference paper text
References
- 1.Flusser, J., Suk, T.: Pattern recognition by affne moment invariants. Pattern Recognition 26(1), 167–174 (1993)CrossRefMathSciNetGoogle Scholar
- 2.Flusser, J.: Refined moment calculation using image block representation. IEEE Transactions on Image Processing 9(11), 1977–1978 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
- 3.Hu, M.K.: Visual pattern recognition by moment invariants. IRE Transactions on Information Theory 8, 179–187 (1962)Google Scholar
- 4.Lin, W.G., Wang, S.S.: A note on the calculation of moments. Pattern Recognition Letters 15(11), 1065–1070 (1994)CrossRefGoogle Scholar
- 5.Sossa, H., Yañez, C., Díaz, J.L.: Computing geometric moments using morphological erosions. Pattern Recognition 34(2), 271–276 (2001)zbMATHCrossRefGoogle Scholar
- 6.Spiliotis, M., Mertzios, B.G.: Real-time computation of 2-D moments on binary images using image block representation. IEEE Transactions of Image Processing 7(11), 1609–1615 (1998)CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2004