基于多尺度分析矩特征的人脸表情识别

Zernike不变矩具有对噪声不敏感,正交等特性,是表情的有效表征方法,高阶Zernike矩包含更多图像信息,对表情分类的作用更大.但是高阶矩的计算复杂度很大,很难达到快速表情识别的要求.本文利用小波变换对表情图像进行多尺度分析,从低频子图像中计算其Zernike矩作为判别特征进行表情识别.通过小波变换,一方面可以对图像降维,降低计算复杂度;另一方面,小波变换的去噪性能使得识别效果更好.实验表明,基于多尺度分析Zernike矩特征的方法优于单独使用小波变换或Zernike矩特征方法的识别效果.     

基于局部Zernike矩的RST不变水印

旋转、缩放和平移(RST)等几何攻击能够破坏水印检测的同步性,而使常规水印检测失败,提出了一种基于图像局部Zernike矩的RST不变水印算法.利用图像归一化后的Zernike矩幅度具有RST不变的性质,将由Zernike矩重构的水印图像在空域嵌入原始图像的局部中,并提取该区域的Zernike矩幅度矢量作为水印矢量.水印检测时,计算局部区域的Zernike矩,并与已知Zernike矩矢量计算均方误差根(RMSE)判断水印存在与否.与使用图像全局Zernike矩相比,使用局部矩使得水印具有更好的旋转不变性,同时水印对于缩放、JPEG压缩和噪声等攻击也具有较好的检测性能.     

Zernike矩不变性分析及其改进

在分析了Zernike矩不变性后,提出了一种基于图像整个区域形状描述算子的改进Zernike矩。改进的Zernike矩不仅具有旋转不变性,而且还具有改进前不具有的比例不变性。试验结果证明,和改进前的Zernike矩相比,改进后的Zernike矩具有更好的不变特征,可用作基于区域的形状描述算子。     

神经网络与Zernike矩在字符识别中的应用研究

本文介绍了Zernike矩的理论,并将其与神经网络相结合,运用于字符图形的识别中去.并从理论和实验两个方面证实Zernike矩的识别效果优于空间几何矩.     

一种基于Zemike矩和稳态遗传算法的遥感图像匹配方法

该文提出了一种基于稳态遗传算法和Zernike矩的遥感图像匹配方法。将稳态遗传算法快速而有效的全局寻优特点应用于遥感图像的匹配定位。考虑到旋转畸变,采用遥感图像的Zernike矩作为相似性量度,实现遥感图像的匹配。实验结果表明,该算法可以克服图像的旋转畸变,在保证一定的匹配精度下,具有较高的匹配效率。     

基于伪Zernike矩的抗几何攻击图像水印

针对几何攻击容易使常规水印算法检测失败的问题,利用图像伪Zernike矩的幅度具有旋转不变的性质,提出了一种抗几何攻击图像水印算法(GWPZM).首先计算图像的伪Zernike矩,选择适宜于嵌入水印的矩进行幅度改变量测试.筛选出最优矩集合,根据水印比特自适应地修改集合中的矩,并对差矢量进行伪Zernike矩重构,通过将重构图像在空域迭加到原始图像中嵌入水印.水印检测时,首先计算受攻击图像的伪Zernike矩,以最优矩集合作为密钥,通过与原始图像比较矩的幅度提取水印.实验结果表明,GWPZM算法能够抵抗旋转、缩放攻击、二者组合攻击以及JPEG压缩、噪声等常规攻击.     

基于Zernike矩的低信噪比红外目标检测方法

针对低信噪比红外目标图像,分析了Zernike矩的基本原理、计算方法和旋转不变性,提出了基于Zernike正交矩的低信噪比红外目标检测方法,并比较了模板匹配、Hu矩、Zernike矩方法的目标识别效果.理论分析与实验验证了所提方法的有效性.     

利用Zernike矩对心脏超声图进行光流场计算的邻域优化算法

本文针对心脏超声图的特性 ,介绍了一种计算二维光流场的邻域优化算法 ,通过对Zernike矩的正交性、旋转不变性等特性的分析 ,论证了Zernike矩在心脏超声图中作为运动不变特征的优越性 ,从而将传统光流场计算中的亮度不变假设推广到了亮度各阶Zernike矩不变 .另外 ,由于Zernike矩计算了像素点附近其余像素的贡献 ,使得单个像素点引起的误差对特征的影响大大减小 ,从而提高了算法的鲁棒性     

基于等积环投影与Zernike矩的快速模板匹配

为增强工业级机器视觉系统的实时性和稳定性,本文提出一种基于等积环投影与Zernike矩的具有旋转不变性的快速模板匹配方法,该方法采用由粗到精匹配策略,在粗匹配阶段以等积环投影向量作为特征进行匹配得到候选点集,再基于Zenrike矩进行精确匹配.主要创新点为提出复杂度低、抗噪性强和具有旋转不变性的等积环投影向量特征,并利用圆对称性在八分圆法基础上进一步降低Zernike矩计算量.经理论分析和实验对比验证,此法在保障匹配精度前提下,其匹配速度胜于当前同类最优算法,且对高斯噪声及线性亮度变化有强鲁棒性.     

