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

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

基于SIFT特征点的抗几何攻击水印算法

提出了一种基于尺度不变特征变换(SIFT)和伪Zernike矩的抗几何攻击的鲁棒水印算法。首先,利用SIFT算法从载体图像中提取稳定的特征点;然后,根据特征尺度和方向自适应地确定每个局部特征区域大小和方向;最后,从中选择具有较大特征尺度互不重叠的特征区域,并利用量化调制伪Zernike矩幅值方法将水印嵌入到每个局部特征区域内。仿真实验结果表明,该算法不仅具有良好的透明性,而且具有较强的抵抗常规信号处理和几何攻击的能力。     

基于Harris特征点和伪Zernike矩的鲁棒水印算法

抵抗几何攻击的鲁棒性是目前数字水印技术中的热点亦是难点。文中以Harris检测算子和伪Zernike矩为理论基础,提出一种有效抵抗几何攻击的鲁棒水印算法。通过提取归一化图像的Harris特征点,选取部分稳定特征点确定圆形区域并计算伪Zernike矩,并量化调制伪Zernike矩的幅值来嵌入水印信息。实验结果表明,本算法对于抗几何攻击具有较好的鲁棒性,同时也能抵抗常规的信号处理攻击。     

基于Blob-Harris特征区域和NSCT-Zernike的鲁棒水印算法

为了有效抵抗水印图像的几何攻击,该文提出了一种基于Blob-Harris特征区域和非下采样轮廓波变换(NSCT)和伪Zernike矩的鲁棒水印算法。首先原始图像进行两层非下采样Contourlet变换后提取其低频图像,然后利用Blob-Harris检测算子对低频图像进行特征点提取,根据各个特征点的特征尺度确定其特征区域,优化筛选出稳定且互不重叠的特征区域并将其四周补零,得到稳定的互不重叠的方形特征区域作为水印嵌入区域,最后计算每一个方形特征区域的Zernike矩,将水印信息嵌入在量化调制正则化Zernike矩的幅值当中。实验结果表明,Lena图峰值信噪比达到40 dB以上时,本文算法对常规图像处理以及缩放、旋转、剪切等几何攻击和组合攻击都有相对较强的鲁棒性。     

基于Blob-Harris特征区域和NSCT-Zernike的鲁棒水印算法

为了有效抵抗水印图像的几何攻击,该文提出了一种基于Blob-Harris特征区域和非下采样轮廓波变换(NSCT)和伪Zernike矩的鲁棒水印算法.首先原始图像进行两层非下采样Contourlet变换后提取其低频图像,然后利用Blob-Harris检测算子对低频图像进行特征点提取,根据各个特征点的特征尺度确定其特征区域,优化筛选出稳定且互不重叠的特征区域并将其四周补零,得到稳定的互不重叠的方形特征区域作为水印嵌入区域,最后计算每一个方形特征区域的Zernike矩,将水印信息嵌入在量化调制正则化Zernike矩的幅值当中.实验结果表明,Lena图峰值信噪比达到40 dB以上时,本文算法对常规图像处理以及缩放、旋转、剪切等几何攻击和组合攻击都有相对较强的鲁棒性.     

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

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

基于鲁棒特征的光流研究

光流是动态景象分析的重要步骤,光流是指图像亮度模式的视在运动.多数光流算法依赖于亮度恒定原则,然而由于传感器噪声和不一致的亮度条件,常常不满足亮度恒定要求,为此,提出一种基于鲁棒亮度特征的伪Zernike矩的光流算法,鲁棒亮度特征比亮度更能保持恒定,伪Zernike矩反映局部图像亮度分布,作为光流方程的不变特征.实验结果表明算法性能优于其他经典算法.     

基于伪Zernike旋转矩的低剂量CT图像重建方法

本文提出了一种基于伪Zernike旋转矩的低剂量CT(Com puted Tomography)图像重建新方法,该方法首先构建了扇形束投影数据和伪Zernike旋转矩之间的关系,然后利用这种关系从已知投影数据中估计出未知投影数据,从而达到在低剂量放射线条件下提高重建图像质量的目的。实验证明,新方法可以有效地估计出未知投影数据,并能获得更好的重建结果。     

