An efficient algorithm for fast computation of pseudo-Zernike moments (2001)
AuthorsMukundan, R., Chong, C.W., Raveendran, P.show all
Pseudo-Zernike moments have better feature representation capabilities and are more robust to image noise than the conventional Zernike moments. However, pseudo-Zernike moments have not been extensively used as feature descriptors due to the computational complexity of the pseudo-Zernike radial polynomials. This paper discusses the drawbacks of the existing methods, and proposes an efficient recursive algorithm to compute the pseudo-Zernike moments. The algorithm consists of a two-stage recurrence relation for radial polynomials and coefficients of the polynomials, which are specifically derived for fast computation of pseudo-Zernike moments. The performance of the algorithm is experimentally examined using both binary and grayscale images, and it shows that the computational speed of pseudo-Zernike moments has been substantially improved over the present methods.
CitationMukundan, R., Chong, C.W., Raveendran, P. (2001) An efficient algorithm for fast computation of pseudo-Zernike moments. New Zealand: International Conference on Image and Vision Computing - IVCNZ'01, November, 2001. 237--242.
This citation is automatically generated and may be unreliable. Use as a guide only.