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.     

A geometric correction based robust color image watermarking scheme using quaternion Exponent moments

Most of the existing color image watermarking schemes was designed to mark grayscale images or use the color components, which ignore the significant correlation between different color channels. Recently, several approaches were developed to process the color channels intrinsically, but they always cannot counterattack geometric distortions. It is a challenging work to design a robust color image watermarking scheme against geometrical distortions. In this paper, we propose a geometric correction based robust color image watermarking approach using quaternion Exponent moments (QEMs). The novelty of our approach is that (1) the QEMs are derived to deal with the color images in a holistic manner, and (2) the QEMs are exploited for estimating the geometric distortions parameters in order to permit watermark extraction. Experimental results confirm the validity of our approach and its higher robustness against geometrical distortions compared to alternative watermarking methods in the literature.     

A novel image fusion algorithm based on bandelet transform

A novel image fusion algorithm based on bandelet transform is proposed. Bandelet transform can take advantage of the geometrical regularity of image structure and represent sharp image transitions such as edges efficiently in image fusion.     

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.     

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

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

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

It is shown that the optimal robust digital image watermarking based on singular value decomposition using differential evolution algorithm proposed by Veysel Aslantas [Opt. Commun. 282(5):769-777 (2009)] has a serious fundamental flaw and should not be used for proof of ownership application.     

A robust SVD-based image watermarking using a multi-objective particle swarm optimization

The major objective in developing a robust digital watermarking algorithm is to obtain the highest possible robustness without losing the visual imperceptibility. To achieve this objective, we proposed in this paper an optimal image watermarking scheme using multi-objective particle swarm optimization (MOPSO) and singular value decomposition (SVD) in wavelet domain. Having decomposed the original image into ten sub-bands, singular value decomposition is applied to a chosen detail sub-band. Then, the singular values of the chosen sub-band are modified by multiple scaling factors (MSF) to embed the singular values of watermark image. Various combinations of multiple scaling factors are possible, and it is difficult to obtain optimal solutions. Thus, in order to achieve the highest possible robustness and imperceptibility, multi-objective optimization of the multiple scaling factors is necessary. This work employs particle swarm optimization to obtain optimum multiple scaling factors. Experimental results of the proposed approach show both the significant improvement in term of imperceptibility and robustness under various attacks.     

Digital image watermarking using gyrator transform and chaotic maps

We propose a new method for digital image watermarking using gyrator transform and chaotic maps. Four chaotic maps have been used in the proposed technique. The four chaotic maps that have been used are the logistic map, the tent map, the Kaplan-Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. A new technique has been proposed to generate the single chaotic random phase mask by using two chaotic maps together with different seed values. The watermark encoding method in the proposed technique is based on the double random phase encoding method. The gyrator transform and two chaotic random phase masks are used to encode the input image. The mean square error, the peak signal-to-noise ratio and the bit error rate have been calculated. Robustness of the proposed technique has been evaluated in terms of the chaotic maps, the number of the chaotic maps used to generate the CRPM, the rotation angle of the gyrator transform and the seed values of the chaotic random phase masks. Optical implementation of the technique has been proposed. The computer simulations are presented to verify the validity of the proposed technique.     

A robust image watermarking technique using SVD and differential evolution in DCT domain

In this paper we applied differential evolution (DE) algorithm to balance the tradeoff between robustness and imperceptibility by exploring multiple scaling factors in image watermarking. First of all, the original image is partitioned into blocks and the blocks are transformed into Discrete Cosine Transform (DCT) domain. The DC coefficients from each block are collected to construct a low-resolution approximation image and apply Singular Value Decomposition (SVD) on this approximation image. After that watermark is embedded by modifying singular values with the singular values of the watermark. The role of DE algorithm is to identify the best multiple scaling factors for embedding process in order to achieve the best performance in terms of robustness without compromising with the quality of the image. To enhance the security, watermark is scrambled by Arnold transform before embedding. Experimental results show that the proposed scheme maintains a satisfactory image quality and watermark can still be identified from a seriously distorted image.     

Compressive optical image watermarking using joint Fresnel transform correlator architecture

