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
03 Jun 2011
TL;DR: The experimental result shows that the proposed non blind watermarking technique for gray scale images in contourlet domain has higher robustness for cropping and JPEG compression attacks.
Abstract: This paper presents a non blind watermarking technique for gray scale images in contourlet domain. It uses the similarity based approach to create an effective watermarking system. In the proposed scheme host image is decomposed in contourlet domain upto four hierarchical levels. The watermark logo image and the directional subband of host image are divided into image blocks of size 8×8. The similarity coefficients are calculated between watermark image block and subband image block. The watermark image block is embedded into the directional subband block with best similarity. The PSNR value obtained using the proposed method is 46.76 dB. To test the robustness of the proposed method general geometric attacks such as salt & pepper noise, poisson noise, speckle noise, cropping attacks and JPEG compression attacks were applied. The experimental result shows that the proposed method has higher robustness for cropping and JPEG compression attacks.
9 citations
Cites background from "Robust Digital Watermarking Scheme ..."
...Some watermarking algorithms based on contourlet transforms have been proposed so far [7]-[10]....
[...]
01 Jan 2010
TL;DR: A novel oblivious and robust image watermarking scheme using Multiple Descriptions coding (MDC) is presented in this work and performance improvement is achieved over the existing methods in terms of Peak Signal to Noise Ratio and Normalized Cross correlation.
Abstract: A novel oblivious and robust image watermarking scheme using Multiple Descriptions coding (MDC) is presented in this work. Based on MDC, the host image is partitioned into two sub images called even description and odd description. Discrete Hadamard Transform (DHT) is applied for both descriptions. The watermark image is embedded in the resulting DC coefficients of the odd description using DC coefficients of the even description as the reference. Proposed scheme is characterized with parameters and Genetic Algorithm (GA) is used for parameter optimization and thereby performance improvement is achieved over the existing methods in terms of Peak Signal to Noise Ratio (PSNR) and Normalized Cross correlation (NCC). This algorithm is highly robust for different attacks on the watermarked image.
9 citations
Cites background or methods from "Robust Digital Watermarking Scheme ..."
...In [12], MDC based watermarking with one scaling factor for the entire range of selected coefficients is used....
[...]
...Characteristic Mohan & Kumar Method [12] Proposeed Method...
[...]
...Performance of the proposed method are compared with one of the method used in [12] and are shown in TABLE II....
[...]
...TABLE II COMPARISON OF PROPOSED METHOD WITH MOHAN AND KUMAR METHOD [12]...
[...]
...Strength factor used with the method of [12] is 0....
[...]
03 Dec 2010
TL;DR: This paper proposes a watermarking algorithm based on contourlet transform, one of the recently developed multiscale transforms that is more appropriate for image processing tasks in contrast with other transforms such as Fourier and wavelets.
Abstract: Watermarking is a new impressive digital copyright protection method and data security technology The image watermarking algorithms can be grouped into two groups depending on the domain of watermarking, ie, the spatial and transform domain Usually, the transform-based watermarking approaches can efficiently hide a robust watermark due to the utilization of the characteristics of human visual system (HVS) In this paper, we propose a watermarking algorithm based on contourlet transform The contourlet transform is one of the recently developed multiscale transforms that are more appropriate for image processing tasks in contrast with other transforms such as Fourier and wavelets In this base, the proposed algorithm in this paper stores the digital logo as side information by average quantization of selected contourlet coefficients in arbitrary subbands The proposed data embedding method is imperceptible and robust against several common watermarking attacks such as compression, adding noise, filtering and scaling
7 citations
Cites methods from "Robust Digital Watermarking Scheme ..."
...Unlike the proposed methods in spatial domain that hide information by disturbing the spatial characteristic, transform-based methods change the coefficients of transform and then obtain the watermarked image by taking the inverse transform [2]....
[...]
01 Dec 2009
TL;DR: In this paper, a new multiresolution watermarking method for still images based on the Contourlet Transform (CT) is proposed which enables us to embed more amount of data into the host image without degrading its perceptual quality.
Abstract: In this paper, we propose a new multiresolution watermarking method for still images based on the Contourlet Transform (CT). In our algorithm, the watermark is a grayscale image which is embedded into the host image in its contourlet domain. We demonstrate that in comparison with other methods, the proposed method enables us to embed more amount of data into the host image without degrading its perceptual quality. The experimental results show robustness against several common watermarking attacks such as compression, adding noise, and filtering.
7 citations
Cites background or methods from "Robust Digital Watermarking Scheme ..."
...Fig. 4 Energy variation in the last level [ 7 ]...
[...]
...20 Fig. 1 Contourlet Filter Bank [ 7 ] I I , I I I , , I , , I...
[...]
...According to [ 7 ] this subband possesses maximum energy compared to all the other subbands of the same level as can be seen from Fig. 4. The Energy E of a subband s(i ,}) , 0 :S i,j:S N is computed by...
[...]
...Schemes reported in [5], [6] require the original image for detection, while the methods in [ 7 ]-[11] do not....
[...]
...Mohan and Kumar [ 7 ] presented a blind watermarking scheme using multiple description and quantization indexed modulation of the host image....
[...]
01 Oct 2012
TL;DR: A new method of image watermarking by using contourlet transform along with singular value decomposition, which is robust to various attacks such as JPEG compression, rotation, histogram modification, Gaussian and median filtering and gamma correction.
Abstract: In this paper, we propose a new method of image watermarking by using contourlet transform along with singular value decomposition. Contourlet transform is a new two-dimensional extension of the wavelet transform using multi-scale and directional filter banks. For security aspect of the watermarking algorithm and to improve imperceptibility of the algorithm, watermark bits are permuted by an interleaver. In embedding part, contourlet transform is applied to host image and appropriate direction is selected by considering intensity variance of all directions. Coefficients are modified by combining singular values of selected direction with singular values of watermark image. Experimental results show no visible difference between host and watermarked images. The proposed watermarking method is also robust to various attacks such as JPEG compression, rotation, histogram modification, Gaussian and median filtering and gamma correction.
7 citations
Cites background from "Robust Digital Watermarking Scheme ..."
...Nowadays, many experts have focused on the watermarking technique in CT domain [6-10]....
[...]
References
More filters
TL;DR: A "true" two-dimensional transform that can capture the intrinsic geometrical structure that is key in visual information is pursued and it is shown that with parabolic scaling and sufficient directional vanishing moments, contourlets achieve the optimal approximation rate for piecewise smooth functions with discontinuities along twice continuously differentiable curves.
Abstract: The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a "true" two-dimensional transform that can capture the intrinsic geometrical structure that is key in visual information. The main challenge in exploring geometry in images comes from the discrete nature of the data. Thus, unlike other approaches, such as curvelets, that first develop a transform in the continuous domain and then discretize for sampled data, our approach starts with a discrete-domain construction and then studies its convergence to an expansion in the continuous domain. Specifically, we construct a discrete-domain multiresolution and multidirection expansion using nonseparable filter banks, in much the same way that wavelets were derived from filter banks. This construction results in a flexible multiresolution, local, and directional image expansion using contour segments, and, thus, it is named the contourlet transform. The discrete contourlet transform has a fast iterated filter bank algorithm that requires an order N operations for N-pixel images. Furthermore, we establish a precise link between the developed filter bank and the associated continuous-domain contourlet expansion via a directional multiresolution analysis framework. We show that with parabolic scaling and sufficient directional vanishing moments, contourlets achieve the optimal approximation rate for piecewise smooth functions with discontinuities along twice continuously differentiable curves. Finally, we show some numerical experiments demonstrating the potential of contourlets in several image processing applications.
3,948 citations
TL;DR: A new approach to mask the watermark according to the characteristics of the human visual system (HVS) is presented, which is accomplished pixel by pixel by taking into account the texture and the luminance content of all the image subbands.
Abstract: A watermarking algorithm operating in the wavelet domain is presented. Performance improvement with respect to existing algorithms is obtained by means of a new approach to mask the watermark according to the characteristics of the human visual system (HVS). In contrast to conventional methods operating in the wavelet domain, masking is accomplished pixel by pixel by taking into account the texture and the luminance content of all the image subbands. The watermark consists of a pseudorandom sequence which is adaptively added to the largest detail bands. As usual, the watermark is detected by computing the correlation between the watermarked coefficients and the watermarking code, and the detection threshold is chosen in such a way that the knowledge of the watermark energy used in the embedding phase is not needed, thus permitting one to adapt it to the image at hand. Experimental results and comparisons with other techniques operating in the wavelet domain prove the effectiveness of the new algorithm.
949 citations
"Robust Digital Watermarking Scheme ..." refers methods in this paper
...Even though, DWT is a popular, powerful and familiar to watermarking community, it has its own limitations in capturing the directional information such as smooth contours, and directional edges of the image....
[...]
...Image watermarking algorithms using Discrete Cosine Transform (DCT) [1, 2], Discrete Wavelet Transform (DWT) [3, 4], Discrete Hadamard Transform (DHT) [5] and Singular Value Decomposition (SVD) [6, 7] are available in the literature....
[...]
...DWT offers multistage and time-frequency localization of the image....
[...]
...Discrete Countourlet Transform (CT) is able to capture the directional edges and contours superior to Discrete Wavelet Transform (DWT)....
[...]
TL;DR: The authors provide a novel mapping of the proposed 1-D framework into 2-D that preserves the following: i) perfect reconstruction; ii) stability in the IIR case; iii) linear phase in the FIR case; iv) zeros at aliasing frequency; v) frequency characteristic of the filters.
Abstract: Proposes a novel framework for a new class of two-channel biorthogonal filter banks. The framework covers two useful subclasses: i) causal stable IIR filter banks. ii) linear phase FIR filter banks. There exists a very efficient structurally perfect reconstruction implementation for such a class. Filter banks of high frequency selectivity can be achieved by using the proposed framework with low complexity. The properties of such a class are discussed in detail. The design of the analysis/synthesis systems reduces to the design of a single transfer function. Very simple design methods are given both for FIR and IIR cases. Zeros of arbitrary multiplicity at aliasing frequency can be easily imposed, for the purpose of generating wavelets with regularity property. In the IIR case, two new classes of IIR maximally flat filters different from Butterworth filters are introduced. The filter coefficients are given in closed form. The wavelet bases corresponding to the biorthogonal systems are generated. the authors also provide a novel mapping of the proposed 1-D framework into 2-D. The mapping preserves the following: i) perfect reconstruction; ii) stability in the IIR case; iii) linear phase in the FIR case; iv) zeros at aliasing frequency; v) frequency characteristic of the filters. >
417 citations
Additional excerpts
...In both LP decomposition and DFB decomposition, ‘pkva’ filters [12] are used because of their efficient implementation....
[...]
TL;DR: In this paper, a singular value decomposition (SVD)-based watermarking scheme is proposed, which preserves both one-way and non-symmetric properties, usually not obtainable in DCT and DFT transformations.
367 citations
"Robust Digital Watermarking Scheme ..." refers methods in this paper
...Image watermarking algorithms using Discrete Cosine Transform (DCT) [1, 2], Discrete Wavelet Transform (DWT) [3, 4], Discrete Hadamard Transform (DHT) [5] and Singular Value Decomposition (SVD) [6, 7] are available in the literature....
[...]
DOI•
01 Jan 2002
TL;DR: This thesis focuses on the development of new "true" two-dimensional representations for images using a discrete framework that can lead to algorithmic implementations and a new family of block directional and orthonormal transforms based on the ridgelet idea.
Abstract: Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an object of interest in a small description. For practical applications, this representation has to be realized by structured transforms and fast algorithms. Recently, it has become evident that commonly used separable transforms (such as wavelets) are not necessarily best suited for images. Thus, there is a strong motivation to search for more powerful schemes that can capture the intrinsic geometrical structure of pictorial information. This thesis focuses on the development of new "true" two-dimensional representations for images. The emphasis is on the discrete framework that can lead to algorithmic implementations. The first method constructs multiresolution, local and directional image expansions by using non-separable filter banks. This discrete transform is developed in connection with the continuous-space curvelet construction in harmonic analysis. As a result, the proposed transform provides an efficient representation for two-dimensional piecewise smooth signals that resemble images. The link between the developed filter banks and the continuous-space constructions is set up in a newly defined directional multiresolution analysis. The second method constructs a new family of block directional and orthonormal transforms based on the ridgelet idea, and thus offers an efficient representation for images that are smooth away from straight edges. Finally, directional multiresolution image representations are employed together with statistical modeling, leading to powerful texture models and successful image retrieval systems.
352 citations
"Robust Digital Watermarking Scheme ..." refers methods in this paper
...In contourlet transform, DFB is implemented using quincunx filter bank with fan filters [10]....
[...]