基于SIFT图像特征区域的全息水印技术

为了增强水印的不可见性和鲁棒性,提出了一种基于图像特征区域的水印算法。首先利用SIFT(Scale Invariant Feature Transform)算法从载体图像蓝色B通道中提取图像特征点来进行优化和筛选,根据优化后的稳定特征点及其特征尺度确定图像的特征区域,再结合全息技术,对原始水印图像进行双随机相位加密,生成加密全息水印;然后对特征区域进行离散余弦变换(DCT);最后在其中频区域嵌入加密全息水印。在提取水印时无须借助原始图像,是盲水印技术。实验结果表明:该算法重建的水印图像与原始水印图像的NC值高达0.95;水印的嵌入对图像质量影响很小,PSNR值高达55.97,能够抵抗常规信号攻击及缩放、剪切、平移等几何攻击。     

自嵌入双功能图像水印算法

利用自嵌入技术提出一种同时实现版权保护和内容认证的双功能图像水印算法.在嵌入端,首先将原始图像划分成互不重叠的子块,将各子块每个像素的最低m位置0,然后将最低m位置0后的子块进行奇异值分解,通过提取奇异值范数的最高位奇偶性产生原始鲁棒特征水印,然后再将原始鲁棒特征水印嵌入各子块每个像素的最低m位得到含水印图像.检测端从攻击的含水印图像提取鲁棒特征水印的过程与嵌入端产生原始鲁棒特征水印的过程类似,并且通过计算提取的鲁棒特征水印与原始鲁棒特征水印之间的归一化相关度进行版权鉴别,通过判断提取的鲁棒特征水印与攻击图像各子块每个像素的最低m位的一致性实现篡改检测进行内容认证.理论分析和实验结果都表明算法具有非常好的不可见性.实验结果还表明,算法不仅在抵抗添加噪音、剪切、JPEG压缩、平滑、重采样和几何攻击如随机删除行、向右偏移列、向下偏移行表现出很强的鲁棒性,而且能够精确定位出篡改位置和区分篡改类型.因此,算法具有版权保护和内容认证双重功能.     

基于小波变换和奇异值分解的图像水印算法研究

利用小波变换频谱特性和图像奇异值分解特征,提出了一种结合人眼对比感知特性的图像水印算法。并通过结合人眼视觉特性,将置乱的水印以一定的强度嵌入到图像的奇异值矩阵中,采用其逆过程提取水印,通过仿真进行了验证。对其实施了压缩、剪切、高斯噪声和中值滤波攻击测试,与前人提出的8种水印算法的抗攻击性能进行对比分析。结果表明,在质量因子为20%的较强压缩攻击下,提取水印的NC值仍能达到0.8359,含水印图的PSNR和SSIM达到25.0908dB和0.8451,且比8种水印算法具有更好的鲁棒性。综合表明,提出的算法有效地解决了水印嵌入过程中鲁棒性、视觉透明性与水印嵌入量之间的平衡问题。     

A novel blind digital watermarking algorithm for embedding color image into color image

A robust and blind watermarking technique for dual color images is proposed in this paper. According to the energy concentrating feature of DCT, the two-level DCT is introduced and used to embed color watermark image into color host image, which is completely different with the traditional DCT. For reducing the redundancy of watermark information, the original color watermark image is compressed by the proposed compression method. After two-level DCT, nine AC coefficients in different positions of each sub-block are selected and quantified to embed watermark information. Moreover, only the extraction rules are used to extract watermark from the watermarked image without resorting to the original host image or watermark image. Experimental results show that the proposed watermarking algorithm can effectively improve the quality of the watermarked image and the robustness of the embedded watermark against various attacks.     

Geometrically robust image watermarking using scale-invariant feature transform and Zernike moments

