JPEG Compression Attacks Research Articles

An integrated visual saliency-based watermarking approach for synchronous image authentication and copyright protection

This paper proposes an integrated visual saliency-based watermarking approach, which can be used for both synchronous image authentication and copyright protection. Firstly, regions of interest (ROIs), which are not in a fixed size and can present the most important information of one image, would be extracted automatically using the proto-object based saliency attention model. Secondly, to resist common signal processing attacks, for each ROI, an improved quantization method is employed to embed the copyright information into its DCT coefficients. Finally, the edge map of one ROI is chosen as the fragile watermark, and is then embedded into the DWT domain of the watermarked image to further resist the tampering attacks. Using ROI-based visual saliency as a bridge, this proposed method can achieve image authentication and copyright protection synchronously, and it can also preserve much more robust information. Experimental results on standard benchmark demonstrate that compared with the state-of-the-art watermarking scheme, the proposed method is more robust to white noise, filtering and JPEG compression attacks. Furthermore, it also shows that the proposed method can effectively detect tamper and locate forgery.

Robust copyright marking using Weibull distribution

For multimedia document, watermarking provides many advantages; however, its vulnerability due to attacks using signal processing methods offers challenge in designing robust techniques. This paper presents a novel method for enhancing robustness in copyright marking into mid-frequency discrete cosine transform (DCT) coefficients of an image. We establish that Weibull distribution suitably models mid-frequency coefficients well and use it for hiding copyright data. Our method is robust against JPEG compression attacks at both high and low compressions. Further, it is statistically undetectable in comparison to existing techniques of data hiding based on DCT coefficients. This is because it insignificantly affects the DCT coefficients of the stego image without compromising with data hiding capacity of the host image. Simulation result on Lena, Gibbon, Boat, and Peppers images illustrates that our algorithm offers lower bit error rate ( BER) and higher peak signal to noise ratio ( PSNR) leading to improved imperceptibility. Thus, it is useful in robust copyright marking.

A new digital image watermarking scheme based on Schur decomposition

In this paper, we present a new digital watermarking scheme for ownership protection. The algorithm embeds the watermark in the Schur decomposition components of the cover image. We also show that this algorithm is noninvertible. Comparisons with other algorithms indicate that the proposed algorithm is robust against most common attacks including geometrical distortions and jpeg compression attacks. Simulations show that the performance of this algorithm outperforms the closely related singular value decomposition based algorithms. More specifically, the proposed algorithm is more robust and requires less number of computations. In addition, our algorithm does not suffer the false positive detection problem inherent in SVD based algorithms.

Semisubsampled Wavelet Transform Based Image Watermarking with Strong Robustness to Rotation Attacks

In this paper, we develop a novel transform called semisubsampled wavelet transform (SSWT) and employ it to image watermarking. SSWT consists of two parts, one is nonsubsampled tight frame transform, the other is critically sampled wavelet transform (WT). Embedding watermark into the low-frequency sub-band of SSWT, the imperceptibility and robustness of watermark can be significantly improved comparing with some existing watermarking schemes. Experimental results show that proposed blind watermarking scheme is robust against JPEG compression, Gaussian noise, Wiener filtering and median filtering attacks. For rotation attack, we propose a novel watermarking resynchronization approach, the ideal watermark can be always successfully extracted after resynchronization operation to any angle rotated watermarked image. Experimental results show that the proposed resynchronization approach is considerably effective and feasible.

A Robust Oblivious Watermark System base on Hybrid Error Correct Code

Due to the rapid development of computer networks and data communication technologies, communication using digital media (text, picture, sound, video, etc.) has become more and more frequent. Digital media can be readily duplicated, modified, and transmitted, making them easy for people to create, manipulate, and enjoy. Thus the protection of the intellectual property rights of digital images becomes an important issue. Watermark is an effective and popular technique for discouraging illegal copying and distribution of copyrighted digital image information. In this paper, we proposed the method for robust watermarking. First, the robust watermarking scheme performed in the frequency domain. It can be used to prove the ownership. Second, we can provide a high degree of robustness against JPEG compression attacks by the source coding, and protect the transmit information by channel coding. We adopt the data distribution idea to avoid the continue information attack, because it will destroy the entire error correction scheme. Experimental results are also presented to demonstrate the validity and robustness of the approach.

Robust Image Watermarking Using Adaptive Structure Based Wavelet Tree Quantization

