电子学报 ›› 2005, Vol. 33 ›› Issue (7): 1295-1298.

• 论文 • 上一篇    下一篇

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

夏婷, 周卫平, 李松毅, 舒华忠   

  1. 东南大学计算机科学与技术系,江苏南京 210096
  • 收稿日期:2004-10-26 修回日期:2005-04-08 出版日期:2005-07-25 发布日期:2005-07-25

A Novel Algorithm for Fast Computation of Pseudo-Zernike Moments

XIA Ting, ZHOU Wei-ping, LI Song-yi, SHU Hua-zhong   

  1. Department of Computer Science and Technology,Southeast University,Nanjing,Jiangsu 210096,China
  • Received:2004-10-26 Revised:2005-04-08 Online:2005-07-25 Published:2005-07-25

摘要: Zernike矩因具有正交性和旋转不变性而广泛应用于模式识别、图像分析等领域.Pseudo-Zernike 矩具有与Zernike 矩相似的性质,但它较Zernike 矩具有更好的抗噪声性.由于pseudo-Zernike矩的复杂性,相关的快速算法的研究尚未得到很好的解决.本文根据pseudo-Zernike矩自身的特点,推导了一种快速有效的计算方法.

关键词: Zernike矩, pseudo-Zernike矩, 快速算法

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.

Key words: zernike moments, pseudo-zernike moments, fast algorithm

中图分类号: