A hierarchical digital watermarking method for image tamper detection and recovery

In this paper, we present an efficient and effective digital watermarking method for image tamper detection and recovery. Our method is efficient as it only uses simple operations such as parity check and comparison between average intensities. It is effective because the detection is based on a hierarchical structure so that the accuracy of tamper localization can be ensured. That is, if a tampered block is not detected in level-1 inspection, it will be detected in level-2 or level-3 inspection with a probability of nearly 1. Our method is also very storage effective, as it only requires a secret key and a public chaotic mixing algorithm to recover a tampered image. The experimental results demonstrate that the precision of tamper detection and localization is 99.6% and 100% after level-2 and level-3 inspection, respectively. The tamper recovery rate is better than 93% for a less than half tampered image. As compared with the method in Celik et al. [IEEE Trans. Image Process. 11(6) (2002) 585], our method is not only as simple and as effective in tamper detection and localization, it also provides with the capability of tamper recovery by trading off the quality of the watermarked images about 5 dB.     

A novel hash function based fragile watermarking method for image integrity

In recent years, tampering and altering of digital images have become easier with the rapid development of computer technologies such as digital image editing tools. Therefore, verification of image integrity and tamper detection of digital images have become a great challenge. Fragile watermarking is the most widely used method for protecting the integrity and content authenticity of the image. In this paper, by using SHA-256 hash function, a novel block based fragile watermark embedding and tamper detection method is proposed. In watermark embedding phase, host image is divided into 32?×?32 non-overlapped blocks. Each 32?×?32 block is then divided into four 16?×?16 nonoverlapped sub-blocks. The entire hash value of the first three sub-blocks is generated as a watermark using SHA-256 hash function. The generated 256-bit binary watermark is embedded into the least significant bits (LSBs) of the fourth sub-block and watermarked image is obtained. In tamper detection phase, the detection of tampered block has been performed by comparing the hash value obtained from the three sub-blocks with the extracted watermark from the fourth sub-block of the watermarked image. The performance of the proposed method has been evaluated by applying linear and nonlinear attacks to the different regions of the watermarked images. Experimental results show that the proposed method detects all the tampered regions of the attacked images and high visual quality of watermarked images has been obtained.

     

极坐标下的空域水印算法研究

由于空间域嵌入的水印对旋转和缩放攻击相当脆弱,本文提出一种新的水印算法。将原图像和水印图像进行对数极变换,将变换后的水印图像嵌入到变换后的原图像中,然后再反变换为直角坐标系下的图像。水印嵌入到图片的位置不同,检测的水印图像发生变化。本文提出三种嵌入位置的方案,显示不同的效果。检测水印时,对几何攻击过的水水印进行几何校正,然后与原图像相减得到水印。这种水印方案能够很好地抵抗几何攻击。     

Fragile image watermarking using a gradient image for improved localization and security

A fragile watermarking algorithm for image authentication and tamper detection is proposed. It uses a gradient image and its structure to achieve localization and security requirements. It provides superior localization with greater security against many attacks including vector quantization attack.     

基于混沌和脆弱水印的图像篡改检测算法

针对现有基于脆弱水印方法的不足,提出了一种新的结合混沌系统和脆弱水印的图像篡改检测算法。算法首先利用Arnold cat映射对原始图像进行k次置乱,然后选取置乱图像的最低有效位(LSB)平面作为水印嵌入位置,实际嵌入的水印由Logistic混沌映射产生的随机二进制序列与原始水印异或得到,通过LSB替换算法嵌入。最后对LSB替换后图像进行T-k次的Arnold cat映射得到水印图像。实验结果表明,混沌系统的引入大大增强了脆弱水印的安全性;另外,针对不同种类的攻击,算法具有良好的篡改检测和定位精确性。     

抗旋转的整数小波变换数字水印算法

现有的大多数基于小波变换的水印算法没有抵抗几何攻击的能力，例如将图像旋转微小的角度即可导致水印检测的失败。为了提高基于小波变换的水印算法抵抗图像旋转攻击的能力，提出了一种抗旋转的整数小波变换盲水印算法。该算法通过在嵌人水印后的图像中嵌人一个模板，在图像遭到旋转攻击后，利用模板能有效地恢复图像，达到水印提取同步，从而准确地提取出水印。实验结果表明，0到360度的旋转攻击均能被准确监测到，从而证明了该方法是一种鲁棒的能有效抵抗旋转攻击的图像水印算法。     

