A novel fragile watermarking scheme for image tamper detection and recovery

We propose a fragile watermarking scheme capable of image tamper detection and recovery with a blockwise dependency mechanism.Initially,the image is divided into blocks with size of 2×2 in order to improve image tamper localization precision.By combining image local properties with human visual system,authentication data are acquired.By computing the class membership degree of each image block property,data are generated by applying k-mean clustering technique to cluster all image blocks.The recovery data are composed of average intensity obtained by truncating the two least significant bits(LSBs) of each pixel within each block.Finally,the logistic chaotic encrypted feature watermark consisting of 2-bit authentication data and 6-bit recovery data of image block is embedded into the two LSBs of each pixel within its corresponding mapping block.Experimental results show that the proposed algorithm does not only achieve superior tamper detection and locate tiny tampered positions in images accurately,it also recovers tampered regions effectively.     

Blind image watermarking based on discrete fractional random transform and subsampling

This paper proposes a blind watermarking scheme based on discrete fractional random transform. The watermark information can be a binary sequence, a gray level image or a set of decimal fractions sampled from a given source signal. The host image is subsampled into four subimages, and the high correlations among their discrete fractional random transform coefficients are exploited for watermark embedding. Based on this self-reference strategy, the watermark can be extracted without the aid of the host image. As a fragile watermarking technique, our scheme can be used in tamper detection. Besides, it can be used in self-embedding for a large payload is provided. Meanwhile, security of the watermark is preserved due to the randomness of the discrete fractional random transform. Experimental results demonstrate the effectiveness of our scheme.     

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 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.     

一种基于混沌和汉明码的数字图像篡改检测及修复算法

提出了一种基于混沌映射和汉明码的数字图像篡改检测及修复算法.该算法采用了目前在信道编码中广泛使用的编组码汉明码,将差错控制应用于图像认证和修复,并使用混沌映射保证算法的有效性和安全性.分析及实验表明:该算法在保证良好的视觉效果,嵌入较少认证信息的前提下,可以有效地进行数字图像篡改检测,并能够完成一定程度的图像修复.     

A copyright protection watermarking algorithm for remote sensing image based on binary image watermark

As the internet keeping developing, copyright protection of the remote sensing image has become more and more important. This paper designs the algorithm that protects remote sensing image's copyright by using the binary digital watermark technology, and analyzes security and imperceptibility of the algorithm. As the experiment result shows, the algorithm put forward in this paper has better security, imperceptibility and anti-attack robustness, and thus it can meet the requirements in protecting copyright of the digital remote sensing image in an effective manner.     

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.     

一种基于Logistic混沌系统和奇异值分解的零水印算法

改变了传统通过修改图像内容进行版权保护的做法,描述了一种基于混沌理论和奇异值分解（singular value decomposing,SVD）的零水印方案;利用了Logistic混沌系统的初值敏感性映射信息隐藏的位置,增强了算法的安全性;采用了奇异值的不变特性构造注册中心的水印,保证了在不改变宿主图像任何信息的同时进行有效地版权保护;将有意义的二值图像作为水印图像,解决了零水印方案水印为无意义二值序列的问题;同时深入分析了水印容量和算法安全性之间的关系.通过对标准测试图像、卡通、医学、风景、遥感、诗画等 关键词： 零水印 混沌系统 Logistic系统 奇异值分解     

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.     

A block-based watermarking scheme for image tamper detection and self-recovery

In this paper, we present an effective block-based digital fragile watermarking scheme for image tamper detection and recovery. The proposed scheme embeds watermarks consisting of the authentication data and the recovery data into image blocks. It adopts parity check and the intensity-relation check to thwart various malicious attacks. In the tamper detection process, instead of independently testing the embedded authentication data of each block, we take the block-neighbourhood into account and utilize a hierarchical structure to determine the legitimacy of image blocks. Experimental results show that the proposed scheme can effectively resist collage attack, vector quantization (VQ) attack and constant-average attack, while sustaining superior accuracy of tamper localization. Furthermore, the results reveal that the tampered images can be successfully self-recovered with acceptable visual quality.     

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

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

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

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