A new optical image watermarking technique based on compressive sensing using joint Fresnel transform correlator architecture has been presented. A secret scene or image is first embedded into a host image to perform optical image watermarking by use of joint Fresnel transform correlator architecture. Then, the watermarked image is compressed to much smaller signal data using single-pixel compressive holographic imaging in optical domain. At the received terminal, the watermarked image is reconstructed well via compressive sensing theory and a specified holographic reconstruction algorithm. The preliminary numerical simulations show that it is effective and suitable for optical image security transmission in the coming absolutely optical network for the reason of the completely optical implementation and largely decreased holograms data volume.     

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 three-dimensional digital watermarking scheme basing on integral imaging

A novel integral imaging-based three-dimensional (3D) digital watermarking scheme is presented. In the proposed method, an elemental image array (EIA) obtained by recording the rays coming from a 3D object through a pinhole array in the integral imaging system is employed as a new 3D watermark. The EIA is composed of a number of small elemental images having their own perspectives of a 3D object, and from this recorded EIA various depth-dependent 3D object images can be reconstructed by using the computational integral imaging reconstruction (CIIR) technique. This 3D property of the EIA watermark can make a robust reconstruction of the watermark image available even though there are some data losses in the embedded watermark by attacks. To show the robustness of the proposed scheme against attacks, some experiments are carried out and the results are discussed.     

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.     

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

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

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

A novel chaos-based bit-level permutation scheme for digital image encryption

Confidentiality is an important issue when digital images are transmitted over public networks, and encryption is the most useful technique employed for this purpose. Image encryption is somehow different from text encryption due to some inherent features of image such as bulk data capacity and high correlation among pixels, which are generally difficult to handle by conventional algorithms. Recently, chaos-based encryption has suggested a new and efficient way to deal with the intractable problems of fast and highly secure image encryption. This paper proposes a novel chaos-based bit-level permutation scheme for secure and efficient image cipher. To overcome the drawbacks of conventional permutation-only type image cipher, the proposed scheme introduced a significant diffusion effect in permutation procedure through a two-stage bit-level shuffling algorithm. The two-stage permutation operations are realized by chaotic sequence sorting algorithm and Arnold Cat map, respectively. Results of various types of analysis are interesting and indicate that the security level of the new scheme is competitive with that of permutation-diffusion type image cipher, while the computational complexity is much lower. Therefore the new scheme is a good candidate for real-time secure image communication applications.     

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.     

Wave atom transform generated strong image hashing scheme

The rapid development of multimedia technology has resulted in a rising rate on digital unauthorized utilization and forgery, which makes the situation of image authentication increasingly severe. A novel strong image hashing scheme is proposed based on wave atom transform, which can better authenticate images by precisely distinguishing the malicious tampered images from the non-maliciously processed ones. Wave atom transform is employed since it has significantly sparser expansion and better characteristics of texture feature extraction than other traditional transforms. For better detection sensitivity, gray code is applied instead of natural binary code to optimize the hamming distance. Randomizations are also performed using Rényi chaotic map for the purposes of secure image hashing and key sensitivity. The experimental results show that the proposed strong scheme is robust to non-malicious content-preserving operations and also fragile to malicious content-altering operations. The scheme also outperforms DCT and DWT based schemes in terms of receiving operating characteristic (ROC) curves. Moreover, to provide an application-defined tradeoff, a security enhancement approach based on Rényi map is presented, which can further protect the integrity and secrecy of images.     

Optical 3D watermark based digital image watermarking for telemedicine

Region of interest (ROI) of a medical image is an area including important diagnostic information and must be stored without any distortion. This algorithm for application of watermarking technique for non-ROI of the medical image preserving ROI. The paper presents a 3D watermark based medical image watermarking scheme. In this paper, a 3D watermark object is first decomposed into 2D elemental image array (EIA) by a lenslet array, and then the 2D elemental image array data is embedded into the host image. The watermark extraction process is an inverse process of embedding. The extracted EIA through the computational integral imaging reconstruction (CIIR) technique, the 3D watermark can be reconstructed. Because the EIA is composed of a number of elemental images possesses their own perspectives of a 3D watermark object. Even though the embedded watermark data badly damaged, the 3D virtual watermark can be successfully reconstructed. Furthermore, using CAT with various rule number parameters, it is possible to get many channels for embedding. So our method can recover the weak point having only one transform plane in traditional watermarking methods. The effectiveness of the proposed watermarking scheme is demonstrated with the aid of experimental results.