抗旋转的整数小波变换数字水印算法

现有的大多数基于小波变换的水印算法没有抵抗几何攻击的能力,例如将图像旋转微小的角度即可导致水印检测的失败。为了提高基于小波变换的水印算法抵抗图像旋转攻击的能力,提出了一种抗旋转的整数小波变换盲水印算法。该算法通过在嵌入水印后的图像中嵌入一个模板,在图像遭到旋转攻击后,利用模板能有效地恢复图像,达到水印提取同步,从而准确地提取出水印。实验结果表明,0到360度的旋转攻击均能被准确监测到,从而证明了该方法是一种鲁棒的能有效抵抗旋转攻击的图像水印算法。     

基于残差学习的新型不可感知水印攻击方法

传统的水印攻击方法虽然能够干扰水印信息的正确提取, 但同时会对含水印图像的视觉质量造成较大损失, 为此提出了一种基于残差学习的新型不可感知水印攻击方法. 首先, 通过构建基于卷积神经网络的水印攻击模型, 在含水印图像和无水印图像之间进行端到端非线性学习, 完成含水印图像映射到无水印图像的任务, 达到水印攻击的目的; 其次, 根据水印信息的嵌入区域选择合适数目的特征提取块以提取含水印信息的特征图. 鉴于含水印图像和无水印图像之间的差异过小, 水印攻击模型在训练过程中的可学习性受到限制, 导致模型很难收敛. 引入残差学习机制来提升水印攻击模型的收敛速度和学习能力, 通过减少残差图像(含水印图像和提取的特征图像做差)与无水印图像之间的差异来提升被攻击图像的不可感知性. 此外, 还根据DIV2K2017超分辨率数据集以及所攻击的基于四元数指数矩的鲁棒彩色图像水印算法构建了训练水印攻击模型的数据集. 实验结果表明该水印攻击模型能够在不破坏含水印图像视觉质量的前提下以高误码率实现对鲁棒水印算法的攻击.     

结合汉明码和图像矫正的彩色图像盲水印

目的 随着互联网技术的飞速发展,彩色数字图像带来极大便利的同时,也产生了一些篡改、剽窃等侵权行为;同时,几何处理对含水印载体的破坏使水印盲检测的难度增加,因此,本文提出一种基于汉明码和图像矫正的彩色图像盲水印方法,旨在解决当前图像版权保护的难点问题。方法 嵌入水印时,使用仿射变换加密彩色水印,并将已加密的信息编为汉明码,然后利用特征值分解计算出像素块的全部特征值,并通过对特征值绝对值的和进行量化来完成水印的嵌入;提取水印时,利用图像的几何属性对多种几何攻击后的图像进行判断、矫正,并借助量化技术提取水印。结果 基于彩色图像标准数据库,将本文方法与7种相关方法进行了对比实验：在不可见性方面,与LU分解的水印方法相比,本文算法峰值信噪比（peak signal-to-noise ratio,PSNR）提高了4 dB;在常规攻击鲁棒性方面,与Schur分解的最新方法相比,本文算法平均归一化互相关（normalized cross-correlation,NC）的值稍有提高;在几何攻击鲁棒性方面,本文算法NC值具有一定的优势;同时,本文算法的水印容量达到了0.25 bit/像素,密钥空间达到了2⁴³²,运行时间仅需3 s左右。结论 所提方法不仅具有较好的水印不可见性和较强的鲁棒性,而且具有较大的水印容量、较高的安全性和实时性。     

基于RS码的二值图像认证及篡改定位算法

用于二值图像内容认证和篡改定位的数字水印技术具有重要的实际价值,但却面临着二值图像像素单一、嵌入容量有限且分布不均匀等问题.根据纠错码--RS码的检错原理,提出一种用于二值图像内容认证和篡改定位的脆弱的数字水印算法.该算法利用二值图像的像素值来构造RS码,通过嵌入其校验码来实现对图像的内容认证和篡改定位,一方面保证了其优越的检错能力;另一方面,具有较低的嵌入负载.经实验证明,该算法能有效地检测出二值图像是否被篡改以及篡改发生的位置.此外,在水印信号的生成和提取过程中使用了密钥,确保了水印的安全.     

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

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

A fast watermarking algorithm with enhanced security using compressive sensing and principle components and its performance analysis against a set of standard attacks

