一种快速计算Zernike矩的混合算法

A hybrid algorithm of fast computing Zernike moments

提取傅里叶-梅林矩作为Zernike矩的公共项,将Zernike矩表示为该公共项的线性组.通过研究Zerni-ke核多项式与傅里叶函数的对称性,将图像区域分成8个区域,只以一个区域的Zernike基函数的值代替其他7个区域基函数的值.而且Zernike多项式的系数具有迭代性.综合这3项技术,本文提出了一种快速计算Zernike矩的混合算法.根据对256 bit色灰度图像的实验结果表明该方法明显优于现有方法.

Zernike moments are useful tools in pattern recognitior, and image analysis due to their perfect feature capability and high noise resistance. However, direct computation of Zernike moments is very expensive, limiting their use as feature descriptors especially at high orders. In this paper, we propose a hybrid algorithm, which re-organize Zernike moments with any order and repetition as a linear combination of Fourier-Mellin moments, to calculate Zernike moments of high orders fast. Two properties, which are symmetry and the recursive relations of the coefficients of Zernike polynomials, are applied to the computation of Fourier-Mellin moments to reduce their computational cost. Experimental results reveal that the proposed method is more efficient than the other methods.