A robust watermarking algorithm based on salient image features

A feature-based robust watermarking algorithm against geometric attacks is proposed in this paper. It is well-known that geometric attacks such as rotation, scaling, and translation on a watermarked image will destroy the synchronization between the processes of watermark embedding and detection. In other words, the locations for embedding the watermark are lost due to geometric attacks, which results in the failure of watermark detection. Since salient features in an image are relatively stable under geometric attacks, they may serve as reference points to synchronize the embedding and detection processes and the detection rate of the watermark could be increased significantly. Another problem for feature-based watermarking is that the repeatability of feature detection tends to be low; that is, the features detected during the embedding process may not be detected again during the detection process. To overcome such a problem, a novel feature enhancement technique is developed to increase the repeatability rate of feature detection, in which image moments are used to achieve geometric invariance between the embedding and detection processes. Experimental results demonstrate that the proposed watermarking algorithm is able to survive various geometric attacks and common image processing operations. And the visual quality of the watermarked image is well preserved as well.     

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.     

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

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

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

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

ECSS: High-Embedding-Capacity Audio Watermarking with Diversity Reception

Digital audio watermarking is a promising technology for copyright protection, yet its low embedding capacity remains a challenge for widespread applications. In this paper, the spread-spectrum watermarking algorithm is viewed as a communication channel, and the embedding capacity is analyzed and modeled with information theory. Following this embedding capacity model, we propose the extended-codebook spread-spectrum (ECSS) watermarking algorithm to heighten the embedding capacity. In addition, the diversity reception (DR) mechanism is adopted to optimize the proposed algorithm to obtain both high embedding capacity and strong robustness while the imperceptibility is guaranteed. We experimentally verify the effectiveness of the ECSS algorithm and the DR mechanism, evaluate the performance of the proposed algorithm against common signal processing attacks, and compare the performance with existing high-capacity algorithms. The experiments demonstrate that the proposed algorithm achieves a high embedding capacity with applicable imperceptibility and robustness.     

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.     

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.     

分数傅里叶域数字水印算法

基于离散分数傅里叶变换(DFRFT)快速算法发展了一种分数傅里叶谱域图像水印算法.该算法根据分数傅里叶变换谱具有空域和频域双域信息表达能力,分别对原始图像和所加水印信息进行不同级次的分数傅里叶变换,提取水印分数傅里叶谱的低频成分并直接将其叠加到原始图像的分数傅里叶谱中的对角像元上,然后再进行逆变换得到水印图像.在JPEG压缩、图像旋转及剪切等攻击方式下,对该水印算法进行了鲁棒性分析,数值实验表明该水印算法具有良好的抗攻击性和安全性.     

一种基于二元位相加密的大信息量数字全息水印

研究了一种基于二元位相加密的大信息量数字全息水印方法,对需隐藏的水印信息用二元位相编码,然后再用2台阶位相密钥进行加密,作为水印插入宿主图像中,解码后得到了高质量的水印结果.与平面波照明数字全息水印相比,采用位相密钥数字全息水印有效地提高了水印提取的安全性和相对光学效率,并保持了对大信息量水印的提取质量,解码过程不依赖于原图像. 计算和分析了二元位相密钥的空间分布对水印信息提取质量的影响,计算结果验证了理论的正确性.     

一种基于特征不变描述的图像无缝拼接算法

针对尺度变化不明显场景的拼接,提出一种基于特征不变描述的图像无缝拼接算法.利用Harris特征检测算子进行特征点提取,在此基础上对提取出的特征点采用SIFT描述子进行处理,使其具备旋转不变性,然后利用k-d树算法进行遍历搜索定位,并用RANSAC算法进行图像间单应性变换矩阵计算,最后利用加权平均的融合方法进行图像无缝平滑,得到无缝拼接图像.实验结果表明:该算法在图像任意角度旋转的情况下,能有效地实现图像无缝拼接,并具有较强的鲁棒性.     

基于特征点自动匹配的图像拼接方法

提出了一种基于特征点自动匹配的图像拼接算法,采用改进的Harris算子提取特征点,保证了提取的效率和精度,根据互相关的双向匹配实现对应特征点的自动匹配,从而建立参考图像与当前图像的对应点对,最后采用最小二乘方法得到图像间的全局变换参数,实现图像的拼接。     

一种基于混沌和分数阶傅里叶变换的数字水印算法

基于混沌序列及离散分数阶傅里叶变换,提出了一种基于混沌和分数阶傅里叶变换的数字水印算法,并对算法及抗攻击性能进行了仿真分析.结果表明,该算法简单有效,对JPEG压缩、噪声、滤波等攻击具有良好的鲁棒性. 关键词： 数字水印 混沌 分数阶傅里叶变换 鲁棒性     

结合Harris与SIFT算子的图像快速配准算法

本文提出了一种结合Harris与SIFT算子的快速图像配准方法。首先,对Harris算法进行两方面的改进:一是构建高斯尺度空间,提取具有尺度不变性的角点特征;二是采用Forsnter算子对提取的角点精定位,提高配准精度。然后,利用SIFT算子的特征描述方法描述提取到的特征点,通过随机kd树算法对两幅影像的特征点进行匹配。最后采用RANSAC算法对匹配点对进行提纯,并通过最小二乘法估计两幅影像间的空间变换单应矩阵,完成图像配准。实验结果表明:本文方法在基本保持配准精度的同时,在配准过程的时间消耗上比标准SIFT算法减少了64%。     

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.     

Image watermarking algorithm based on fractional Fourier transform and random phase encoding

We propose an optical image watermarking algorithm based on fractional Fourier transform and random phase encoding. The proposed watermarking can be exactly implemented in optics and the secret key is passively generated by the proposed algorithm. In the packaged watermarking system, the host image is unchanged in the embedding procedure. This algorithm is fast and convenient for real-time implementation. PSNR between the host and distorted host images, MSE between the extracted and original watermarks are used to evaluate the performance of the proposed algorithm. Robustnesses against typical attacks are also analyzed. Numerical results have demonstrated its feasibility and effectiveness.     

基于相位恢复和数字全息的音频水印

提出了一种在数字全息技术中引入相位恢复算法的音频水印方法.用水印图像经相位恢复处理形成虚拟物光波与参考光波干涉,得到高对比度的傅里叶变换全息图.利用量化算法和离散余弦变换把数字全息图嵌入音频信号中,在水印提取过程中不需要原始音频信号的参与,并且采用密钥加强了水印的安全性.数值计算实验表明:该算法对有损压缩、重采样、低通滤波、噪音干扰等常用音频信号攻击均具有很好的稳健性.     

Speech Watermarking Method Using McAdams Coefficient Based on Random Forest Learning

Speech watermarking has become a promising solution for protecting the security of speech communication systems. We propose a speech watermarking method that uses the McAdams coefficient, which is commonly used for frequency harmonics adjustment. The embedding process was conducted, using bit-inverse shifting. We also developed a random forest classifier, using features related to frequency harmonics for blind detection. An objective evaluation was conducted to analyze the performance of our method in terms of the inaudibility and robustness requirements. The results indicate that our method satisfies the speech watermarking requirements with a 16 bps payload under normal conditions and numerous non-malicious signal processing operations, e.g., conversion to Ogg or MP4 format.     

Statistical detection of digital holographic watermarking system

In this paper, we examine the statistical properties of the holographic watermarking system [C.J. Cheng, L.C. Lin, W.T. Dai, Opt. Commun. 248 (2005) 105] and facilitate a systematic way to determine an optimal threshold of the correlation signal for detecting the authorized mark pattern. The holographic watermarking system constructs a digital holographic watermark using modified Mach-Zehnder interferometric architecture, and the correlation signal is obtained using an optical VanderLugt 4-f correlator to identify the authorized mark in the watermarked image. To obtain the best detection performance, we use statistical modeling of the entire holographic watermarking system. Accordingly, we derive correlation signal statistics and hypothesis testing to obtain an optimal threshold for the watermark detector that minimizes the detection error. The theoretical result of this paper allows us to easily determine an optimal threshold and evaluate the robustness of the watermark detector. The robustness of the proposed optimal detector is evaluated using detection error, and detection performance is demonstrated by simulation experiments.     

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.