An algorithm for watermarking of digital images is proposed in this paper which utilizes Compressive Sensing (CS) with Principle Components (PCs) to achieve robustness, speed and security. CS is applied on PCs of watermark image to get the CS measurements. The singular values of these CS measurements are embedded with a scale factor into the HL subband of the cover image. The generated watermarked image contains three-layer security: one from PCs and other two from CS measurements. To recover PCs from CS measurements, a convex optimization tool, namely, the Orthogonal Matching Pursuit (OMP) is employed. Experiments are performed on both types of cover images; one with more low frequency components and another with more high frequency components. The algorithm offers state-of-the art values of robustness and security in presence of different checkmark attacks like geometrical, non-geometrical and JPEG compression. A comparison of robustness of proposed algorithm with existing algorithms reveals that the proposed algorithm outperforms for most of the noise attacks. The performance of proposed algorithm with different wavelet families (e.g., orthogonal, biorthogonal, symmetric and asymmetric) are compared in terms of robustness and execution time. Such comparison may be helpful in selecting a suitable wavelet for a class of cover images in presence of checkmark attacks. The Haar wavelet performs better for geometric noise attack whereas Bior6.8 and Sym8 for non-geometric and JPEG compression type of noise attacks. The execution time of proposed algorithm with Haar wavelet is found to be minimum for all checkmark attacks. Moreover, it is quite less as compared to Optimization based methods and close to the other watermarking technique used for H.264 video standard.     

Security analysis of a key based color image watermarking vs. a non-key based technique in telemedicine applications

Recently, digital watermarking has become an important technique to preserve patients’ privacy in telemedicine applications. Since, medical information are highly sensitive, security of watermarked medical images becomes a critical issue in telemedicine applications. In this paper, two targeted attacks have been proposed against a key based color image watermarking scheme and also a non-key based one, in order to evaluate their security in telemedicine applications. The target schemes are SVD-based and QR-based color image watermarking algorithms, which their embedding procedures are quit the same. The proposed attacks exploit the prior knowledge of the watermarking algorithms to make changes in the exact embedding spaces. Thus, these changes would cause disruption in extraction procedure. Our experimental results show that the key based watermarking scheme is more secure than the non-key based one. This is because the proposed targeted attack needs to distort the key based watermarked images more than non-key based ones to remove the embedded watermarks. Our proposed targeted attacks also have more efficient performance in removing watermarks than other general attacks such as JPEG compression, Gaussian noise and etc. Finally, these attacks have been proposed to show the vulnerabilities of watermarking schemes in order to help the designers to implement more secure schemes.     

Ambiguity attacks on SVD audio watermarking approach using chaotic encrypted images

In this paper, we study the robustness of the proposed watermarking algorithm by Al-Nuaimy et al. (Digit Signal Process 21(6):764–779 2011) for audio signals which is based on singular value decomposition (SVD). It has been concluded that it is fundamentally flawed in its design, in that it falls to two ambiguity attacks where the extracted watermark is not the embedded one but determined by the reference watermark. In the first attack, when a watermarked audio signal is rewatermarked by an attacker’s watermark, this one can be easily extracted to claim ownership of the original audio signal. In the second attack, during the extracting process when an attacker uses the singular vectors of his watermark, he can extract the attacker’s watermark. Therefore, he can claim ownership of the watermarked audio signal. The experimental results prove that the proposed attacks create a false positive detection in watermark extraction. Therefore, Al-Nuaimy et al. algorithm cannot be used for security systems, data hiding and copyright protection.

     

基于小波变换的数字水印隐藏与检测算法

主要研究了在数字语音信号中加入数字水印的方法,提出了一种基于小波变换的数字水印隐藏与检测算法,用这种算法隐藏水印具有很强的隐藏性,对原始语音的影响基本上察觉不出来。叠加了水印的语音在经过多种强干扰及各种信号处理的变换之后,使用本算法仍能正确检测出水印的存在,如它可以抵抗噪声干扰、去噪算法对信号进行去噪处理、语音信号的有损压缩以及信号的重新采样等。     

Radon变换不变矩在数字水印技术中的应用

