Professional Documents
Culture Documents
MTech. Scholar, 2Associate Professor, Dept of Computer Science & Engineering, KITE, Jaipur, Rajsthan, India
vikash.0213@gmail.com, chetanmnit@yahoo.in
Abstract
Digital Watermarking technique is now day needs to provide more robust for any image and also safe from many type of attack.
Because every day by day need of multimedia techniques improve so another hand also creating of duplication problem. In this paper
literature survey many techniques discuss year by year using for solving this problem. But according to my survey hybrid digital
image watermarking using of Singular Value Decomposition and Discrete Cosine Transformation algorithm is best .by using of this
hybrid digital watermarking possible to harmless our image from many type of attack and less PSNR value when you return back
image same position. We are also calculating the value of Correlational Coefficient on different step size step.
Keywords: Peak Signal noise ratio, Watermarking, Attacks, Singular Value Decomposition, Discrete Cosine
Transformation.
-----------------------------------------------------------------------***----------------------------------------------------------------------1. INTRODUCTION
Day by day it has been seen a quick growth of network
multimedia systems. This has led to an growing awareness of
how easy it is becoming to repeat the data. The ease with
which perfect copies can be made may lead to large-scale
unauthorized copying, which is a great concern to the image,
music, film, and book. A digital data can be easily transmitted,
received, duplicated or modified by using the Internet. The
copyright protection of digital data is an important legal issue
[1]. There are various processes are used for copyright
protection of digital data. The Digital watermarking is new
and most common technique for copyright protection and
considered as a possible solution. Watermarking is very
similar to steganography in a number of respects. Both pursue
to embed information inside a cover message with little to no
degradation of the cover-object. Watermarking techniques can
be classified according to the type of watermark presence
used, i.e., Watermark may be a visually recognizable logo or a
sequence of random numbers. Another organization is based
on the domain which the watermark is applied.
2. LITERATURE SURVEY:
2.1 ATTACKS ON DIGITAL WAVELET IMAGE
WATERMARKS:
In 2008 Andreja Sam covic, Jan Turan, Introduced many
method come in plan for hiding copyright character and many
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
220
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
221
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
222
Spatial Domain
A) Watermark embedding:
1) Use one-level Haar DWT to decompose the cover image A
into four sub bands (i.e., LL, LH, HL, and HH).
2) Apply SVD to LH and HL sub-bands, i.e., Ak= UkSk V kT,
k= 1, 2 (1) where k represents one of two sub-bands.
3) Divide the watermark into two parts: W = W1 +W2, where
Wkdenotes half of the watermark.
4) Modify the singular values in HL and LH subbands with
half of the watermark image and then apply SVD to them,
respectively, i.e., Sk+ Wk= UkWSkW V kT W
Where denotes the scale factor. The scale factor is used to
control the strength of the watermark to be inserted.
5) Obtain the two sets of modified DWT coefficients, i.e.,
Ak= UkSkW V kT, k= 1, 2.
6) Obtain the watermarked image AW by performing the
inverse DWT using two sets of modified DWT coefficients
and two sets of non-modified DWT coefficients.
B) Watermark extraction:
1) Use one-level Haar DWT to decompose the watermarked
(possibly distorted)
Image AW into four sub-bands: LL, LH, HL, and HH.
2) Apply SVD to the LH and HL sub-bands, i.e.,
Ak W = UkSk W V kT, k= 1, 2.
Where k represents one of two sub-bands
3) Compute Dk= UkWSk W V kTW ,k = 1, 2.
4) Extract half of the watermark image from each subband,
i.e.,
Wk= (Dk Sk)/, k = 1, 2.)
5) Combine the results of Step 4 to obtain the embedded
watermark: W= W1 +W2.
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
223
1
(mod N)
2
1
1
1
is input, is output.
2.5.1 An Example Is Discrete Cosine TransformationSingular Value Decomposition Domain Digital Image
Watermarking:
The process of separating the image into bands using the
DWT is well-defined. In two-dimensional DWT, each level of
decomposition produces four bands of data denoted by LL,
HL, LH, and HH. The LL sub-band can further be
decomposed to obtain another level of decomposition. In twodimensional DCT, we apply the transformation to the whole
image but need to map the frequency coefficients from the
lowest to the highest in a zig-zag order to 4 quadrants in order
to apply SVD to each block. All the quadrants will have the
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
224
B1
B2
B3
B4
DWT bands, we will label them B1, B2, B3, B4. This process
is depicted in Fig shown below.
B) Watermark Extraction:
In SVD-based watermarking, several approaches are possible.
A common approach is to apply SVD to the whole cover
image, and modify all the singular values to embed the
watermark data. An important property of SVD-based
watermarking is that the largest of the modified singular
values change very little for most types of attacks.
We will combine DCT and SVD to develop a new hybrid nonblind image watermarking scheme [28] that is resistant to a
variety of attacks. The proposed scheme is given by the
following algorithm. Assume the size of visual watermark is
nxn, and the size of the cover image is 2nx2n.
, = 1, . .
A) Watermark Embedding:
1. Apply the DCT to the whole cover image A.
2. Using the zig-zag sequence, map the DCT coefficients into
4 quadrants: B1, B2, B3, and B4.
3. Apply SVD to each quadrant: = , k = 1,2,3,4,
where k denotes B1,B2,B3 and B4
4. Apply DCT to the whole visual watermark W.
5. Apply SVD to the DCT-transformed visual watermark W:
= .
6. Modify the singular values in each Quadrant , k =
1,2,3,4, with the singular values of the
1 Where = 1 are
Thesingular values of , and = 1 are the singular
valuesof .
7. Obtain the 4 sets of modified DCT coefficients:
= ,
= 1,2,3,4.
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
225
REFERENCES
[1] R.J. Anderson, and F. Petitcolas,On the Limits of
Steganography , IEEE Journal of Selected Areas in
Communications, vol 16, Issue 4, pp 474 481, 1998.
[2] -PETITCOLAS, F.ANDERSON, R.KUHN, M. :
Attacks on Copyright Marking Systems, in Lecture Notes on
Computer Science, pp. 218238, April 1998.
[3] BOJKOVIC, Z.SAMCOVIC, A. : XXXVII
International Sci-entific Conference on Information,
Communication and Energy Systems and Technologies
ICEST 2002, Vol. 1, pp. 131134, Nis,Yugoslavia, 14
October 2002.
__________________________________________________________________________________________
Volume: 02 Issue: 09 | Sep-2013, Available @ http://www.ijret.org
226