Paper 3

International Journal of Advances in Science and Technology,
Vol. 3, No.6, 2011

A Robust and Blind Image Watermarking Scheme in Contourlet
Domain based on Singular Value Decomposition

J. Chandrasekhar Rao
1
,

K. Ujwal Deep
2
,

Suneel Mudunuru
3
, G. Mary Silvya
4
, and

Naseema Shaik
5

1,2,3,4,5
Assistant Professor, Department of ECE, KL University, AP, India.
jettychandu@gmail.com, ujwaldeep@gmail.com,sylviagangolu@gmail.com,suneel.klu@gmail.com,
naseem.dilshad@gmail.com

Abstract

In this paper, a robust and blind digital image watermarking scheme in contourlet domain with singular
value decomposition is proposed for multimedia copyright protection. In contrast to traditional methods
where the watermark bits are embedded directly on the contourlet transform coefficients, the proposed
scheme is based on watermark bits embedding on the singular value of the selected blocks within lowpass
subband of the original gray image contourlet transform. Experimental results demonstrate that the quality
of watermarked image is robust against attacks such as JPEG compression, lowpass filtering, noise addition,
scaling and cropping. Watermark extraction is efficient and blind in the sense that the original image or
original watermark is not required.

Keywords: Contourlet transform, digital image watermarking, singular value decomposition, lowpass
subband, quantization strategies.

1. Introduction

Widespread use of the Internet, a lot of digital media, including audio, video, and image, have been
duplicated, modified by anyone easily and unlimitedly. Copyright protection of the intellectual property of the
sensitive or critical digital information is an important legal issue globally. To ensure security, copyright
information is hidden into digital data itself, but the access of the data is not restricted. The digital watermarking
technology is an effective way for solving these problems and it has become a hot topic of image processing and
multimedia information security [1]. Digital watermark is a digital signal or pattern imposed on a digital
document. Digital watermarking is the process of embedding information into a digital signal in a way that is
difficult to remove. Copyright protection and data authentication are the main application areas for digital image
watermarking [2].
In accordance with the embedding position, digital image watermarking techniques can be categorized into
one of the two domains: spatial domain and transform domain. The simplest technique in the spatial domain
methods is to embed the watermark image pixels in the least significant bits of the host image pixels [3, 4]. The
data hiding capacity in these methods is high. However, these methods are highly robust. Watermarking in
transform domain is more secure and robust to various attacks. Image watermarking algorithms using Discrete
Fourier Transform (DFT) [5], Discrete Cosine Transform (DCT) [6, 7], Discrete Wavelet Transform (DWT)
[8,9] and Singular Value Decomposition (SVD) [10,11,12,13,14,15,16,17,18,19] are available in the literature.
The basic philosophy in majority of the transform domain watermarking schemes is to modify transform domain
coefficients based on the bits in the watermark image. Most of the domain transformation watermarking
schemes works with DCT and DWT.
Among all other transforms, DWT has been widely used transform in the digital image watermarking
algorithms, since new image coding standards like JPEG 2000 compression standard uses wavelet domain
representation [20]. And also DWT has a number of advantages over other transforms includes space-frequency
localization, multiresolution representation, superior human visual system (HVS) modeling, linear complexity
and adaptivity [21]. But, it has been proved that wavelets are good at representing discontinuities in one-
dimension only [22]. However in natural images discontinuity points (i.e. edges) are typically located along the
smooth curves (i.e. contours). Natural images contain intrinsic geometrical structures that are key features in
visual information. As a result of a separable extension from 1-D wavelets, wavelets in 2-D are good at
identifying the discontinuities at edge points, but will not see the smoothness along the contour. So, curvelet
transform was defined by candes and Donoho to represent two dimensional discontinuities more efficiently,
with least mean square error in a fixed term approximation [22]. But, curvelet transform was proposed in
continuous domain and its discretization was a challenge when critical sampling was desired. M.N Do and M.
December Issue Page 16 of 85 ISSN 2229 5216
Vol. 3, No.6, 2011
Vetterli proposed a Contourlet transform as a solution to above mentioned problems and had the features of
multiresolution, space-frequency resolution, high degree of directionality and anisotropy [23]. Contourlet
transform was proposed as an improvement to curvelet transform using a double filter bank structure.
However, Image matrix Singular value decomposition (SVD) is one of the most powerful numerical analysis
techniques and it reflects the internal image characteristics and has good stability if image processing is
performed. Therefore, hybrid DCT-SVD [24], DFT-SVD [25] and DWT-SVD [26] domain watermarking
algorithms have been proposed. These algorithms with both SVD advantages and different transform domain
characteristics have improved the digital watermarking performance in different extent. In this paper, we
propose a robust and blind image watermarking scheme using the hybrid Contourlet-SVD (CT-SVD). The
contourlet transform has been developed as a true two dimensional representation that can capture the
geometrical structure in pictorial information. The watermark bits are embedded into the singular values in the
SVD layers for the lowpass subband blocks in contourlet domain with the quantization index modulus
modulation scheme which achieves the highest possible robustness.
The paper is organized as follows. Section 2 describes the contourlet transform and SVD; section 3 describes
the proposed algorithm. The simulation results of embedding and retrieval procedure are given in Section 4.