This work presents a novel robust wavelet-tree-based watermarking method based on structure-based quantization. Wavelet-trees are arranged into super-trees. The watermark bits are then embedded into the super-trees by using the proposed structure-based quantization method. Next, the super-trees are quantized into a significant structure according to these bits. The quantized super-tree has a stronger statistical characteristic than the unquantized super-tree. Based on this characteristic, the watermark bits could be extracted robustly after an image distortion attack. Finally, an adaptive method is developed to raise the PSNR value. Compared with Wang et al. [17] method, the proposed adaptive method increases PSNR about 5.83 dB. The proposed method also has a higher maximum number of watermark bits than other methods, thus increasing the capacity for embedding. Besides, its computation load is low. Experimental results demonstrate that the proposed watermarking method using adaptive structure-based wavelet-tree quantization performs well in JPEG compression, filtering (Gaussian filter, median filter and sharpen) and geometric attacks (pixel shifting and rotation). In addition, it is very robust against multiple watermark attacks.

NOVEL SELF-REFERENCE BASED IMAGE WATERMARKING SCHEME

In this paper, a novel image watermarking scheme based on a self-reference technique is proposed. The meaningful watermark is embedded into a gray-level image according to the relation between the constructed reference image and the original host. In order to be robust against Jpeg compression, the reference image should be robust under Jpeg compression. Firstly, the original image is transformed into DCT domain; and then most of the high frequency coefficients are omitted; after the quantization step and inverse DCT transform, we can obtain a robust reference. By considering the relation between the original image and its reference, we can embed the watermark into the host. The watermark extraction process is oblivious. Experimental results under several attacks show good robustness of the proposed scheme. Especially under cropping and Jpeg compression attacks, the watermark can be extracted with only few errors.

Adaptive watermarking scheme using a gray-level computer generated hologram

We present a new adaptive blind watermarking scheme using a gray-level computer generated hologram in the discrete wavelet transform domain. By utilizing an improved fuzzy clustering technique and human visual system , the watermark can be adaptively embedded according to block classification. To keep imperceptibility and robustness, a novel iterative embedding algorithm is adopted to change the to-be-embedded coefficients. Compared with the standard Fuzzy c-means (FCM) clustering, the suggested improved FCM (IFCM) converges more quickly and can avoid local optimum effectively. The experimental results demonstrate that the proposed scheme provides good robustness to withstand different kinds of common attack. Compared with other methods, the proposed method has the distinct advantage of better robustness to a JPEG compression attack.

A Robust Watermarking and Image Authentication Scheme used for Digital Contant Application

The development of computers and Internet has exploded in the last few years. The digital images are distributed and duplicated easily through WWW, thus the protection of the intellectual property rights of digital images becomes an important issue. In this paper, we proposed two techniques that are robust watermarking and image authentication scheme. The proposed scheme includes two parts. The first is a robust watermarking scheme performed in the frequency domain. It can be used to prove the ownership. The second is a signature process, which can be used to prove the integrity of the image. The input of the signature process is the edge properties extracted from the image. The signature can be correctly verified when the image is incidentally damaged such as lossy compression. Such a scheme can provide a high degree of robustness against JPEG compression attacks. Experimental results are also presented to demonstrate the validity and robustness of the new approach.

Image copyright protection with forward error correction

A copyright protection method for digital image with 1/ T rate forward error correction (FEC) is proposed in this paper. In this method, the original image is lossless and the watermark is robust to malicious attacks including geometric attacks such as scaling, rotation, cropping, print–photocopy–scan, and scaling–cropping attacks and nongeometric attacks such as low-pass filtering, sharpening, JPEG compression attacks. The watermark logo is fused with noise bits to improve the security, and later XORed with the feature value of the image by 1/ T rate FEC. During extraction, the watermark bits are determined by majority voting, and the extraction procedure needs neither the original image nor the watermark logo. Experimental results show that not only the image is lossless but also the proposed method can effectively resist the common malicious attacks. Since the proposed method is based on spatial domain and there is no need to do frequency transform, the embedding and extraction performances are quite improved.

A NEW CONTOURLET-DOMAIN BASED IMAGE WATERMARKING SCHEME RESILIENT TO GEOMETRICAL ATTACKS

