一种新的Pseudo-Zernike矩的快速算法  

A Novel Algorithm for Fast Computation of Pseudo-Zernike Moments

作　　者：夏婷[1] 周卫平[1] 李松毅[1] 舒华忠[1] 

机构地区：[1]东南大学计算机科学与技术系,江苏南京210096

出　　处：《电子学报》2005年第7期1295-1298,共4页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60272045)

摘　　要：Zernike矩因具有正交性和旋转不变性而广泛应用于模式识别、图像分析等领域.Pseudo-Zernike矩具有与Zernike矩相似的性质,但它较Zernike矩具有更好的抗噪声性.由于pseudo-Zernike矩的复杂性,相关的快速算法的研究尚未得到很好的解决.本文根据pseudo-Zernike矩自身的特点,推导了一种快速有效的计算方法.Zemike 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-Zemike mements have similar properties as those of Zemike me ments; mereover, they are less sensitive to image noise than the conventional Zemike moments. However, the problem of fast computation of pseudo- Zemike moments has not been well solved due to the complexity of the pseudo-Zemile polynomials. In this paper, we present a novel method for fast computing the pseudo-Zemike mements.

关 键 词：ZERNIKE矩 pseudo-Zernike矩 快速算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]