A novel chaotic image encryption algorithm using block scrambling and dynamic index based diffusion

In this paper, we propose a novel chaotic image encryption algorithm which involves a block image scrambling scheme and a new dynamic index based diffusion scheme. Firstly, the original image is divided into two equal blocks by vertical or horizontal directions. Then, we use the chaos matrix to construct X coordinate, Y coordinate and swapping control tables. By searching the X coordinate and Y coordinate tables, the swapping position of the processing pixel is located. The swapping control table is used to control the swapping of the pixel in the current block or the other block. Finally, the dynamic index scheme is applied to the diffusing of the scrambled image. The simulation results and performance analysis show that the proposed algorithm has an excellent safety performance with only one round.     

基于HVS的小波变换数字图像水印算法

为实现图像水印在数据认证、访问控制和版权保护等领域发挥作用,提出一种人眼视觉感知特性的小波变换数字图像水印算法。首先对二值图像水印进行Arnold变换,并采用行堆叠的方法,转换成一维序列,然后根据密钥生成的高斯序列中值的正负来确定水印信息嵌入时是采用那种调制方式,最后对原始图像进行3级DWT分解,在小波图像的第二层中频子带中,结合人眼视觉特性将水印正向或负向调制叠加在宿主图像大于JND 值的小波系数上。实验结果表明:该算法能抵抗JPEG压缩、加噪、剪切等多种攻击,具有良好的透明性,鲁棒性和安全性。     

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

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

基于神经网络和HVS的空域数字水印算法

为了弥补空间域水印算法在提取水印时需要原宿主图像、鲁棒性较差等缺点,提出一种基于BP神经网络和人眼视觉特性(HVS)的空域数字水印算法。先选出原宿主图像对比度函数值最大的前块用于二值水印图像的嵌入,利用神经网络能够逼近任意非线性关系的特点和其自适应性,构建水印信号嵌入前后图像块像素值间的映射关系,实现了水印的盲提取,并将该算法与现有算法进行了对比。实验结果表明,对于JPEG压缩、加噪、剪切和旋转等常见的图像处理攻击,算法具有良好的鲁棒性和不可见性。     

A novel algorithm based on visual saliency attention for localization and segmentation in rapidly-stained leukocyte images

In this paper, we propose a fast hierarchical framework of leukocyte localization and segmentation in rapidly-stained leukocyte images (RSLI) with complex backgrounds and varying illumination. The proposed framework contains two main steps. First, a nucleus saliency model based on average absolute difference is built, which locates each leukocyte precisely while effectively removes dyeing impurities and erythrocyte fragments. Secondly, two different schemes are presented for segmenting the nuclei and cytoplasm respectively. As for nuclei segmentation, to solve the overlap problem between leukocytes, we extract the nucleus lobes first and further group them. The lobes extraction is realized by the histogram-based contrast map and watershed segmentation, taking into account the saliency and similarity of nucleus color. Meanwhile, as for cytoplasm segmentation, to extract the blurry contour of the cytoplasm under instable illumination, we propose a cytoplasm enhancement based on tri-modal histogram specification, which specifically improves the contrast of cytoplasm while maintaining others. Then, the contour of cytoplasm is quickly obtained by extraction based on parameter-controlled adaptive attention window. Furthermore, the contour is corrected by concave points matching in order to solve the overlap between leukocytes and impurities. The experiments show the effectiveness of the proposed nucleus saliency model, which achieves average localization accuracy with F1-measure greater than 95%. In addition, the comparison of single leukocyte segmentation accuracy and running time has demonstrated that the proposed segmentation scheme outperforms the former approaches in RSLI.     

Breaking a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system

Recently, a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system was proposed. It was reported that the scheme can be broken with 4mn/3 +1 chosen plain-images and the corresponding cipher-images, where mn is the size of the plain-image. This paper re-evaluates the security of the encryption scheme and finds that the encryption scheme can be broken with less than ⌈ log ₂(4mn)/2 ⌉ +1 chosen plain-images, even three in many cases. The effectiveness of the proposed chosen-plaintext attack is supported by theoretical analysis, and verified by experimental results.     

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.