2. The Contourlet Transform and SVD

The Contourlet Transform was introduced by M. N Do and Martin Vetterli. Contourlet Transform provides a
flexible multiresolution representation for two dimensional signals and also it can efficiently represent images
containing smooth contours and textures. The Contourlet transform is a combination of a Laplacian Pyramid
(LP) and a Directional Filter Bank (DFB). It makes use of the Laplacian Pyramid for the multiresolution
decomposition of the image and Directional Filter Banks for directional decomposition on every bandpass
image. Figure 1 shows a multiscale and directional decomposition using a combination of Laplacian pyramid
(LP) and a Directional Filter Bank (DFB). Bandpass images from the LP are fed into a DFB so that directional
information can be captured. The combined result is a double iterated filter bank structure, named Contourlet
filter bank, which decomposes image into directional subbands at multiple scales. Due to this cascade structure,
multiscale and directional decomposition stages in the contourlet transform are independent of each other. One
can decompose each scale into any arbitrary power of twos number of directions, and different scales can be
decomposed into different directions. This feature makes contourlet a unique transform that can achieve a high
level of flexibility in decomposition. Figure 2 shows the two-level decomposition structure of Lena image of
size 512 x 512. Contourlet Transform is unique since the number of directional bands could be specified by the
user at any resolution. And smooth contours in image are represented by the combination of both LP and DFB.
Laplacian Pyramid captures the point discontinuities and Directional Filter Bank links these discontinuities into
linear structures.

Figure 1. Block diagram of Contourlet Transform

Vol. 3, No.6, 2011

