International Journal of Pattern Recognition and Artificial Intelligence · 2003 · 86 citations · 13 references
ArtsComputer ScienceComputer VisionDigital ImagingMachine VisionDigital Image ProcessingFeature DescriptionImage AnalysisImage ProcessingPattern RecognitionComplexityPolynomial ExpansionZernike Polynomials
Pseudo-Zernike moments have better feature representation capability, and are more robust to image noise than those of the conventional Zernike moments. However, due to the computation complexity of pseudo-Zernike polynomials, pseudo-Zernike moments are yet to be extensively used as feature descriptors as compared to Zernike moments. In this paper, we propose two new algorithms, namely coefficient method and p-recursive method, to accelerate the computation of pseudo-Zernike moments. Coefficient method calculates polynomial coefficients recursively. It eliminates the need of using factorial functions. Individual order or index of pseudo-Zernike moments can be derived independently, which is useful if selected orders or indices of moments are needed as pattern features. p-recursive method uses a combination of lower order polynomials to derive higher order polynomials with the same index q. Fast computation is achieved because it eliminates the requirements of calculating polynomial coefficients, B pqk , and power of radius, r k , in each polynomial. The performance of the proposed algorithms on moment computation and image reconstruction, as compared to those of the present methods, are experimentally verified using a set of binary and grayscale images.
13
Fast computation of Legendre and Zernike moments
Ramakrishnan Mukundan, K.R. Ramakrishnan · Pattern Recognition · 1995 · 246 citations