图像挖掘中基于Zernike矩的形状特征描述与评价

在图像挖掘中，最关键的步骤是提取图像特征并对之进行描述和评价；在介绍Zernike矩的基础上，指出可以使用Zernike矩集描述图像的形状特征；根据Zernike矩逆变换，可以得到基于Zernike矩形状特征集的图像重构技术，从而通过重构图像与原图像的相异度和重构率来对Zernike矩特征集描述图像形状特征的精确度进行评价；实验结果证明了基于Zernike矩描述图像形状特征与基于图像重构进行评价的可行性。     

参数可调的通用半正交图像矩模型

目的 为了提高以正交多项式为核函数构造的高阶矩数值的稳定性,增强低阶矩抗噪和滤波的能力,将仅具有全局描述能力的常规正交矩推广到可以局部化提取图像特征的矩模型,从频率特性分析的角度定义一种参数可调的通用半正交矩模型。方法 首先,对传统正交矩的核函数进行合理的修正,以修正后的核函数（也称基函数）替代传统正交矩中的原核函数,使其成为修改后的特例之一。经过修正后的基函数可以有效消除图像矩数值不稳定现象。其次,采用时域的分析方法能够对图像的低阶矩作定量的分析,但无法对图像的高频部分（对应的高阶矩）作更合理的表述。因此提出一种时—频对应的方法来分析和增强不同阶矩的稳定性,通过对修正后核函数的频带宽度微调可以建立性能更优的不同阶矩。最后,利用构建的半正交—三角函数矩研究和分析了通用半正交矩模型的特点及性质。结果 将三角函数为核函数的图像矩与现有的Zernike、伪Zernike、正交傅里叶—梅林矩及贝塞尔—傅里叶矩相比,由于核函数组成简单,且其值域恒定在[-1,1]区间,因此在图像识别领域具有更快的计算速度和更高的稳定性。结论 理论分析和一系列相关图像的仿真实验表明,与传统的正交矩相比,在数值稳定性、图像重构、图像感兴趣区域（ROI）特征检测、噪声鲁棒性测试及不变性识别方面,通用的半正交矩性能及效果更优。     

Fast computation of exact Zernike moments using cascaded digital filters

Zernike moments have been extensively used and have received much research attention in a number of fields: object recognition, image reconstruction, image segmentation, edge detection and biomedical imaging. However, computation of these moments is time consuming. Thus, we present a fast computation technique to calculate exact Zernike moments by using cascaded digital filters. The novelty of the method proposed in this paper lies in the computation of exact geometric moments directly from digital filter outputs, without the need to first compute geometric moments. The mathematical relationship between digital filter outputs and exact geometric moments is derived and then they are used in the formulation of exact Zernike moments. A comparison of the speed of performance of the proposed algorithm with other state-of-the-art alternatives shows that the proposed algorithm betters current computation time and uses less memory.     

Invariant image recognition by Zernike moments

The problem of rotation-, scale-, and translation-invariant recognition of images is discussed. A set of rotation-invariant features are introduced. They are the magnitudes of a set of orthogonal complex moments of the image known as Zernike moments. Scale and translation invariance are obtained by first normalizing the image with respect to these parameters using its regular geometrical moments. A systematic reconstruction-based method for deciding the highest-order Zernike moments required in a classification problem is developed. The quality of the reconstructed image is examined through its comparison to the original one. The orthogonality property of the Zernike moments, which simplifies the process of image reconstruction, make the suggest feature selection approach practical. Features of each order can also be weighted according to their contribution to the reconstruction process. The superiority of Zernike moment features over regular moments and moment invariants was experimentally verified     

几何误差和数值误差最小化的Zernike矩

形状特征提取和表示是基于内容图像检索的重要研究内容之一.提出一种几何误差和数值误差最小化的Zernike矩方法,并且把这种方法应用于形状特征提取和表示.该方法把图像中的兴趣区域映射到单位圆里,通过计算变换后图像在Zernike多项式上的投影来取得Zernike矩,并且通过把心理生理学的研究成果引入Zernike矩的计算过程来提高系统的检索性能.通过实验对传统Zernike矩方法、几何误差和数值误差最小化的Zernike矩方法进行了比较,发现从重构角度采用几何误差和数值误差最小化的Zernike矩方法优于采用传统Zernike矩方法.而从检索角度采用几何误差和数值误差最小化的Zernike矩方法的系统比采用传统Zernike矩方法的系统具有更好的检索性能.     