利用Zernike矩对心脏超声图进行光流场计算的领域优化算法

本文针对心脏超声图的特性,介绍了一种计算二维光流场的领域优化算法,通过对Zernike矩的正交性、旋转不变必等特性的分析,论证了Zernike矩的在心脏超声图中作为运动不变特征的优越性,从而将传统光流场计算中的亮度不变假设推广到了亮度各阶Zernike矩不变。另外,由于Zernike矩计算了像素点附近其余像素的贡献,使得单个像素点引起的误差对特征的影响大大减小,从而提高了算法的鲁棒性。     

Exact Zernike and pseudo-Zernike moments image reconstruction based on circular overlapping blocks and Chamfer distance

This study aims to explore a novel approach to reconstruct multi-gray-level images based on circular blocks reconstruction method using two exact and fast moments: Zernike (CBR-EZM) and pseudo-Zernike (CBR-EPZM): An image is first divided into a set of sub-images which are then reconstructed independently. We also introduced Chamfer distance (CD) to capitalize on the use of discrete distance instead of Euclidean one. The combination of our methods and CD leads to CBR-EZM-CD and CBR-EPZM-CD methods. Obviously, image partitioning offers significant advantages, but an undesirable circular blocking effect can occur. To mitigate this effect, we have implemented overlapping feature to our new methods leading to OCBR-EZM-CD and OCBR-EPZM-CD, by exploiting neighborhood information of the circular blocks. The main motivation of this novel approach is to explore new applications of Zernike and pseudo-Zernike moments. One of the fields is feature extraction for pattern recognition: Zernike and pseudo-Zernike moments are well known to capture only the global features, but thanks to the circular block reconstruction, we can now use those moments to extract also local features.     

Generic radial orthogonal moment invariants for invariant image recognition

As the variation of parameters in Jacobi polynomial, Jacobi–Fourier moments can form various types of orthogonal moments: Legendre–Fourier moments, Orthogonal Fourier–Mellin moments, Zernike moments, pseudo-Zernike moments, and so on. In this paper, we present a generic approach based on Jacobi–Fourier moments for scale and rotation invariant analysis of radial orthogonal moments, named Jacobi–Fourier moment invariants (JFMIs). It provides a fundamental mathematical tool for invariant analysis of the radial orthogonal moments since Jacobi–Fourier moments are the generic expressions of radial orthogonal moments. Theoretical and experimental results also show the superiority of the proposed method and its robustness to noise in comparison with some exist methods.     

Image analysis by Krawtchouk moments

A new set of orthogonal moments based on the discrete classical Krawtchouk polynomials is introduced. The Krawtchouk polynomials are scaled to ensure numerical stability, thus creating a set of weighted Krawtchouk polynomials. The set of proposed Krawtchouk moments is then derived from the weighted Krawtchouk polynomials. The orthogonality of the proposed moments ensures minimal information redundancy. No numerical approximation is involved in deriving the moments, since the weighted Krawtchouk polynomials are discrete. These properties make the Krawtchouk moments well suited as pattern features in the analysis of two-dimensional images. It is shown that the Krawtchouk moments can be employed to extract local features of an image, unlike other orthogonal moments, which generally capture the global features. The computational aspects of the moments using the recursive and symmetry properties are discussed. The theoretical framework is validated by an experiment on image reconstruction using Krawtchouk moments and the results are compared to that of Zernike, pseudo-Zernike, Legendre, and Tchebyscheff moments. Krawtchouk moment invariants are constructed using a linear combination of geometric moment invariants; an object recognition experiment shows Krawtchouk moment invariants perform significantly better than Hu's moment invariants in both noise-free and noisy conditions.     

基于兴趣点伪泽尼克矩的图像拼接

针对基于特征匹配的传统图像拼接方法对旋转和噪声敏感的问题,提出了一种基于兴趣点伪泽尼克(Zernike)矩的图像自动拼接技术.利用哈里斯(Harris)角检测器获取图像中的兴趣点,计算以兴趣点为中心邻域窗口的伪泽尼克矩,通过比较各个兴趣点邻域伪泽尼克矩的欧氏距离提取出初始特征点对,根据几何变换模型剔除伪特征点对,最后利用得到的几何变换模型,对输入图像进行几何变换后将两幅图像间的重叠区域进行图像融合,完成图像的拼接.实验表明,该方法对平移、任意角度的旋转以及噪声均具有鲁棒性,对于具有小尺度变换(小于1.5)的图像仍然具有很好的拼接效果.     

高速的9×9尺寸模板Zernike矩边缘算子

根据Zernike矩基本原理,提出了基于9×9模板尺寸的Zernike矩边缘算子。首先推导Zernike矩模板计算过程,然后计算出2个9×9模板,并选取二值图像和经过5次平滑的模糊图像为对象对新算子进行了测试。结果表明:对于理想的二值图像,新算子具有较强的边缘细化能力,且边缘检测精度也较高;而对于模糊图像,虽然新算子的边缘检测效果也较好,但应注意边缘图像表征与亚像素坐标数据间存在不一致的现象。最后,采用先粗后精定位思想,使新算子的运算速度大幅提高,耗时仅为0.19s。