The effect of quality scalable image compression on robust watermarking (original) (raw)
Related papers
The effect of quantization based compression in quality scalable image coding on the robustness of wavelet based watermarking is presented. The non-blind direct modification type watermarking is considered for the analysis presented in this paper. First we present the analysis considering any quantization parameter and then restrict it to the integer powers of two to model the bit-plane discarding based quantization used in quality scalable coding, such as JPEG2000. This work assumes that the watermark embedding and compression uses the same wavelet filters. The derived model shows the relationship between the modified coefficients and the quantization factor, which is then used to obtain the conditions for the correct watermark extraction under compression. Based on this analysis, one can select wavelet coefficients for embedding the watermark in a manner that the correct watermark extraction is possible for a given quantization level. The results show higher robustness when this model is used for embedding the watermark. The paper also evaluates the performance of the model when the watermark embedding and the compression wavelet filters are not the same.
ROBUSTNESS ANALYSIS OF BLIND WATERMARKING FOR QUALITY SCALABLE IMAGE COMPRESSION
2010
Robustness analysis of a blind wavelet based ranked-ordered watermarking scheme against quality scalable image compression is presented in this paper. The analysis considers a general wavelet-based compression scheme by modeling the bit-plane discarding, used in achieving quality scalability in JPEG2000. In this work we aim to improve the robustness by proposing the optimum modification for the selected coefficients in order to retain the watermark information. A relationship is established between the watermark detection algorithm and the number of bit planes discarded and this knowledge is used during the embedding procedure. The proposed model assumes the same embedding and compression wavelet kernel. The experimental results verify the proposed model and demonstrate improved performance in robustness to quality scalable compression in JPEG2000.
Quantization-based Image Watermarking using multi-resolution wavelet decomposition
Watermarking techniques provide efficient methods for protecting copyright of intellectual property. Since the discrete wavelet transform allows independent processing of the resulting sub-bands without significant perceptible interaction between them, it is expected to make the watermark embedding more imperceptible. Furthermore, Wavelet-based watermarking techniques showed to be robust in the face of attacks. In this paper, we introduce an algorithm that applies a quantization step on the sorted detail coefficients of the L th level resolution of the wavelet decomposition of a true color image. The extraction process can be carried out blindly, i.e. without the need to refer to the original host image. Experimental results showed that the proposed embedding strategy causes low distortion on the watermarked images where the PSNR values were successfully greater than 40 dB. Furthermore, the proposed method showed effective resistance to attacks such as JPEG compression, image filtering, and Gaussian noise. More simulations were also carried out to evaluate the performance of the proposed algorithm in comparison to similar transformdomain techniques.
An Efficient Watermarking Method Based on Significant Difference of Wavelet Coefficient Quantization
IEEE Transactions on Multimedia, 2008
This paper describes an attack on the recently proposed 'Watermarking Method Based on Significant Difference of Wavelet Coefficient Quantization' [1]. While the method is shown to be robust against many signal processing operations, security of the watermarking scheme under intentional attack exploiting knowledge of the implementation has been neglected. We demonstrate a straightforward attack which retains the fidelity of the image. The method is therefore not suitable for copyright protection applications. Further, we propose a countermeasure which mitigates the shortcoming.
Advances in Electrical and Computer Engineering, 2010
In this paper, an innovative blind watermarking algorithm has been proposed for imagery applications. This algorithm has used the coefficients of the discrete wavelet transform of the host image in the form of super trees to embed the predefined binary watermark in the host image. In this scheme, a pseudo random sequence is generated to determine the exact wavelet super trees used for embedding procedure. In the next step, after choosing the maximum and second maximum amplitude coefficients of each super tree, the distance vector between two coefficients is computed. For embedding bit zero of the specified watermark, the values of the distance vector elements are decreased, while for embedding bit 1, those values will be increased based on the proposed formulas. The experimental results show that the proposed algorithm has significant robustness against image processing attacks, especially JPEG compression and also the PSNR value for the watermarked images generated by the proposed method is more than 42 dB.
A Robust Wavelet-Based Watermarking Scheme Using Quantization and Human Visual System Model
Information Technology Journal, 2003
In this paper, a highly robust watermarking scheme based on Discrete Wavelet Transform (DWT) is proposed. It has the following features. First, unlike conventional proposed watermarking techniques, a watermark is embedded into the lowest frequency components. Second, the Human Visual System (HVS) model is adopted to improve the transparency of the watermarked image. Several experiments are conducted t o demonstrate the robustness property of this watermarking scheme. Furthermore, it is worthwhile to mention that the proposed scheme is resistant to the counterfeiting attack. In addition, comparison of the proposed scheme with other state-of-the-art watermarking schemes based on DWT shows that our scheme is more effective.
Implementation of Watermarking for a Blind Image using Wavelet Tree Quantization
This paper proposes implementation of watermarking for a blind image using wavelet tree quantization for copyright protection. In such a quantization scheme, there exists a large significant difference while embedding a watermark bit 1 and a watermark bit 0; it then does not require any original image or watermark during the watermark extraction. As a result, the watermarked images look lossless in comparison with the original ones, and the proposed method can effectively resist common image processing attacks; especially for JPEG compression and low-pass filtering. Moreover, by designing an adaptive threshold value in the extraction process, our method is more robust for resisting common attacks such as median filtering, average filtering, and Gaussian noise. Experimental results show that the watermarked image looks visually identical to the original, and the watermark can be effectively extracted even after either an unintentional image processing or intentional image attacks.
Image Watermarking Based on the Discrete Wavelet Transform Statistical Characteristics
EUROCON 2005 - The International Conference on "Computer as a Tool", 2005
The current paper proposes a robust watermarking method for still images that embeds a binary watermark into the detail subbands of the image wavelet transform. The perceptually significant coefficients are selected for each subband using a different threshold. The threshold is computed based on the statistical analysis of the wavelet coefficients. For greater invisibility of the mark, the approximation subband is left unmodified. The watermark is embedded several times to achieve robustness. The method is tested against different types of attacks (lossy compression, AWGN, scaling, cropping, intensity adjustment, filtering and collusion attack). The proposed method was compared with a state-of-the-art watermarking method, highlighting its performances.
Wavelet Domain Quantization Based Video Watermarking
ijmse.org
in this Article, We present a robust watermarking technique based on singular value disintegration and PREDA extracted watermark to initiate a digital watermarking technique for working in the Discrete Wavelet Transform domain. The plan practice binary images as watermarks. The maximum capacity is not essential in most implementation; thereby we have diminished it to increase the robustness of the plan. Every bit of the watermark is extending over a number of wavelet coefficients with the use of a secret key. We use error correction codes to increase in quality the resilience of the algorithm. we choose the quantization step q is a tradeoff between the intuitive qualities of the watermarked video Inverse Discrete Wavelet Transform is computed to acquire the watermarked video the q should be small so we try the plan with q=8.The results The experimental results show that the proposed scheme is robust against a variety of attacks including frame dropping and have very good intuitive quality with mean PSNR values of the watermarked videos frame.
Analysis of quantization watermarking in the wavelet transform domain
2003
Abstract Quantization watermarking is a method of embedding hidden copyright information based on dithered quantization. Such a scheme is only practical for watermarking applications, where the original signal is available to the detector as for a fingerprinting purpose. The aim of this paper is to analyze the quantization watermarking in the wavelet transform or equivalently in filter bank domain.