In order to resist geometric attacks, a robust image watermarking algorithm is proposed using scaleinvariant feature transform (SIFT) and Zernike moments. As SIFT features are invariant to rotation and scaling, we employ SIFT to extract feature points. Then circular patches are generated using the most robust points. An invariant watermark is generated from each circular patch based on Zernike moments.The watermark is embedded into multiple patches for resisting locally cropping attacks. Experimental results show that the proposed scheme is robust to both geometric attacks and signal processing attacks.     

Designing a genetic watermarking approach for 3D scenes

A new watermarking algorithm based on genetic algorithm (GA) in the transform domain is proposed. Unlike the existing computer-generated integral imaging based watermarking methods, the proposed method utilizes GA searching to the optimized transform domain to serve as a trade-off for watermark embedding. In this paper, 3D scene to be captured by using a virtual pinhole array and be computationally recorded as an elemental image array (EIA), watermarking with GA optimization and computer-generated holography is implemented. In the proposed GA optimization process, we utilize the fitness function to improve the visual quality of watermarked images and the robustness. Simulation results show that the proposed algorithm yields a holographic watermark that is imperceptibility to human eyes and robust to standard watermarking attacks. A comparison of the proposed watermarking method to the existing similar watermarking methods demonstrated that the proposed method generally outperforms completing methods in terms of imperceptibility and robustness.     

A color image watermarking scheme based on hybrid classification method: Particle swarm optimization and k-nearest neighbor algorithm

In this paper, a novel robust watermarking technique using particle swarm optimization and k-nearest neighbor algorithm is introduced to protect the intellectual property rights of color images in the spatial domain. In the embedding process, the color image is separated into non-overlapping blocks and each bit of the binary watermark is embedded into the individual blocks. Then, in order to extract the embedded watermark, features are obtained from watermark embedded blocks using the symmetric cross-shape kernel. These features are used to generate two centroids belonging to each binary (1 and 0) value of the watermark implementing particle swarm optimization. Subsequently, the embedded watermark is extracted by evaluating these centroids utilizing k-nearest neighbor algorithm. According to the test results, embedded watermark is extracted successfully even if the watermarked image is exposed to various image processing attacks.     

A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map