Zernike矩结合Sobel算子的边缘检测

提出了一种亚像素级的噪声图像边缘检测算法。首先使用基于各向异性扩散的非线性正则化Perona-Malik模型,实现对图像的平滑滤波;然后用改进的Sobel算子对图像进行初步边缘检测,将检测到的包括真正的和少数伪边缘点的坐标生成链表记录下来,原灰度图像保留;最后利用Zernike矩进行亚像素级的边缘精确定位。实验结果表明,此算法解决了传统算法中伪边缘点过多和边缘检测结果较宽的问题,图像的质量接近于定位准确度为亚像素级的小波算法。     

一种基于Krawtchouk矩的视频水印算烦

针对现有视频水印算法很少考虑视频帧中确定的目标区域这一问题,提出一种基于Krawtchouk矩的视频水印算法(KVW).该算法利用Krawtchouk矩的目标区域提取能力,选取视频I帧中较为重要的信息区域作为水印的嵌入域.结合Krawtchouk低阶矩对剪切攻击的鲁棒性以及视频帧间相似度较高的特点,选择I帧和相邻P帧中相对稳定的低阶Krawtchouk矩作为最优矩集合.根据随机水印比特自适应地修改集合中的矩,并对差矢量进行Krawtchouk矩重构,通过将差值图像在空域迭加到I帧嵌入水印.水印检测时,首先计算受攻击I帧的Krawtchouk矩,以最优矩集合作为密钥,用相邻P帧Krawtchouk矩替代原始I帧数据提取水印,改善算法对原始数据的依赖性.实验结果表明,KVW算法在保证获得很好图像质量的同时,能够很好地抵抗帧剪切攻击以及常规的信号处理.     

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

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

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.     

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

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

Quaternion pseudo-Zernike moments combining both of RGB information and depth information for color image splicing detection

The quaternion representation (QR) used in current quaternion-based color image processing creates redundancy when representing a color image of three components by a quaternion matrix having four components. In this paper, both RGB and depth (RGB-D) information are considered to improve QR for efficiently representing RGB-D images. The improved QR fully utilizes the four-dimensional quaternion domain. Using this improved QR, firstly we define the new quaternion pseudo-Zernike moments (NQPZMs) and then propose an efficient computational algorithm for NQPZMs through the conventional pseudo-Zernike moments (PZMs). Finally, we propose an algorithm for color image splicing detection based on the NQPZMs and the quaternion back-propagation neural network (QBPNN). Experimental results on four public datasets (DVMM, CASIA v1.0 and v2.0, Wild Web) demonstrate that the proposed splicing detection algorithm can achieve almost 100% accuracy with the appropriate feature dimensionality and outperforms 14 existing algorithms. Moreover, the comparison of six color spaces (RGB, HSI, HSV, YCbCr, YUV, and YIQ) shows that the proposed algorithm using YCbCr color space has the overall best performance in splicing detection.     

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.     

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.     

Geometrically robust image watermarking based on Jacobi-Fourier moments

Rotation, scaling and translation （RST） attacks can desynehronize the watermark detection so that many watermark systems failed. A geometrically robust image watermarking strategy based on Jacobi-Fourier moments （JFMs） is proposed. The Jacobi moments of the original image are first extracted as original moments; then the watermark image is embedded into the global or local area of the original image, and the Jacobi moments of the area are extracted. When the watermarked image is not attacked, the watermark can be retrieved by using the margin of the original moments and the moments of the embedded area. When it is attacked, the watermark can also be got in that way, and the original moments need to be transformed. It can be concluded that Jacobi- Fourier moments perform better than Zemike moments （ZMs） for small images. Meanwhile, the watermark is also robust to scaling and rotation as well as regular attacks such as added noises.     

一种基于小波变换的盲水印算法

提出了一种基于小波变换的盲水印算法，根据各个层次相应位置的小波系数排序情况和密钥中{1}元素的位置来决定水印嵌入的位置，在水印提取时根据密钥中{1}的位置可以实现盲水印提取，实验证明具有较好的效果。