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

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

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

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

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

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

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

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

基于水平集方法的抵抗几何攻击的多比特图像水印算法

提出了一种基于水平集方法的多比特顽健水印算法。该算法首先利用水平集方法在图像中确定一个稳定的图像轮廓,进而确定一个位置稳定的单位圆,然后计算这个单位圆的伪Zernike矩,利用抖动量化的方法将水印嵌入伪Zernike矩的幅值上。水印的检测过程采用均方根误差法提取出水印。克服了传统基于伪Zernike矩水印算法的缺点,同时可以很好地抵抗各种几何攻击。     

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

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

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

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

基于Tchebichef不变矩的多比特抗几何攻击图像盲水印算法

现有的大多数水印算法对旋转、平移和尺度变换等几何攻击的鲁棒性比较差,微小的几何攻击都有能导致水印检测器失效,因此水印算法对几何攻击具有鲁棒性非常重要。本文提出了一种基于Tchebichef不变矩实现的多比特几何攻击不变性图像盲水印算法。文中具体介绍了Tchebichef不变矩的构造方法,水印是事先产生的与原始图像无关的信号,嵌入过程中将水印嵌入到图像的Tchebichef不变矩中实现几何攻击不变性。水印检测过程中采用独立分量分析技术实现真正意义上的多比特水印盲检测。文中具体分析了所提出的水印算法的计算复杂度,实验过程中采用通用水印测试软件Stirmark对所提出的水印算法进行鲁棒性测试,实验数据说明这种水印算法对Stirmark具有很好的鲁棒性。     

基于图像归一化的抗几何攻击水印技术

在数字图像水印中,确保水印和图像的同步问题是水印图像有效抵抗几何攻击的关键.本文利用几何不变矩,对水印抗几何攻击进行了探讨,提出了一种基于几何不变矩的抗几何攻击的水印算法.通过对原始图像和攻击后的图像的归一化处理,使水印和图像在嵌入与提取过程保证同步.实验证明该方法对常见的几何攻击有很好的鲁棒性,嵌入的水印容量较大且水印图像的质量也较高.     

基于Krawtchouk不变矩的仿射攻击不变性局部水印算法

本文提出了一种基于原始图像Krawtchouk不变矩实现的仿射攻击不变性局部水印算法.具体介绍了Krawtchouk不变矩的构造方法,水印是事先产生的且与原始图像无关,通过将水印嵌入到图像的Krawtchouk不变矩中实现仿射攻击不变性.这种基于Krawtchouk矩的水印算法是局部水印技术,即水印的嵌入只是影响到部分原始图像,因此该算法对剪切攻击具有很好的鲁棒性.检测过程中采用独立分量分析技术实现真正意义上的盲检测.文中具体分析了所提出算法的计算复杂度,实验数据说明这种水印算法对通用水印测试软件Stirmark具有很好的鲁棒性.     

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

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

Localized affine transform resistant watermarking in region-of-interest

Many proposed image watermarking techniques are sensitive to affine transforms, such as rotation, scaling and translation. In this paper, a localized affine transform resistant watermarking is designed utilizing Krawtchouk transform and dual channel detection. Watermark is inserted into the significant Krawtchouk invariant moment. Watermarking based on Krawtchouk moments is local, which permits to the watermark to be embedded at the most significant information-wise portion. Watermark embedding intensity is modified according to the results of performance analysis. The convergence of closed loop embedding system is proved. An optimum watermark detector is designed with the introduction of dual channel detection utilizing high order spectra detection and likelihood detection. The detector extracts watermark blindly utilizing Independent Component Analysis. The computational aspects of the proposed watermarking are discussed. Experimental results demonstrate that this watermarking is robust with respect to attacks produced by watermark benchmark—Stirmark.     

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.     

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

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

A new robust digital image watermarking based on Pseudo-Zernike moments

A robust digital image watermarking scheme based on Pseudo-Zernike moments and image normalization is proposed. The goal is to resist both geometric distortion and common signals processing. We construct the geometrically invariant space by using image normalization. The Pseudo-Zernike moments of the normalized image are computed, and some low-order Pseudo-Zernike moments are selected. We embed digital watermark into the host image by quantizing the magnitudes of the selected Pseudo-Zernike moments. Numerical experiments demonstrate that the proposed watermarking scheme is robust to a wide range of geometric attacks and common signals processing.     

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.