Coping with geometrical attacks in transform domain is crucial when we design a robust image watermarking scheme. In this paper, a novel contourlet-domain image watermarking scheme, which is robust to common signal processing and geometrical attacks, is proposed. First, the region with maximum energy in the directional subbands is considered for watermarking, i.e. the watermark can be embedded into the significant region as well as highly textured region of the host image. Then, for each coefficient of the selected subband, the strength factor was adaptively adjusted in terms of the energy of its parent and neighbor coefficients. Consequently, the tradeoff between the transparency and robustness of watermark can be achieved. Furthermore, the robust feature points, which can survive various signal processing and affine transformation, are extracted by using the Harris–Laplace detector. In watermark detection, the geometrical distortion of image is identified by using the feature template constructed during embedding phase, i.e. watermark resynchronization is performed. Experimental results show that the proposed watermark scheme is invisible and robust against common signal processing such as median filtering, sharpening, noise adding and JPEG compression, etc and geometrical attacks such as rotation, translation, scaling, row or column removal, shearing and local random bend, etc.

Security and Robustness Enhancement for Image Data Hiding

In many applications, data hiding can be viewed as a tradeoff between capacity, robustness (against attacks), and embedding induced distortion. In this paper, we consider a fourth parameter: the security of the hidden information. Specifically, we propose a hash-based randomized embedding algorithm (HRE) that increases the security of the hidden data. We then optimize this algorithm against JPEG attacks. We derive a mathematical expression for the security of our algorithm, using which we show that the security of our algorithm can be increased independent of capacity, robustness, and embedding induced distortion. The maximum security depends only on the length of the key sequence, which is limited only by the size of the host image. Using a joint security and capacity measure, we show that the proposed scheme performs better than current secure quantization based data hiding schemes. We also derive the optimal value of distortion compensation factor of the HRE algorithm against JPEG compression attack. Experimental results show that the operating points achieved by the proposed scheme are 7 dB better than current blind data hiding schemes against the JPEG attack

Improved utilization of embedding distortion in scalar quantization based data hiding techniques

In this paper, we analyze the performance of scalar quantization based data hiding techniques with decreasing cover-signal sizes under mean squared error distortion measure. We introduce a new scheme, called multiple codebook data hiding, that enables conventional embedding/detection techniques to utilize the permitted embedding distortion more efficiently. The proposed method treats the embedding distortion introduced to a cover-signal as a random variable, and utilizes the fact that decreasing cover-signal size increases the deviation of the embedding distortion from its expected value. This is exploited by embedding the watermark into a variant of the cover-signal that yields a lower embedding distortion. In the proposed method, variants of the cover-signal are obtained by deploying a set of real unitary transformations known to both embedder and detector. For the given cover-signal, the embedder chooses a transformation basis and embeds the message in the transformed cover-signal, whereas the detector has to search all transformations of the received signal for the embedded message. We evaluate the performance improvement due to multiple codebook data hiding and compare it with the conventional (single codebook) approaches, under additive white Gaussian noise attacks, in terms of the bound on the probability of detection error. Performance results obtained from simulation and by applying the technique to image watermarking problem under JPEG compression attack are also presented.

A novel high-capacity data-embedding system

In this paper, we present a novel data-embedding system with high embedding capacity. The embedding algorithm is based on the quantized projection embedding method with some enhancement to achieve high embedding rates. In particular, our system uses a random permutation of the columns of a Hadamard matrix as projection vectors and a fixed perceptual mask based on the JPEG default quantization table for the quantization step design. As a result, the data-embedding system achieves 1/167 (1 bit out of 167 raw image bits) to 1/84 hiding ratios with a BER of around 0.1% in the presence of JPEG compression attacks, while maintaining visual distortion at a minimum.

Image watermarking through attack simulation

One of the most significant requirements for a useful watermarking system is strong resistance to a variety of common attacks. Accordingly, the watermark embedding is designed from the attack perspective in this paper. We attempt to develop a new just-noticeable distortion (JND) in the discrete cosine transform (DCT) domain, based on an attack simulation scheme that reversely derives the maximum modification amount embedded in the DCT domain under a condition of imperceptibility. A new location selection approach to watermark embedding is also addressed. We evaluate the fitness of the embedding location by considering the embedding capacity, i.e., the JND of the considered frequency component, in addition to the frequency and the spectral strength, which are usually adopted by the existing methods. Experimental results show satisfactory ability of our method to resist various common attacks such as JPEG compression, smoothing, sharpening, cropping, and noise attacks.