In this paper,a compressive sensing(CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed.The transform domain coefficients of the original image are scrambled by Arnold map firstly.Then the watermark is adhered to the scrambled data.By compressive sensing,a set of watermarked measurements is obtained as the watermarked cipher image.In this algorithm,watermark embedding and data compression can be performed without knowing the original image;similarly,watermark extraction will not interfere with decryption.Due to the characteristics of CS,this algorithm features compressible cipher image size,flexible watermark capacity,and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss.Simulation results and analyses show that the algorithm achieves good performance in the sense of security,watermark capacity,extraction accuracy,reconstruction,robustness,etc.     

On the robustness of Harris detector in image watermarking attacks

This paper investigates the misplacement issue presented on the detection of feature points by using the well-known Harris detector, under several watermarking attacks. Harris detector, as a powerful tool in finding image's points of high importance, called “interest points”, has been widely used to locate specific image portions where watermarks are embedded, according to some watermarking insertion procedure. Although Harris detector constitutes a significant part of a typical feature-based watermarking process, no work dealing with its performance under certain attacks has been reported yet. This work studies the accuracy of Harris detector in finding the feature points, which define the watermarked regions of attacked images, firstly as an individual processing module and secondly as a part of a feature-based watermarking methodology. Detailed theoretical analysis followed by appropriate simulation experiments has shown that the incorporation of the Harris detector into the watermarking procedure presents misplacement issues that can lead the watermarking algorithm to unreliable results. In the way of decreasing these misplacement errors, a novel algorithm that extracts more stable interest points, with promising performance is also proposed.     

A blind color image watermarking based on DC component in the spatial domain

Color image watermarking has become essential and important copyright protection or authentication scheme. It is noted that most of the existing color image watermarking algorithms are performed only in the single domain (spatial domain or frequency domain), and not to integrate these merits of the different domains. By utilizing the generating principle and distribution feature of the direct current (DC) coefficient, a novel blind watermarking algorithm is proposed for color host images in this paper. Firstly, the Y luminance of host image is divided into 8 × 8 sub-blocks and the DC coefficients of each block are directly calculated in the spatial domain without DCT transform. Secondly, according to the watermark information and the quantization step, the DC coefficients are calculated and their increments are further utilized to modify directly the values of all pixels in the spatial domain instead of the DCT domain to embed watermark. When watermark extraction, only the watermarked image and the quantization step are needed in the spatial domain. Experimental results show that the proposed method not only can resist both traditional signal processing attacks and geometric attacks, but also has more efficient in computational complexity. Comparisons also demonstrate the advantages of the method.     

A feature-based robust digital image watermarking scheme using bandelet transform

Desynchronization attacks are among the most difficult attacks to resist, for it can desynchronize the location of the watermark and hence cause incorrect watermark detection. The design of an image watermarking scheme that is robust against desynchronization attacks is challenging. Based on a multi-scale SIFT (scale invariant feature transform) detector and Bandelet transform theory, we propose a new content based image watermarking algorithm with good visual quality and reasonable resistance toward desynchronization attacks. Firstly, the stable image feature points are extracted from the original host by using the multi-scale SIFT detector, and the local feature regions (LFRs) are constructed adaptively according to the feature scale theory. The Bandelet transform is then performed on the LFRs. Finally, the digital watermark is embedded into the LFRs by modifying the significant Bandelet coefficients. By binding the watermark with the geometrically invariant image features, the watermark detection can be done without synchronization error. Experimental results show that the proposed image watermarking is not only invisible and robust against common signal processing such as sharpening, noise adding, JPEG compression, etc., but also robust against the desynchronization attacks such as rotation, translation, scaling, row or column removal, cropping, etc.     

A blind dual color images watermarking based on IWT and state coding

In this paper, a state-coding based blind watermarking algorithm is proposed to embed color image watermark to color host image. The technique of state coding, which makes the state code of data set be equal to the hiding watermark information, is introduced in this paper. When embedding watermark, using Integer Wavelet Transform (IWT) and the rules of state coding, these components, R, G and B, of color image watermark are embedded to these components, Y, Cr and Cb, of color host image. Moreover, the rules of state coding are also used to extract watermark from the watermarked image without resorting to the original watermark or original host image. Experimental results show that the proposed watermarking algorithm cannot only meet the demand on invisibility and robustness of the watermark, but also have well performance compared with other proposed methods considered in this work.     

基于混沌的自嵌入安全水印算法

利用混沌系统的伪随机性和初值敏感性，提出一种基于混沌的自嵌入安全水印算法.该算法以混沌初值为密钥生成混沌序列，根据混沌序列的索引有序序列随机生成图像块的水印嵌入位置.与现有的自嵌入算法相比，该算法实现了水印嵌入位置的随机选取，有效扩大了算法的密钥空间，且解决了自嵌入水印算法如何准确定位篡改块的问题.理论分析和仿真结果表明，该算法不仅提高了自嵌入水印算法的篡改定位的能力，而且进一步增强了算法抵抗向量量化攻击和同步伪造攻击的能力. 关键词： 数字水印 混沌 脆弱水印 自嵌入     

改进的小波域混沌数字水印算法实现

在对小波域中数字水印的嵌入算法研究的基础上,利用混沌序列所特有的不可预测性,将混沌理论引入数字水印的创建中,提出了改进的小波域混沌数字水印算法,并通过仿真实现了利用Logistic映射产生的混沌序列有序的嵌入小波域数字水印的方法,该算法具有密钥唯一性、不可逆性、不可见性、鲁棒性等特点.实验证明该算法具有很好的视觉效果,是一种实际可行的数字水印算法.     

基于图象特征的小波域水印算法

提出一种基于图象特征点的小波变换域第二代水印算法.首先对图象作小波变换,其中最低频成分是图象的粗尺度(低分辨率)逼近,从中提取出图象的特征点;然后在特征点对应的所有高频系数中嵌入水印.水印检验不需要原始图象,但需要原始图象的特征点位置信息,计算特征点对应的所有高频系数与嵌入水印的互相关,利用门限值检验水印是否存在. 实验证明该算法对通常的图象处理有很强的鲁棒性,对有损压缩的鲁棒性尤为突出,而且对几何变换也有一定鲁棒性.     

确定图像降质的鲁棒性数字水印嵌入算法

结合视觉系统的掩蔽特性提出了一种数字图像离散Radon变换(DRAT)域内嵌入水印的新算法。从不可见性和鲁棒性两个方面分析了在DRAT域中可嵌入水印的原因。以水印图像的峰值信噪比作为评价水印图像质量的标准,采用相互独立的Gaussian随机序列作为水印信号,导出了水印长度、嵌入深度、水印图像峰值信噪比三者之间的理论关系,给出了在给定图像质量条件下水印嵌入的自适应参数估计。利用Checkmark1.2系统对新水印算法进行了攻击测试。测试结果表明,新算法对常见的图像处理如滤波、边缘增强、对比度变化、剪切等攻击具有良好的鲁棒性。     

基于双混沌置乱和扩频调制的彩色图像盲水印算法

提出了一种新的适应彩色图像的盲水印算法,先对宿主图像的绿色分量以8×8像素分块进行离散余弦变换(DCT)变换,用logistic映射生成两个混沌序列,然后用混沌序列置乱加密二值水印图像,并用两个互不相关的伪随机序列扩频调制水印,最后将调制好的水印嵌入到DCT变换域的中频子带系数上,进行分块DCT反变换得到水印化图像.提取水印时,通过比较两个伪随机序列和水印化图像的相关性大小来提取水印,不需要原始图像的参与,为盲提取水印算法.实验结果证明本文算法能有效地抵抗JPEG压缩、加噪、剪切等常见攻击,绿色分量嵌入水印比红色和蓝色分量嵌入水印能更好地抵抗JPEG压缩的攻击.     

An optimal robust digital image watermarking based on SVD using differential evolution algorithm

The main objective in developing a robust image watermarking technique is to obtain the highest possible robustness without losing the transparency. To achieve this objective, this paper presents a new optimal robust image watermarking technique based on singular value decomposition (SVD) using differential evolution algorithm (DE). The singular values (SV) of the host image are modified by multiple scaling factors to embed a watermark image. The modifications are optimised using DE to achieve maximum robustness and transparency Experimental results show that the proposed approach can effectively improve the quality of the watermarked image and the robustness of the embedded watermark against various attacks.     

基于相息图和小波变换的数字水印

提出一种基于相息图和小波变换的数字水印方案。利用迭代相位恢复算法将水印图像编码为相息图, 然后将经权重因子调制后的相息图嵌入到宿主图像的三层小波低频系数中, 完成整个水印嵌入过程。在水印提取阶段, 对宿主图像和含水印图像进行三层小波分解, 将得到的低频系数对应相减提取出水印相息图, 然后对此相息图进行傅里叶变换操作, 取其振幅即可提取原始嵌入的水印图像。针对不同权重因子的水印系统, 详细分析和讨论了所提出水印方案的隐蔽性和稳健性。计算机仿真结果验证了该数字水印方案的可行性。     

Gray images embedded in a color image and encrypted with FRFT and Region Shift Encoding methods

In this paper, we have proposed a new multiple image encryption and watermarking technique. Several gray images can be watermarked in the three channels of an enlarged color image. The neighbor pixel value addition and subtraction algorithm is used to realize blind watermarking, therefore the original host color image does not need in extraction the watermark image. The gray images are encrypted with FRFT and Region Shift Encoding techniques before hiding to enhance the security. The robustness against occlusion attacks and noise attacks are also analyzed. And some computer simulations are presented to verify the possibility.