节点文献
Zernike矩的快速算法
Fast algorithm for computation of Zernike moments
【摘要】 给出了Zernike矩求解的一种快速算法 .利用Zernike多项式迭代性质 ,找出了Zernike正交矩之间的内在关系 ,这样 ,高阶的Zernike矩可由低价的Zernike矩求出 ,再在Chan等人提出的关于一维几何矩有效算法的基础上 ,得出了一种快速算法 .与已有方法相比 ,该算法大大减少了求解过程中的乘法次数 ,降低了计算复杂度 ,从而提高了运算速度和效率 ;并可以有效用于模式识别、图像分析及重建等领域中
【Abstract】 By using the recursive property of Zernike polynomials, the inter relationship between Zernike moments is found, so Zernike moments of higher order could be deduced from those of lower order. Based on an efficient computation about one dimensional geometric moments suggested by Chan, a fast computation of Zernike moments is concluded, reducing significantly the number of multiplication. The application to some examples shows that it is more efficient than the existing methods, and can be used in the field of pattern recognition and image analysis.
【Key words】 Zernike polynomials; Zernike moments; orthogonal moments; fast computation;
- 【文献出处】 东南大学学报(自然科学版) ,Journal of Southeast Univwrsity(Natural Science Edition) , 编辑部邮箱 ,2002年02期
- 【分类号】TP13
- 【被引频次】52
- 【下载频次】937