Figure 2. Two-level Contourlet Decomposition of Lena Image
Let a
o
[n] be the input image. The output after the LP stage is J bandpass images b
j
[n], j=1, 2.J and a
lowpass image a
J
[n]. That means, the j
th
level of the LP decompose the image a
j-1
[n] into a coarser image a
j
[n]
and a detail image b
j
[n]. Each bandpass image b
j
[n] is further decomposed by a
j
l - level DFB into
j
l
2 bandpass
directional images 1 2 ,..... 1 , 0 ], [
,
=
j j
l l
k j
k n c . Laplacian Pyramid is a multiscale decomposition of the L
2
(R
2
)
into series of increasing resolution subspaces which are orthogonal complements of each other as follows:
) ( ) (
0
2 2
j
J j
jo
b V R L
=
= (1)
An l-level directional filter bank generates a local directional basis for ) (
2 2
z l that is composed of the
impulse response of the directional filter banks and their shifts. In Contourlet transform, the directional filter is
applied to the detail subspace
j
b . This results in a decomposition of
j
b into
j
l
2 subspaces at scale 2
j
.

j
j
l
l
k j k j
C b
,
2
0
1
=
= (2)
Directionality and anisotropy are the two key features of a Contourlet transform, which improves the
performance over the separable 2-D wavelet transform. And Contourslets offer a much richer set of directions
and shapes, and thus they are more effective in capturing smooth contours and geometric structures in image.
And two dimensional wavelets lack directionality and are only good at catching point discontinuities, but not the
geometrical smoothness of the contour. The main applications of Contourlet transform includes image
compression, image watermarking, and image denoising and so on.
SVD is based on a theorem from linear algebra which says that a rectangular matrix A can be broken down
into the product of three matrices - an orthogonal matrix U, a diagonal matrix S, and the transpose of an
orthogonal matrix V . If the matrix A is real, then singular values are always real numbers, and U and V are also
real. The singular value decomposition of rectangular matrix A is a decomposition of the form
A
mn
= U
mm
S
mn
V
T
nn
(3)
Or
A = USV
T
(4)
Where U
T
U= I; VV
T
= I; the columns of U are orthonormal eigenvectors of AA
T
, the columns of V are
orthonormal eigenvectors of A
T
A, and S is a diagonal matrix containing the square roots of Eigen values from U
or V in descending order. The singular values
1

2
.
n
0 appears in descending order along with main
diagonal of S.
Similarly, a digital image can be expressed by nonnegative real matrix. Given A is a digital image with NN,
The SVD of A is defined as: A = USV
T
. This matrix can be transformed into three components U, S and V
respectively, where the U and V components are NN real unitary matrices, and the S component is an NN
diagonal matrix with singular value entries which satisfy
1

2
.
n
0. Because singular values in a
digital image that contain intrinsic algebraic image properties are less affected if general image processing is
performed, SVD transform has been used in various digital image processing applications including image
compression, image de-noising and image watermarking and so on.
Vol. 3, No.6, 2011

3. Proposed Watermarking Scheme

Proposed algorithm is divided into two parts: watermark embedding, watermark extraction process along
with calculation of peak signal to noise ratio (PSNR) and normalized correlation coefficient (NCC).

3.1. Watermark Embedding Procedure

Various steps involved in watermark embedding are shown in Figure 3. The embedding procedure is
described as follows:
Step 1: Apply the contourlet transform to the original image: Suppose the original image is I
o
with mn that
should be decomposed in contourlet domain, we obtain the lowpass Subband I
J
and bandpass subbands as
) ,..., 2 , 1 , 2 ,... 1 , 0 (
1
,
J j k d
j j
l l
k j
= =

, (5)
where j is its LP transform level, k is the k
th
bandpass directional subband under the DFB transform of I
J
. In
view of the robustness and invisibility, watermark information is embedded into the lowpass subband in
contourlet domain.
Step 2: Perform the block processing: Segment the lowpass subband I
J
into non-overlapping blocks A
i
of size
w w, i=1, 2... Q, where Q is the number of the blocks.
Step 3: Compute the singular values of each block A
i
by using Singular Value Decomposition (SVD).
Step 4: Embed each watermark bit by modifying the largest singular value in the each block A
i
, according to
the following rules:
a. If watermark bit X
i,j
=1 and [mod (S(i,j), )] 0.25 then the modified singular value S(i,j) is given by
the equation
,
4
3
] mod ) , ( [ ) , ( ) , (
'
o o + = j i S j i S j i S (6)
Where The watermark, denoted by X, and X
i,j
denotes the (i,j)
th
element in X. is the watermark embedding
strength parameter which controls the quality of the watermarked image, S(i,j) denotes the largest singular value
of singular matrix S, and S(i,j) denotes the modified singular value.
b. If watermark bit X
i,j
=1 and [mod (S(i,j), )] < 0.25 then the modified singular value S(i,j) is given by
the equation
,
4
3
] mod )
4
1
) , ( [( ]
4
1
) , ( [ ) , (
'
o o o o + = j i S j i S j i S (7)
c. If watermark bit X
i,j
=0 and [mod (S(i,j), )] 0.75 then the modified singular value S(i,j) is given by
the equation
,
4
1
] mod ) , ( [ ) , ( ) , (
'
o o + = j i S j i S j i S (8)
d. If watermark bit X
i,j
=0 and [mod (S(i,j), )] > 0.75 then the modified singular value S(i,j) is given by
the equation
,
2
1
] mod )
2
1
) , ( [( ]
2
1
) , ( [ ) , (
'
o o o o + + = j i S j i S j i S (9)
Step 5: Compute watermarked block A
i
with the modified singular values S(i,j) using inverse SVD.
Step 6: Reconstruct the watermarked image I
o
from all watermarked blocks using inverse contourlet
transform.
Step 7: Calculation of PSNR: The peak signal to noise ratio (PSNR) is a widely used measure of visual
fidelity between the original image and watermarked image that is defined as following equation.
dB
y x I y x I
N M
PSNR
M
x
N
y
o o
= =

=
1 1
2 '
10
)] , ( ) , ( [
1
255 255
log 10 (10)
Vol. 3, No.6, 2011

Figure 3. Watermark Embedding Algorithm

Where, M and N are the height and width of the image respectively. I
o
(x, y) and I
o
(x, y) are the values

located at coordinates (x,y) of the original image, and the attacked image, respectively. If it is found that the
image quality measured by PSNR among the watermarked image is greater than 40dB indicates that the
proposed watermarking scheme has good fidelity. Meanwhile it seems difficult to distinguish the difference
between the original and the watermarked images by the human eye.

Host image, I
o

Decompose the host image I
o
using Contourlet transform
Embed each watermark bit by modifying the largest singular value in the each block A
i
,
according rule
> = + + =
s = + =
< = + =
> = + =
=
o o o o o o
o o o o
o o o o o o
o o o o
4
3
] mod ) , ( [ 0 ,
2
1
] mod )
2
1
) , ( [( ]
2
1
) , ( [ ) , (
4
3
] mod ) , ( [ 0 ,
4
1
] mod ) , ( [ ) , ( ) , (
4
1
] mod ) , ( [ 1 ,
4
3
] mod )
4
1
) , ( [( ]
4
1
) , ( [ ) , (
4
1
] mod ) , ( [ 1 ,
4
3
] mod ) , ( [ ) , ( ) , (
) , ( '
,
,
,
,
j i S and x if j i S j i S j i S
j i S
j i
j i
j i
j i

Reconstruct the watermarked image I
o
from all watermarked
blocks using inverse contourlet transform.

Calculate the PSNR using watermarked and host images using the formula
dB
y x I y x I
N M
PSNR
M
x
N
y
o o
= =

=
1 1
2 '
10
)] , ( ) , ( [
1
255 255
log 10
Watermarked image I
o

Segment the lowpass subband I
J
into non-overlapping blocks
A
i
of size w w
Compute the singular values S(i,j) of each block A
i
by using
singular value decomposition (SVD).
Compute watermarked block A
i
with the modified singular
values S(i,j) using inverse SVD.

Vol. 3, No.6, 2011
3.2. Watermark Extraction Algorithm

The extraction process is blind with respect to the original image that means it doesnt require the un-
watermarked or original watermark image for extracting the watermark from the watermarked image.
Watermark extraction process is summarized in Figure 4. Steps of watermark extraction algorithm are as
follows:
Step 1: Apply the Contourlet transform to the possibly attacked watermarked image: Suppose the
watermarked image is I
o
that should be decomposed in contourlet domain, we obtain the lowpass subband I
J

with watermark information.
Step 2: Perform the block processing: Segment the lowpass subband I
J
into non-overlapping blocks A
i
of
size w w, i=1, 2... Q, where Q is the number of the blocks.
Step 3: Compute the singular values of each block A
i
by using singular value decomposition.
Step 4: Extract watermark information according to the following equation rules:
a. If [mod (S(i,j), )] > /2, then the extracted watermark bit X
i,j
is equal to 1.
b. If [mod (S(i,j), )] /2, then the extracted watermark bit X
i,j
is equal to 0.
Where S(i,j) denotes the modified largest singular value containing watermark information.
Step 5: Calculation of NCC: Normalized Cross Correlation (NCC) that is defined as following equation is
adopted for evaluating the robustness of the watermarking scheme. Without any image attacks, the NCC value is
1. In other words, the watermark image can be completely extracted.
= =

=
M
i
N
j
j i j i
X X
N M
NCC
1 1
'
, .
1
(11)
Where, M and N are the height and width of the watermark respectively. X
i,j
and X
i,j
are the watermark bits

located at coordinates (i,j) of the original watermark and the extracted watermark.

4. Experimental Results

The host images considered for the experimentation are 512 512 gray scale images with 8 pixel/bits, the 32
32 binary image having the letters ECE was used as watermark image. The test images such as Barbara,
Lena, and Peppers were transformed by contourlet transform using pkva Pyramid filter and pkva directional
filter to obtain two-level decomposition. Number of pyramidal levels is two (2, 3). At each successive level,
number of directional subbands are 5, 8 respectively. The size of blocks w is set to 4 and watermark embedding
strength parameter is set to 114, 105, and 103.5 respectively. PSNR of the proposed method is 42dB. Test
images, binary watermark, and watermarked images are shown in Figure 5. Various attacks like resizing, JPEG,
median filtering, salt &pepper noise, Gaussian low pass filtering, cropping, row column copying, speckle noise,
rotation, and average filtering are used to test the robustness of the proposed watermark.

Vol. 3, No.6, 2011

Figure 4. Watermark Extraction Algorithm

(a) Barbara (b) Lena (c) Peppers

(d) Watermark

Possibly attacked watermarked image I
o

Decompose the Possibly attacked watermarked image I
o

using Contourlet transform

Extract watermark information according to the rule:
If [mod (S(i,j), )] > /2, extracted watermark bit X
i,j
=1,
Otherwise X
i,j
=0.
Calculate the NCC between extracted watermark X
i,j
and
original X
i,j
watermark using the formula
= =

=
m
i
n
j
j i j i
X X
N M
NCC
1 1
'
, .
1

Extracted binary Watermark, X
i,j

Segment the lowpass subband I
J
into non-overlapping
blocks A
i
of size ww (Block processing)
Compute the singular values of each block A
i
by using
singular value decomposition

Vol. 3, No.6, 2011

(e) Watermarked Barbara (f) Watermarked Lena (g) Watermarked Peppers
Figure 5. (a)-(c) Host images, (d) 32 x 32 Binary watermark, (e)-(f) Watermarked images

Table 1 summarizes extracted watermarks from watermarked Lena image after applying various attacks.
Third column and fourth column in the Table 1 shows the extracted watermarks from Shaos method [27] and
proposed method respectively.

Table 1. Extracted Watermarks from Watermarked Lena Image

Attack Attack
parameters
Shaos method
Proposed method

No attack

-------

1.0000

1.0000

JPEG
compression

QF= 20

0.9398

0.9456

JPEG
compression

QF= 30

1.0000

1.0000

Median
filtering

3x3 window

0.9239

0.9363

Average
filter(3x3)

3x3 window

0.8921

0.8815

Gaussian
LPF(0.5)
3x3 kernel, noise
density 0.5

0.8545

0.8678

Salt&peppers
(0.005)

Noise density
0.005

0.9280

0.9448

Gaussian noise
(0, 0.001)

Noise density
0.001

0.9859

1.0000

Cropping

25%

0.5741

0.8119
Row
&coloumn
Copying

10-20, 40-60
copied

0.8780

0.8958

Speckle noise

Noise density
0.001

1.0000

1.0000
Vol. 3, No.6, 2011

Rotation

5 degrees

0.5074

0.7762

Resize

50%

1.0000

1.0000

5. Conclusions

In this paper a novel blind watermarking scheme is proposed that combines the contourlet transform and
SVD method. After decomposing the original image by contourlet domain, SVD is applied to the selected
blocks of the lowpass subband and watermark information is embedded into the singular values. Approximation

subband of the contourlet transform of the host image is used for embedding the binary watermark of size 32 x
32. The embedded information can be extracted without the original image for adopting the quantization
parameters. The experimental results show that the proposed scheme preserves not only the high perceptual
quality, but also is robust against various attack operations. Perceptual quality of the watermarked image is good
and the watermarks can effectively resist JPEG compression attack. The proposed method is more robust in
resisting common attacks such as median filter and Gaussian filter compared to Shaos method.

6. References

[1] Cox I., Kilian J, Leighton F.T,Secure Spread Spectrum watermarking for Multimedia, IEEE Transactions
on Image Processing,1997,vol.6,no.12, pp.1673-1687.
[2] I. J. Cox, M. L. Miller, and J. A. Bloom, Watermarking applications and their properties, Int. Conf. on
Information Technology, Las Vegas, 1-5, 2000.
[3] C.I.Podilchuk and E.J.Delp, Digital Watermarking: Algorithms and Applications, IEEE Signal Processing
Magazine, pp.33-46, July 2001.
[4] I.J.Cox, M.L.Miller, and J.A. Bloom, Digital watermarking, Morgan Kaufmann Publishers, San
Francisco, CA, 2002.
[5] Tao Peining and Eskicioglu Ahmet M, An Adaptive Method for Image Recovery in the DFT Domain,
Journal of Multimedia, Vol.1, No.6, September 2006.
[6] Barni, F. Bartolini, A. Piva .A DCT domain system for robust image watermarking, IEEE Transactions
on Signal Processing, 66, 357-372, 1998.
[7] Chu, W.C, DCT based image watermarking using sub sampling, IEEE Trans Multimedia 5, 34-38, 2003.
[8] M.Barni, M., Bartolini, F., V., Piva, A, Improved wavelet based watermarking through pixel-wise
masking, IEEE Trans Image Processing 10, 783-791, 2001.
[9] Y. Wang, J.F.Doherty and R.E.Van Dyck, A wavelet based watermarking algorithm for ownership
verification of digital images, IEEE Transactions on Image Processing, 11, No.2, pp.77-88, February 2002.
[10] V. I. Gorodetski, L. J. Popyack, V. Samoilov and V. A. Skormin, SVD-based Approach to Transparent
Embedding Data into Digital Images, International Workshop on Mathematical Methods, Models and
Architectures for Computer Network Security (MMMACNS 2001), St. Petersburg, Russia, May 21-23,
2001.
[11] R.Liu, T.Tan, An SVD-based watermarking scheme for protecting rightful ownership, IEEE Trans.
Multimedia, (4),1, pp, 121-128, 2002.
[12] D. V. S. Chandra, Digital Image Watermarking Using Singular Value Decomposition, Proceedings of
45th IEEE Midwest Symposium on Circuits and Systems, Tulsa, OK, pp. 264-267, 2002.
[13] Sun, R., Sun, H., Yao, T, A SVD and quantization based semi-fragile watermarking technique for image
authentication Proc. IEEE International Conf. Signal Processing, 2. 1592-95, 2002.
[14] Chin-Chen Chang, Piyu Tsai, Chia-Chen Lin, SVD based digital image watermarking scheme. Pattern
Recognition Letters 26, 1577-1586, 2005.
[15] S.Srinivas Kumar, B.Chandra Mohan and B.N.Chatterji, An Oblivious Image Watermarking Scheme using
Singular Value Decomposition, IASTED International Conference on Signal and Image Processing
(ICSIP07), Honolulu, Hawaii, USA, August 20-22, 2007.
[16] Chung K,Yang W ,Huang Y, Wu S, Hsu Yu-Chiao, On SVD-based watermarking algorithm Applied
Mathematics and Computation Elsevier, 188, 54-57, 2007.
Vol. 3, No.6, 2011
[17] E.Ganic and A.M.Eskiciougulu, Secure DWT-SVD Domain Image Wtermarking: Embedding Data in All
Frequencies, ACM Multimedia and Security Workshop 2004, Magdeburg, Germany, September 20-21,
2004.
[18] Jieh-Ming Shieh, Der-Chyuan Lou and Ming-Chang Chang, A semi-blind digital watermarking scheme
based on singular value decomposition, Computer Standards and Interfaces 28, 428-440, 2006.
[19] Ganic E, Zubair N, Eskicioglu AM. An optimum watermarking scheme based on singular value
decomposition, International Conference on Communication Network and Information Security,
Uniondale, Ny, p.85-90, 2003.
[20] A. Skodras, C. Christopoulos, and T. Ebrahimi, The JPEG 2000 still image Compression standard, IEEE
Signal Processing Magazine, vol. 18, pp. 3658, Sep. 2001.
[21] P. Meerwald and A. Uhl, A survey of Wavelet -domain watermarking algorithms, in Proceedings
of SPIE, Electronic Imaging, Security and Watermarking of Multimedia Contents , January 2001,
vol. 4314.
[22] E. J. Cand`es and D. L. Donoho, Curvelets a surprisingly effective non adaptive representation for
objects with edges, in Curve and Surface Fitting, A. Cohen, C. Rabut, and L. L. Schumacher, Eds. Saint-
Malo: Vanderbilt University Press, 1999.
[23] M. N. Do and M. Vetterli, The Contourlet transform: an efficient directional multiresolution image
representation, IEEE Transactions Image on Processing, vol. 14, no. 12, pp. 2091-2106, Dec. 2005.
[24] F.Huang and Z.HGuan,A hybrid SVD-DCT watermarking method based on LPSNR,Pattern Recognition
Letters,2004,vol.25,no.15, pp.1769-1775.
[25] Xianhai Zhang and Yongtian Yang,A geometric distortion resilient image watermark algorithm based on
DFT-SVD,Computer Engineering 2006,vol.32,no.18,pp.120-122(in Chinese).
[26] Emir Ganic and Ahmet M. Eskicioglu,Robust DWT-SVD Domain Image Watermarking: Embedding Data
in All Frequencies,Proc.2004ACM Multimedia and Security Workshop,Magdeburg,
Germany,2004,pp.166-174.
[27] Shao-min Zhu and Jian-ming Liu, A Novel Blind Watermarking Scheme in Contourlet Domain Based on
Singular Value Decomposition, IEEE Second International Workshop on Knowledge Discovery and Data
Mining, 2009.

Authors Profile

J. Chandrasekhar Rao was born in India, A.P in 1985. He received his B. Tech, M.Tech
degrees in ECE. He is currently working as Assistant professor in ECE department of K L
University. He has 3 national and one International conference paper, and one international
journal paper. His research interests include image processing, satellite communications, and
antennas.

K.Ujwal Deep was born in India, A.P, in 1986. He received his B.Tech degree from J.NT.U,
A.P, India in 2007AND M.Tech degree from S.R.M.University, Chennai ,Tamilnadu in 2010.
He is working as Assistant Professor in Electronics and Communications Department in
K.L.University since june 2010. His research interests include wireless Communications,
Digital Communications and Error Control Coding.

Vol. 3, No.6, 2011

Suneel Mudunuru was born in Vijayawada, Krishna (Dist.), AP, India. He received B.E in
Electronics & Communication Engineering from S.R.K.R.Engineering College,
Bhimavaram, AP, India and M.Tech from Nalanda Institute of Engineering and Technology,
Sattenapalli, Guntur, AP, India. He is working as Assistant Professor in Department of
Electronics & Communication Engineering, K L University, Vijayawada, AP, India. He has
published one International Journal and presented one paper in International Conference.

G.Mary Silvya was born in India, A.P, in 1986. She received her B.Tech degree from J.NT.U,
A.P, India in 2007AND M.Tech degree from S.R.M.University, Chennai ,Tamilnadu in 2010.
She is working as Assistant Professor in Electronics and Communications Department in
K.L.University since june 2010. Her research interests include wireless Communications, Data
Communications.


Paper 3

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Paper 3

Uploaded by

Copyright:

Available Formats

International Journal of Advances in Science and Technology,

Vol. 3, No.6, 2011

(x, y) are the values

are the watermark bits

You might also like