基于Zernike矩和NSCT-SVD的数字水印算法研究

以非下采样Contourlet变换、奇异值分解以及Zernike 矩知识为基础,结合图像不变质心在几何攻击前后相对位置不变的特性和Zernike 矩对旋转、缩放攻击的不变性以及对噪声不敏感的特性,提出了一种利用 Zernike 矩对图像几何校正的 NSCT-SVD几何鲁棒盲水印算法。该方案中宿主图像通过非下采样 Contourlet变换分解提取出低频区域,通过量化每块奇异值矩阵的欧氏范数来嵌入水印。水印检测时,先利用Zernike 矩和不变质心等几何参数对被检测图像进行几何攻击校正,恢复水印的同步信息后再提取水印。实验结果表明,该算法对噪声、滤波、压缩以及各类几何攻击具有较好的鲁棒性。     

改进后的Zernike矩在文物图像检索中的应用

Zernike矩作为一种基于区域的形状描述子,具有良好的旋转不变性,能够很好地提取图像内部的形状信息,广泛应用于基于内容的图像检索(CBIR)、图像描述、物体定向及模式识别等各个领域.介绍了Zernike矩的定义和基本特性,并对Zernike矩算法提出了改进,使其具有较好的比例不变性,最后讨论了Zernike矩在基于内容的文物图像检索系统中的应用,同时给出部分实验数据和实验结果.     

A novel approach to the fast computation of Zernike moments

This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction of the complexity of the computation of the 2-D Zernike basis functions. As Zernike basis functions have specific symmetry or anti-symmetry about the x-axis, the y-axis, the origin, and the straight line y=x, we can generate the Zernike basis functions by only computing one of their octants. As a result, the proposed method makes the computation time eight times faster than existing methods. The proposed method is applicable to the computation of an individual Zernike moment as well as a set of Zernike moments. In addition, when computing a series of Zernike moments, the proposed method can be used with one of the existing fast methods for computing Zernike radial polynomials. This paper also presents an accurate form of Zernike moments for a discrete image function. In the experiments, results show the accuracy of the form for computing discrete Zernike moments and confirm that the proposed method for the fast computation of Zernike moments is much more efficient than existing fast methods in most cases.     

基于修改的Zernike矩的抗几何攻击的数字水印方法

利用图像Zernike矩的幅度具有旋转不变的性质,提出了一种抗几何攻击的图像盲水印算法.算法首先对载体图像进行分块,计算子图像的Zernike矩后将其进行正则化,对正则化后的Zernike矩进行筛选,根据水印信息对选中的Zernike矩进行修改,并对差矢量进行Zernike矩重构,通过将重构的图像在空域迭加到原始子图像中实现水印的嵌入.该算法在抽取水印时不需要原始载体图像和原始水印.实验结果表明,该算法能够抵抗旋转、缩放攻击、裁剪攻击、JPEG压缩、噪声、滤波等常规攻击.     

A novel algorithm for fast computation of Zernike moments

Zernike moments (ZMs) have been successfully used in pattern recognition and image analysis due to their good properties of orthogonality and rotation invariance. However, their computation by a direct method is too expensive, which limits the application of ZMs. In this paper, we present a novel algorithm for fast computation of Zernike moments. By using the recursive property of Zernike polynomials, the inter-relationship of the Zernike moments can be established. As a result, the Zernike moment of order n with repetition m, Z_nm, can be expressed as a combination of Z_n−2,m and Z_n−4,m. Based on this relationship, the Zernike moment Z_nm, for n>m, can be deduced from Z_mm. To reduce the computational complexity, we adopt an algorithm known as systolic array for computing these latter moments. Using such a strategy, the multiplication number required in the moment calculation of Z_mm can be decreased significantly. Comparison with known methods shows that our algorithm is as accurate as the existing methods, but is more efficient.     