几何形状识别在计算机视觉中具有重要意义,不变矩由于其在图像平移、伸缩、旋转时均保持不变,而且具有全局特性,是几何形状识别的主要方法。但现有的基于不变矩理论的数字水印算法还不多,而且传统的数字水印算法在水印检测时均存在误检和漏检的问题。针对以上提出的问题,文章提出一种基于Radon变换不变矩鲁棒性数字水印技术可以有效地减少水印的漏检和误检问题并经过仿真实验证明,该方法对于旋转,缩放,平移等几何攻击具有很好鲁棒性的同时,对于常规信号处理（加噪,滤波,JPEG压缩等）攻击也具有很好的鲁棒性,且具有极低误检率。     

图像块的不可见性与鲁棒性均衡水印算法

目的 为协调水印算法不可见性与鲁棒性之间的矛盾,提高水印算法抵抗几何攻击的能力,提出一种图像块的不可见性与鲁棒性均衡水印算法。方法 将宿主图像分成互不重叠的图像块,利用人类视觉系统的掩蔽特性对每个图像块的纹理特征和边缘特征进行分析,选择掩蔽性好的图像块作为嵌入子块。对嵌入子块作2级离散小波变换,将其低频子带进行奇异值分解,通过修改U矩阵第1列元素间的大小关系嵌入Arnold置乱后的水印信息。在水印提取前,对几何失真含水印图像利用图像尺度不变特征变换（SIFT）特征点的坐标关系和尺度特征进行几何校正,恢复水印的同步性。结果 对标准灰度图像进行实验,含水印图像的峰值信噪比都可以达到44 dB以上。对含水印图像进行常规攻击和几何攻击,提取出的水印图像与原始水印图像的归一化互相关系数大部分都能达到0.99以上,说明该算法不仅具有良好的不可见性,对常见攻击和几何攻击都具有较强的鲁棒性。结论 选择掩蔽性好的图像块作为水印嵌入位置能够充分保证水印算法的不可见性,特别是水印提取前利用SIFT特征点具有旋转、缩放和平移不变性对几何失真含水印图像实现有效校正,提高了含水印图像抵抗几何攻击的能力,较好地协调水印算法不可见性与鲁棒性之间的矛盾。     

基于DSP的嵌入式数字水印系统研究与设计

针对彩色图像进行抗几何攻击水印算法研究,利用奇异值的稳定性,结合小波变换理论,给出了一种基于DWT-SVD的抗几何攻击的彩色图像水印算法。该算法将水印信息嵌入在载体图像CIEL＊a＊b＊颜色模型的亮度空间中,并对载体图像进行打印机输出和各种攻击处理;然后,利用TMS320DM642硬件平台实时采集含水印图像,进行水印的检测与提取;最后利用Matlab对采集的载体图像和提取的水印图像进行性能评估。各种实验结果表明,基于DSP实现的本水印算法对抵抗打印扫描过程中的几何攻击具有很好的鲁棒性。     

用于图像认证的变容量恢复水印算法

兼顾水印嵌入容量和安全性,提出一种水印容量可变的数字图像可恢复水印算法.该算法提取2×2图像块特征生成变容量恢复水印——平滑块6比特,纹理块12比特.图像块的恢复水印基于密钥随机嵌入在其它图像块的低有效位,通过比较图像块特征与相应恢复水印重构的块特征并结合邻域特征判定图像块的真实性,变容量恢复水印用尽可能少的比特数保存足够的图像块信息,仅被嵌入一次且同时用于篡改检测与恢复,不仅有效降低了水印嵌入容量,而且提高了算法抵抗恒均值攻击的能力.实验仿真结果表明,该算法得到的含水印图像和恢复图像的质量好,且能有效抵抗拼贴攻击、恒均值攻击等已知伪造攻击.     

一种抗JPEG压缩的半脆弱图像水印算法

半脆弱水印因为在多媒体内容认证方面的重要作用而受到人们密切的关注.为了能够区分偶然攻击与恶意篡改,半脆弱水印需要对一般的内容保护图像操作有一定的鲁棒性.由于JPEG压缩应用的普遍性,在保持较高的对篡改检测能力的情况下,提高抗JPEG压缩性能一直是半脆弱水印的重要问题.根据图像相邻小波高频系数之间的大小关系在JPEG压缩之后大多数没有发生变化这一事实,提出了一种新的抗JPEG压缩的半脆弱水印算法.实验结果表明,该算法计算简单,嵌入容量大,有很好的抗JPEG压缩性能,同时对篡改的定位也很精确.