Abstract：Zernike moments are widely used in the fields of pattern recognition and image analysis due to their good properties such as orthogonality and rotation invariance.Pseudo-Zernike moments have similar properties as those of Zernike moments;moreover,they are less sensitive to image noise than the conventional Zernike moments.However,the problem of fast computation of pseudo-Zernike moments has not been well solved due to the complexity of the pseudo-Zernile polynomials.In this paper,we present a novel method for fast computing the pseudo-Zernike moments.
夏婷;周卫平;李松毅;舒华忠. 一种新的Pseudo-Zernike矩的快速算法[J]. 电子学报, 2005, 33(7): 1295-1298.
XIA Ting;ZHOU Wei-ping;LI Song-yi;SHU Hua-zhong. A Novel Algorithm for Fast Computation of Pseudo-Zernike Moments. Chinese Journal of Electronics, 2005, 33(7): 1295-1298.
2005, Vol. 33 
