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: It can be concluded that, the proposed novel watermarking scheme for image authentication can be applied for practical applications.
Abstract: Hierarchy of one-dimensional ergodic chaotic maps with Tsallis type of q -deformation are studied. We find that in the chaotic region, these maps with q -deformation are ergodic as the Birkhoff ergodic theorem predicts. q -deformed maps are defined as ratios of polynomials of degree N . Hence, by using the Stieltjes transform approach (STA), invariant measure is proposed. In addition, considering Sinai-Ruelle-Bowen (SRB) measure, Kolmogorov-Sinai (KS) entropy for q -deformed maps is calculated analytically. The new q -deformed scheme have ability to keep previous significant properties such as ergodicity, sensitivity to initial condition. By adding q -parameter to the hierarchy in order increase the randomness and one-way computation, we present a new scheme for watermarking. The introduced algorithm tries to improve the problem of failure of encryption such as small key space, encryption speed and level of security. To illustrate the effectiveness of the proposed scheme, some security analyses are presented. By considering the obtained results, it can be concluded that, this scheme have a high potential to be adopted for watermarking. It can be concluded that, the proposed novel watermarking scheme for image authentication can be applied for practical applications.
25 citations
TL;DR: A semi-fragile watermark based on cat transformation is designed and implemented, mostly used to locate tamper and recover for the transformed image and plain-image and has better effect of tamper location and recovery.
Abstract: More than ever, the practical and accurate watermarking technologies are called for the growing amount of exchanged digital image over the Internet. To protect the integrity and authenticity of digital image and to enhance the effect of tamper detection and restoration, we design and implement a semi-fragile watermark based on cat transformation, mostly used to locate tamper and recover for the transformed image and plain-image. The watermark which consists of two parts: the authentication watermark and recovery watermark, is embedded into the 2 least significant bit (LSB) of the pixel of the original image. The authentication watermark is calculated by the pixel value comparison and the parity check code, while the recovery watermark contains the average pixel value of the Torus image block. In the detection side, we use the hierarchy concept to locate the tamper in three layers and recover the attacked image in two layers. By using the hierarchy concept, this algorithm has another superiority that tamper can be detected on confused image. The experimental results show that our algorithm can accurately locate tamper and realize the content recovery and effectively prevent the vector quantization attack. Compared with other algorithms, this algorithm has better effect of tamper location and recovery.
22 citations
01 Jan 2010
TL;DR: A new robust hybrid watermarking technique based on recently introduced contourlet transform and singular value decomposition that shows the higher imperceptibility and robustness against common image processing attacks such as Jpeg compression, Jpeg 2000 compression, resizing, median filtering, histogram equalization, sharpening, and Gama correction.
Abstract: In this paper, we propose a new robust hybrid watermarking technique based on recently introduced contourlet transform and singular value decomposition. After applying the contourlet transform for the original image, we select the low frequency directional sub band coefficients and apply singular value decomposition. The singular values of the original image are then modified by the singular values of contourlet transformed binary logo watermark image. Combination of these two transforms on image improves the performance of watermarking algorithm. It has been observed that, in comparison with other contourlet based and wavelet based methods, the proposed method shows the higher imperceptibility and robustness against common image processing attacks such as Jpeg compression, Jpeg 2000 compression, resizing, median filtering, histogram equalization, sharpening, and Gama correction.
20 citations
03 Dec 2010
TL;DR: Experimental results show that the proposed scheme guarantees high peak signal to noise ratio (PSNR), and is very robust against scaling, JPEG compression, cropping etc.
Abstract: In this paper, we present an image watermarking scheme based on contourlet transform (CT) and singular value decomposition (SVD). Unlike usual CT algorithm where the watermarking is embedded directly into the coefficients, we segment the lowpass coefficients into blocks. The blocks are decomposed using SVD, and the watermarking image after Arnold scrambling is embedded into the biggest singular value by using Euclidean norm and combining with human visual system (HVS) adaptively. Experimental results show that the proposed scheme guarantees high peak signal to noise ratio (PSNR), and is very robust against scaling, JPEG compression, cropping etc.
19 citations
Cites methods from "Robust Digital Watermarking Scheme ..."
...Jayalakshmi et al [6] proposed a nonblind watermarking scheme using the pixels selected from high frequency coefficients based on directional subbands....
[...]
TL;DR: If the information of the image is utilized to determine the watermark and by using quantization index modulation properties, a higher robustness and more effective imperceptibility in proposed algorithm are achieved.
19 citations
Cites background or methods from "Robust Digital Watermarking Scheme ..."
..., 2015), DWT (Keshavarzian and Aghagolzadeh, 2015), CT (Mohan and Kumar, 2008; Akhaee et al., 2010), and SVD or a combination of them (Fan et al....
[...]
...Well-known transform domain methods are DFT (Cedillo-Hernandez et al., 2012), DCT (Gupta et al., 2015), DWT (Keshavarzian and Aghagolzadeh, 2015), CT (Mohan and Kumar, 2008; Akhaee et al., 2010), and SVD or a combination of them (Fan et al., 2014)....
[...]
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]....
[...]