伪Zernike矩不变性分析及其改进研究

伪 Zernike矩是基于图象整个区域的形状描述算子 ,而基于轮廓的形状描述子 ,例如曲率描述子、傅立叶描述子和链码描述子等是不能正确描述由几个不连接区域组成的形状的 ,因为这些算子只能描述单个的轮廓形状 .同时 ,由于伪 Zernike矩的基是正交径向多项式 ,和 Hu矩相比 ,除了具有旋转不变性、高阶矩和低阶矩能表达不同信息等特征外 ,还具有冗余性小、可以任意构造高阶矩等特点 ,另外 ,伪 Zernike矩还可以用于目标重构 .目前 ,伪 Zernike矩没有得到广泛的应用 ,其中的一个主要原因是 ,它不具备真正意义上的比例不变性 .为了能使伪Zernike矩得到更广泛的应用 ,在详细分析伪 Zernike矩不变性的基础上 ,提出了伪 Zernike矩的改进方法 ,使改进后的伪 Zernike矩在保持旋转不变性的同时 ,还具有真正意义上的比例不变性 ,同时给出了部分的实验分析结果 .实验结果证明 ,该改进后的伪 Zernike矩较改进前的伪 Zernike矩 ,具有更好的旋转和比例不变性 .     

A systematic method for efficient computation of full and subsets Zernike moments

A new method is proposed for fast and accurate computation of Zernike moments. This method presents a novel formula for computing exact Zernike moments by using exact complex moments where the exact values of complex moments are computed by mathematical integration of the monomials over digital image pixels. The proposed method is applicable to compute the full set of Zernike moments as well as the subsets of individual order, repetition and an individual moment. A comparison with other conventional methods is performed. The results show the superiority of the proposed method.     

Fast computation of accurate Zernike moments

Zernike polynomials are continuous orthogonal polynomials defined in polar coordinates over a unit disk. Zernike moment’s computation using conventional methods produced two types of errors namely approximation and geometrical. Approximation errors are removed by using exact Zernike moments. Geometrical errors are minimized through a proper mapping of the image. Exact Zernike moments are expressed as a combination of exact radial moments, where exact values of radial moments are computed by mathematical integration of the monomial polynomials over digital image pixels. A fast algorithm is proposed to accelerate the moment’s computations. A comparison with other conventional methods is performed. The obtained results explain the superiority of the proposed method.     

Practical fast computation of Zernike moments

The fast computation of Zernike moments from normalized gometric moments has been developed in this paper,The computation is multiplication free and only additions are needed to generate Zernike moments .Geometric moments are generated using Hataming‘s filter up to high orders by a very simple and straightforward computaion scheme.Other kings of monents(e.g.,Legendre,pseudo Zernike)can be computed using the same algorithm after giving the proper transformaitons that state their relations to geometric moments.Proper normaliztions of geometric moments are necessary so that the method can be used in the efficient computation of Zernike moments.To ensure fair comparisons,recursive algorithms are used to generate Zernike polynoials and other coefficients.The computaional complexity model and test programs show that the speed-up factor of the proposed algorithm is superior with respect ot other fast and /or direct computations It perhaps is the first time that Zernike moments can be computed in real time rates,which encourages the use of Zernike moment features in different image retrieval systems that support huge databases such as the XM experimental model stated for the MPEG-7 experimental core.It is concluded that choosing direct copmutation would be impractical.     

一种新的基于伪Zernike矩的图像盲水印算法

抵抗几何攻击的鲁棒性是目前数字水印技术中的热点也是难点。提出一种新的基于伪Zernike矩的图像盲水印算法,首先计算图像归一化后的伪Zernike矩,然后选取部分合适的矩通过量化调制嵌入水印信息。水印提取时,利用伪Zernike矩的相位信息估计旋转角度进行几何校正,以提高矩的几何不变性。实验结果表明,本算法对于抗几何攻击尤其是旋转攻击具有很好的鲁棒性,同时也能抵抗常规的信号处理攻击。