Robust Digital Watermarking Scheme using Contourlet Transform
01 Jan 2008-
TL;DR: A novel oblivious and highly robust watermarking scheme using Multiple Descriptions (MD) and Quantization Index Modulation (QIM) of the host image and superior in terms of Peak Signal to Noise Ratio (PSNR) and Normalized Cross correlation (NC).
Abstract: Summary A novel oblivious and highly robust watermarking scheme using Multiple Descriptions (MD) and Quantization Index Modulation (QIM) of the host image is presented in this paper. The watermark is embedded in the Discrete Contourlet Transform domain (CT). Discrete Countourlet Transform (CT) is able to capture the directional edges and contours superior to Discrete Wavelet Transform (DWT). Watermark embedding is done at two stages for achieving robustness to various attacks. This algorithm is highly robust for different attacks on the watermarked image and superior in terms of Peak Signal to Noise Ratio (PSNR) and Normalized Cross correlation (NC). here the part of summary.
Citations
More filters
TL;DR: A novel multiplicative watermarking scheme in the contourlet domain using the univariate and bivariate alpha-stable distributions is proposed and the robustness of the proposed bivariate Cauchy detector against various kinds of attacks is studied and shown to be superior to that of the generalized Gaussian detector.
Abstract: In the past decade, several schemes for digital image watermarking have been proposed to protect the copyright of an image document or to provide proof of ownership in some identifiable fashion. This paper proposes a novel multiplicative watermarking scheme in the contourlet domain. The effectiveness of a watermark detector depends highly on the modeling of the transform-domain coefficients. In view of this, we first investigate the modeling of the contourlet coefficients by the alpha-stable distributions. It is shown that the univariate alpha-stable distribution fits the empirical data more accurately than the formerly used distributions, such as the generalized Gaussian and Laplacian, do. We also show that the bivariate alpha-stable distribution can capture the across scale dependencies of the contourlet coefficients. Motivated by the modeling results, a blind watermark detector in the contourlet domain is designed by using the univariate and bivariate alpha-stable distributions. It is shown that the detectors based on both of these distributions provide higher detection rates than that based on the generalized Gaussian distribution does. However, a watermark detector designed based on the alpha-stable distribution with a value of its parameter α other than 1 or 2 is computationally expensive because of the lack of a closed-form expression for the distribution in this case. Therefore, a watermark detector is designed based on the bivariate Cauchy member of the alpha-stable family for which α = 1 . The resulting design yields a significantly reduced-complexity detector and provides a performance that is much superior to that of the GG detector and very close to that of the detector corresponding to the best-fit alpha-stable distribution. The robustness of the proposed bivariate Cauchy detector against various kinds of attacks, such as noise, filtering, and compression, is studied and shown to be superior to that of the generalized Gaussian detector.
80 citations
TL;DR: This study uses the likelihood ratio decision rule and t-location scale distribution to design an optimal multiplicative watermark detector that showed higher efficiency and robustness against different attacks, and derives the receiver operating characteristics (ROC) analytically.
53 citations
TL;DR: A novel watermarking scheme that exploits the features of micro images of watermarks to build association rules and embeds the rules into a host image instead of the bit stream of the watermark, which is commonly used in digital water marking.
Abstract: A novel watermarking scheme is proposed that could substantially improve current watermarking techniques This scheme exploits the features of micro images of watermarks to build association rules and embeds the rules into a host image instead of the bit stream of the watermark, which is commonly used in digital watermarking Next, similar micro images with the same rules are collected or even created from the host image to simulate an extracted watermark This method, called the features classification forest, can achieve blind extraction and is adaptable to any watermarking scheme using a quantization-based mechanism Furthermore, a larger size watermark can be accepted without an adverse effect on the imperceptibility of the host image The experiments demonstrate the successful simulation of watermarks and the application to five different watermarking schemes One of them is slightly adjusted from a reference to especially resist JPEG compression, and the others show native advantages to resist different image processing attacks
39 citations
Cites background from "Robust Digital Watermarking Scheme ..."
...Briefly, the schemes, depending on the domain in which the watermark is embedded, can be classified into the spatial domain [10]–[12], the transform domain [7], [8], [13]–[21], or a hybrid of those two domains [3], [22]....
[...]
TL;DR: Since watermark is embedded in the local as well as global CT coefficients of two different frequency bands, the proposed method is robust against a wide range of attacks.
Abstract: In this paper we propose a blind and highly robust watermarking method consisting of two embedding stages. In the first stage, the odd description of image is divided into non-overlapped fixed size blocks and the signature (watermark) is embedded in the high frequency component of the Contourlet transform (CT) of the blocks. In the second stage, the signature is embedded in the low frequency component of the global CT of the image. The main issue associated with two-stage blind watermarking is the selection of the less affected signature among the two embedded signatures. In this paper a measure is introduced to decide between the two extracted signatures. Simulation results indicate that the proposed method achieves higher robustness compared to other known watermarking methods. Moreover, since watermark is embedded in the local as well as global CT coefficients of two different frequency bands, the proposed method is robust against a wide range of attacks. This is due to the fact that most of the attacks affect either a specific frequency band or a specific location in the watermarked image.
39 citations
Cites methods or result from "Robust Digital Watermarking Scheme ..."
...Pan et al. [17] proposed an innovative scheme for VQ-based image watermarking with multiple description coding (MDC), which is suitable for transmitting over noisy channels....
[...]
...The PSNR values of the watermarked images by our method and the other twostage watermarking method [21] are listed in Table 4....
[...]
...They have claimed that by employing MDC, simulation results also present improved robustness of the watermarking algorithm along with more resilience to overcome channel noise in lightly to heavily erroneous channels....
[...]
...The robustness of our method compared to other robust watermarking methods including Khalighi et al. [19], Mohan et al. [21], Peng et al. [28] and Lin et al. [29] is tested as well....
[...]
...The M N watermarked image Iw2 (i,j) is divided into odd and even descriptions using MDC....
[...]
TL;DR: Experimental results demonstrate that the proposed image watermarking is not only secure and invisible, but also robust against a variety of attacks.
Abstract: In this paper, a novel secure optimal image watermarking scheme using an encrypted gyrator transform computer generated hologram (CGH) in the contourlet domain is presented. A new encrypted CGH technique, which is based on the gyrator transform, the random phase mask, the three-step phase-shifting interferometry and the Fibonacci transform, has been proposed to produce a hologram of a watermark first. With the huge key space of the encrypted CGH, the security strength of the watermarking system is enhanced. To achieve better imperceptibility, an improved quantization embedding algorithm is proposed to embed the encrypted CGH into the low frequency sub-band of the contourlet-transformed host image. In order to obtain the highest possible robustness without losing the imperceptibility, particle swarm optimization algorithm is employed to search the optimal embedding parameter of the watermarking system. In comparison with other method, the proposed watermarking scheme offers better performances for both imperceptibility and robustness. Experimental results demonstrate that the proposed image watermarking is not only secure and invisible, but also robust against a variety of attacks.
29 citations
References
More filters
TL;DR: Performance of the proposed framework for various attack channels such as additive white Gaussian noise, MPEG compression, and random bit error channels shows that the proposed method performs reasonably well compared to non-oblivious schemes.
Abstract: It is believed that digital watermarking can be a powerful tool that can be used to protect digital contents from illegal copying and distribution. Detecting the presence/absence of a watermark in a given digital content such as image/video data without using the unwatermarked orignial data is called oblivious watermark detection and the watermarking process is oblivious watermarking. Oblivious watermarking has many important practical applications such as secure video streaming or wireless image/video transmission where the intended receiver typically has access only to the received data. We propose for the first time a multiple description framework for oblivious watermarking. Parallels between multiple description source coding and the watermarking are drawn. An information theoretic definition of the problem is given. A spread-spectrum watermarking algorithm for DCT based multiple descriptions is described. Performance of the proposed framework for various attack channels such as additive white Gaussian noise, JPEG compression, and random bit error channels shows that the proposed method performs reasonably well compared to non-oblivious schemes. We believe the proposed framework can be further improved in conjunction with other methods such as error control coding. This framework can find applications in scalable watermarking (such as scalable video coding), rate controlled multimedia multicasting, secure wireless transmission, watermarking for distributed storage, and packet networks.
23 citations
01 Jan 2006
TL;DR: A modified digital image watermarking scheme based on the combination of spatial and transform domains is proposed, which is more secure for data hiding and robust for various attacks, viz., cropping and noise.
Abstract: A modified digital image watermarking scheme based on the combination of spatial and transform domains is proposed. The aim of this work is to achieve robustness for the vital part of the watermark image without scarifying the embedding capacity of the watermark image. The watermark image is split into two parts depending on the vital information. The perceptibility of the watermarked image is improved by hiding the vital part of the watermark image in the blocks of the host image having highest variance in transform domain. The remaining part of the watermark image is watermarked in the spatial domain. The proposed algorithm is more secure for data hiding and robust for various attacks, viz., cropping and noise. The performance of this algorithm is noteworthy in terms of normalized cross correlation (NCC) and peak signal to noise ratio (PSNR). Additional security is achieved by permuting the watermark image. In this work Hadamard transform is used to hide the vital part of the watermark image in the host image.
7 citations