Digital Watermarking Technique for Protecting Digital Images

Munesh Chandra
"
, Shikha Pandel, Rama Chaudha
a
I.M.S, Ghaziabad,
b
R.K.G. I.T, Ghaziabad
a
,
b
Ghaziabad, India
munesh. trivedi@gmail.com
Abstract-Internet evolution, along with the advancement of
digital multimedia tools have create a major impact in
making the storage and distribution of multimedia content a
straightforward tasks. Thus security of multimedia contents
becomes a vital issue and there is a need in protecting the
digital content against counterfeiting, piracy and malicious
manipulations. Digital watermarking is an evolving feld
that requires continuous effort to fnd for the best possible
method in protecting multimedia content.
In this paper, we describe overview of digital image
watermarking technique and proposed an algorithm for
copy write protection of digital images in neT domain.
Digital watermarking can be defned as the process of
embedding a certain piece of information ,technically known
as watermark into multimedia content including text
documents , images, audio or video streams, such that the
watermark can detected or extracted later to make an
assertion about the data. We have also implemented this
algorithm using MATLAB 7.x and code is also given in this
paper.
cJw0rd5: Igl0 m0gc w0lcrm0rkng, 5prc0d-5pcclrum
lcchnuc5, c0pJ HrlcIr0lccl0n
I. INTRODUCTION
The recent growth of networked multimedia systems
has increased the need for the protection of digital media.
This is particularly important for the protection and
enforcement of intellectual property rights. Digital media
includes text, digital audio, images, video ad sofware.
Many approaches are available for protecting digital data;
these include encryption, authentication and time stamping.
One way to improve one's claim of ownership over an
image, for instance, is to place a low-level signal directly
into the image data. This signal, known as a digital
watermark, uniquely identifes the owner and can be
easily extracted from the image.
Digital watermarking technology is an emerging feld
in computer science, cryptography, signal processing and
communications. Digital Watermarking [4, 5, 6] is
intended by its developers as the solution
to the need to provide value added protection on top of
data encryption and scrambling for content protection.
Like other technology under development [7, 8], digital
watermarking raises a number of essential questions as
follows.

What is it?

How can a digital watermark be inserted or detected?
V7-1-4Z44-4-V/1/5Zb.!Z1IIII

How robust does it need to be?

Why and when are digital watermarks necessary?

What ca watermarks achieve or fail to achieve?

How should digital watermarks be used?

How ca we evaluate the technology?

How usefl are they, that is, what can they do for content
protection in addition to or in conjunction with current
copyright laws or the legal and judicial means used to
resolve copyright grievances?

What are the business opportunities?

What roles can digital watermarking play in the content
protection infrastructure?
In this paper we present algorithms for image
authentication and forger prevention known as watermarks.
Figue 1 shows the block diagram for watermaking digital
images.
Original
Image
Watermark
Watermarked
Image
Figure 1: Block Diagram of Watermarking Algorithm
H. Types of Digital Watermark
Watermarks and watermarking techniques can be divided
into various categories in vaious ways. The watermaks can
be applied in spatial domain. F alterative to spatial domain
watermaking is frequency domain watermarking. It has been
pointed out that the frequency domain methods are more
robust than the spatial domain techniques. Different types of
watermaks are shown in the Figure 2.
ZZb
I
Watermarking
|
According to
Working
D
J
main
According
to Type of
Document
According to
Human
Perception
According to
APprcation
|
Spatial
Domain

Frequency
Domain
|
--
Source
Based
I
Destination
Based
Text Image Audio Video
"rbI,
Dual
Robust Fragile
Figure 2: Types of watermarking techniques
Watermarking techniques can be divided into four
categories according to the type of document to be
watermarked as follows.

Image Watermarking

Video Watermarking

Audio Watermarking

Text Watermarking
According to the human perception, the digital
watermarks can be divided into three diferent types as
follows.

Visible watermark

Invisible-Robust watermark

Invisible-Fragile watermark

And one anoter type called Dual watermark
Visible watermak is a secondary translucent overlaid
into the primary image. The watermark appears visible to a
casual viewer on a carefl inspection. The invisible-robust
watermark is embedded in such a way that alterations made
to the pixel value are perceptually not noticed and it can be
recovered only with appropriate decoding mechaism. The
invisible-fragile watermark is embedded in such a way that
any manipulation or modifcation of the image would alter
or destroy the watermark. Dual watermark is a combination
of a visible and an invisible watermark [1]. In this type of
wate

ark an invisible watermark is used as a back up for

the vIsIble watermark as clear from the following diagram.
OriginaI
1
Visible
Visible
Invisible
Dual
Watermarked
Watermarked
lmagc
r Watermarking
Image (I')
Watermarking
Image (I'')
Figure 3: Schematic representation of dual watermarking
ZZ1
From application point of view digital watermark could be
as below.

souce based or

destination based.
Source-based watermark are desirable for ownership
identifcation or authentication where a uique watermark
identifing the owner is introduced to all the copies of a
paticular image being distributed. A source-based
watermark could be used for authentication and to determine
whether a received image or other electronic data has been
tampered with. The watermark could also be destination
based where each distributed copy gets a unique watermark
identifing the particular buyer. The destination -based
watermark could be used to trace the buyer in the case of
illegal reselling.
II. CURRENT STATE OF ART
Watermarking is the process that embeds data called a
watermak or digital signature or tag or label into a
multimedia object such that watermak ca be detected or
extracted later to make an assertion about the object. The
object
.

ay be an image or audio or video. A simple example

of a digItal watermak would be a visible" seal" placed over
a image to identif the copyright. However the watermark
might contain additional information including the identity
of the purchaser of a particular copy of the material.
In general, any watermarking scheme (algorithm) consists
of three pats.

The watermark.

The encoder (insertion algorithm).

The decoder and comparator (verifcation or extraction
or detection algorithm).
Each owner has a uique watermark or a owner can
also put different watermarks in different objects the
marking algorithm incororates the waterak into the
object. The verifcation algorithm authenticates the object
determining both the owner and the integrity of the object.
H. Embedding Prcess
Let us denote an image by 1, a signature by S S/, S2, ...
and the watermarked image by 1. L tS an encoder function, it
takes an image 1 and a signature S, and it generates new
image which is called watermarked imagel, mathematically,
1 (l, S) |J
It should be noted that the signature S may be dependent
on image In such cases, the encoding process described by
Eqn.l still holds. Following fgure illustrates the encoding
process.
n000cr I
Watermarked
Original
.| '
L
I I
Image (I)
Image (I')
i
Signature(S)
Figure 4: Encoder
D. Extraction Prcess
A decoder fnction D takes an image J (J can be a
watermarked or un-watermarked image, and possibly
corrupted) whose ownership is to be determined and
recovers a signature S I from the image. In this process an
additional image I can also be included which is ofen te
original and u-watermaked version of J. This is due to the
fact that some encoding schemes may make use of the
original images in the watermaking process to provide extra
robustess against intentional and uintentional corruption
of pixels. Mathematically,
D (JI)=S'
(2)
The extracted signature S I will then be compared with
the owner signature sequence by a comparator fction C"
and a binar outut decision generated. It is 1 if there is
match and 0 otherwise, which can be represented as follows.
{ :ll P
C/S'S)
'`
Where C is the correlator, x= C,(S', S. c is the
correlation of two signatures and is certain threshold.
Without loss of generality, watermarking scheme can be
treated as a three-tupple (E, D, C,). Following fgures
demonstrate the decoder and the compaator.
ZZd
Dccodcr
Test Image(J)
Original Image(l)
Comraraor
Extracted
Signature(S')
Extracted
Signature(S')
Original
Signature(S)
Figure 5: Decoder
Original Signature(S)
Figure 6: Comparator
Comnaraor
x
A watermark must be detectable or extractable to be
usefl. Depending on the way the watermark is inserted and
depending on the nature of the watermarking algorithm, the
method used can involve very distinct approaches. In some
watermarking schemes, a watermark ca be extacted in its
exact form, a procedue we call watermark extraction. In
other cases, we can detect only whether a specifc given
watermarking signal is present in an image, a procedure we
call watermark detection. It should be noted that watermark
extraction can prove ownership whereas watermark
detection ca only verif ownership.
C C. A spread spectrum watermark embedded in
the OCT domain
A frequency domain method for digital watermarking of
images proposed in [2] is also based on the idea of spread
spectrum communications. The technique is motivated by
both perceptual tanspaency and watermark robustness. The
published results show that the technique is very effective
both in terms of trasparency, robustess to signal
processing, and attempts to remove the watermark. The
types of image distortions to which technique is robust
include cropping, very low data rate JEG compression,
printing and rescanning, as well as collusion with several
independently watermarked images. One of the signifcant
contributions in this work is the realization that the
watermark should be inserted in the perceptually signifcant
portion of the image in order to be robust.
The watermark W is a sequence of normally distributed,
zero-mean unit-variance radom numbers. A DCT is
performed on the entire image and W is inserted in a
predetermined range of low frequency components minus
the DC component as follows. Let X be the original image,
Y be the watermarked image, and XD and YD be the DCT
coefcients of X and Y respectively. The coefcients can be
ordered according to the zigzag patter used in JEG. Let
Xdi and Ydi be the i
th
DCT coefcient in XD and YD
respectively. W(i) is the i
th
element in the watermark
sequence; a is a scale factor which prevents unreasonable
values for Y D(i). The marking is then performed:
Ydi) = XD()(1+aW (4)
Alterate equations that incororate W into XD are listed
in [2]. Inversely transforming YD to form Y completes the
marking procedure. Figure 7 shows an original image (upper
lef), marked with a = 0.1, 0.5 and 1.0 respectively. The
authors propose an empirically derived value of 0.1 for a.
The frst step of the verifcation procedure is to obtain a
copy of W from a possibly forged image Z ZD is the vector
of Z's DCT coefcients. W

is the extracted version o( U
W(i) - (D (i) -1]
(5)
a Xp ,t)
A measure of similarity betweer W and W is computed as
follows:

w - -

(6)
If a image has not been watermarked with W, S is
distributed as a zero mean random variable. If H differs
only slightly from W (i.e. W is indeed present in Z, although
slightly altered), then E[S] O. A hypothesis test on S
determines if W is present in the image. This technique
accommodates multiple watermarks, and withstands a much
wider range of attacks than the transparency-only based
spatial techniques.
This algorithm is one of the earliest attempts at providing
some image adaptability in the watermark embedding
scheme. This is due to the fact that the watermark strength
depends on the intensity value of the DCT coefcients of
the original image. In this way, the watermark signal can be
quite strong in the DCT values with large intensity values,
and is attenuated in the areas with small DCT values. This
provides a watermark signal that is quite robust and for
most images, transparent. However, because the DCT
transform in this scheme is based on the whole image rather
than the usual block-based approach commonly found in
image and video compression schemes, the transform does
not allow for any local spatial control of the watermark
insertion process. In other words, the addition of a
watermark value to one DCT coefcient affects the entire
image; there is no mechanism for local spatial control in
this particular framework. This scheme may beneft from a
perceptual model that determines the optimal weights for
the DCT coefcients, but the framework needs to be
modifed in order to get fner control of watermark
adaptability to image characteristics and the human visual
system.
ZZJ
Another global method also modulates DCT coefcients,
but uses a one-dimensional bipolar binary sequence for W
[3]. The DCT of the original image is frst obtained. The
marking procedure consists of sorting the DCT coefcients
according to their absolute magnitude. The owner then
defnes a percentage of total energy, P, and identifes the
largest n coefcients that make up P percent of the total
energy. The watermark sequence is then added to all the AC
coefcients in this list. For all i such that XD(i is one of the
selected coefcients,
YD
()
= Xdi) + W (i) (7)
A larger P increases the number of elements of W that
can be embedded in X but increases the chance that W will
be perceptible. W and the list of selected coefcients must
be kept secret. The verifcation procedure frst extracts W

from the marked coefcients in ZD:
|'
=
Z
D
() - X
D
()
(8)
A procedure similar to [2] can then verif W
*
. Note that
[2] and [3] both require X to extract the watermark. A
procedure similar to [2] can then verif H. Note that [2] and
[3] both require X to extract the watermark.
Figure . Example ODCT-spread spectrum technique
III. PROPOSED WORK
Visible watermarking is a type of digital watermarking
used for protection of publicly available images. In this
paper, I have described visible watermarking scheme in the
DCT domain. A mathematical model has been developed for
that purose. An algorithm based on DCT domain has been
proposed to make the watermark more robust.
The main task of this work has performed into following
steps:

At the frst step, the requirements, techniques ad
applications of digital watermarking for high-quality
images are addressed.

Second, is to implement the algorithm using the tool
(i.e. Mat Lab) for embedding the watermark into
original image in DCT domain.

Then the extraction of watermark will also be
implemented. With this, the comparison of original
watermark and extracted watermark is also being
shown.

The measurement of quality of an image is also
concered with this work.
H. Implementation of Work
We proposed an algorithm with the application of DCT
based as described in II.C3, but the signifcant difference is
that here we consider the embedding of random PN
sequences into the mid-band components of the DCT -block.
This provides a watermark signal that is quite robust and for
most images, transparent. The watermark embedding steps
of this technique are as follows:

Set gain factor (K) for embedding process.

Set the DCT block size.

Perform search to fnd highly uncorrelated PN
sequences (T, F).

Defnes the mid-band frequencies of an 8x8 DCT.

Determine size of original image.

Determine size of watermark image.

Reshape the message to a vector.

Pad the message out to the maximum message size
with 1 'so

Generate shell of watermarked image.

Generate PN sequences for "1" and "0"

Process the image in blocks.

Transform block using DCT.

If message bit contains zero then embed PN-sequence
zero into the mid-band components of the DCT -block.

Otherwise, embed PN-sequence-one into the mid-band
components ofDCT-block.

Transform block back into spatial domain.

Move on to next block. At end of row move to next
row.

Convert to uint8 and write the watermarked image out
to a fle

Display processing time.

Display watermarked image.
D. Experimental Analysis and Results
In this section, we show some experimental results to
demonstrate the effectiveness and success of our digital
watermarking technique for the embedding ad extraction of
watermark image with the original (digital) image in DCT
domain.
The standard 512 x 512-pixels grayscale image "Lena"
is used as the sample of the test image, as shown in Figure 8.
The 64 x 64-pixels grayscale image "Dmg-l" is used as the
sample of the watermark image, as shown in Figure 9. The
outcome of the watermarked image is shown in Figure 10.
ZoU
Figure b. Original image OLena
MCK
Figure V. Watermark image
Figure . Watermarked image OLena
We applied the peak-signal to noise rate (PSNR) to
measure the image quality of an attacked image. The
equation of PSNR is described as:
ISNR10/og,,(:)d ()
On the other hand, the mean square error (MSE) of an
image with H x W pixels is defned as
^ H ( -2
L
HX;+ 1+)=1 aU-al } )
(10)
Where is the original pixel value and 3j is the
processed pixel value. Besides, we utilized the accuracy rate
AR to evaluate the robustness of a copyright protection
scheme for a specifc attack. The accuracy rate / is
defned as
CF
H

(11)
Where NP is the number of pixels of the watermark
image and CP is the number of correct pixels in the
watermark image that is retrieved from the attacked image.
The experimental results are represented in the following,
respectively for watermarked image and extracted
watermark image as shown in Figurel1 (i) and (ii), while
taking te different values of gain factor And various
observations for experiment are depicted m table1.
1
-
lICK
Figure . (i) Watermarked image,
(ii) Extracted watermark image
TABLE 1
The qualit rates uder various executions
Gain Lxecutien Accuracy P5NR
Facter(K) Time Rate
K=10 2.7344 78.1250 53.8851
K=20 2.7656 85.9375 55.5562
K=40 2.7969 98.4375 58.4224
K=50 2.7500 98.7375 59.2029
I K=70 I 2.7813 100 I 84.2544 I
o1
| MA !LUCode for Prposed Algorithms
Code for Embedding Watermark in DCT domain
clear all;
start _ time=cputime;
k70;
blocksize=8;
pn _sequence _ search='T';
midband=[ 0,0,0,1,1,1,1,0;
0,0,1,1,1,1,0,0;
0,1,1,1,1,0,0,0;
1,1,1,1,0,0,0,0;
1,1,1,0,0,0,0,0;
1,1,0,0,0,0,0,0;
1,0,0,0,0,0,0,0;
0,0,0,0,0,0,0,0 ];
sum(sum(midband));
[flename 1 ,pathname ]=uigetfle('*. *, ,'select the image');
fgure(1);
original_image=imread(num2str(flenamel));
imshow(original_image,[]);
title('Original Image')
H=size( original_image, 1 );
W=size( originaUmage,2);
length _ o=H*W l(blocksize/2);
fle_name='dmgl.tif;
message=double(imread(fle _name));
Hw=size(message, I);
Ww=size(message,2);
message=roud(reshape(message,Hw*Ww, I));
length _ w=length(message);
if (length _ w > length _ o)
eror('Message too large to ft in original Object')
end
message _ vectorones( 1 ,length _ o);
message _ vector(1 : length _ w)=message;
length2=length(message _vector);
watermarked _image=originaUmage;
pn _sequence _ one=roud(2 * (rand(1 ,sum( sum(midband)))-
0.5));
pn _sequence _ zero=roud(2 * (rand(1 ,sum( sum( midband)))-
0.5));
if (pn _sequence _ search=='T')
while( corr2(pn _sequence _ one,pn _sequence_zero) > -0.5 5)
pn _sequence _ one=round(2 *( rand( 1 ,sum( sum( midband)))-
0.5));
pn _sequence _ zero=round(2 * (rand( 1 ,sum( sum( midband)))-
0.5));
end end
x=I;y=I;
for (k= 1 :length2)
dct_ block=dct2( original_image(y:y+blocksize
I,x:x+blocksize-l ));
1=1;
if (message _ vector(kk )==0)
for i=l:blocksize
for j= 1 :blocksize
if (midbandG,i)== 1)
dct_ blockG ,i)=dct_ blockG ,i)+k*pn _sequence _ zero(1);
1=1+ 1;
end end end
else
for i=1 :blocksize
for j= 1 :blocksize
if (midbandG,i)==I)
dct_blockG,i)=dct_blockG,i)+k*pn_sequence_one(l);
1=1+ 1;
end end end end
watermarked _image(y:y+blocksize-l ,x:x+blocksize-
1 )=idct2( dct_ block);
if (x+blocksize) >= W
x=l;
y=y+b locksize;
else
x=x+blocksize;
end
end
watermarked_image _ int=uint8( watermarked_image);
imwrite(watermarked _image _int,'dct2 _watermarked _ mod.j
pg',Jpg');
elapsed _ time=cputime-start_ time,
fgure(2);
imshow( watermarked_image _ int,[]);
title(,Watermarked Image');
Code for watermark Extraction in DCT domain
clear all;
start _ time=cputime;
blocksize=8;
pn _sequence _ search='T';
midband=[O,O,O,I,I,I,I,O;
0,0,1,1,1,1,0,0;
0,1,1,1,1,0,0,0;
1,1,1,1,0,0,0,0;
1,1,1,0,0,0,0,0;
1,1,0,0,0,0,0,0;
1,0,0,0,0,0,0,0;
0,0,0,0,0,0,0,0 ];
fle _ name='dct2 _watermarked _ mod.jpg';
watermarked _ image=double( imread( fle_name));
H=size( watermarked_image, 1 );
W=size(watermarked _image,2);
max _ message=H*W /(blocksizeI2);
fle _ name=' dmg 1. tif;
orig_ watermarkdouble(imread(fle _name));
Mo=size( orig_ watermark, 1);
No=size( orig_ watermark,2);
pn _sequence _ one=round(2 * (rand(1 ,sum( sum( midband)))-
0.5));
ZoZ
pn _sequence _ zero=round(2 * (rand(1 ,sum( sum( midband)))-
0.5));
if (pn _sequence _ search=='T')
while( cor2(pn _sequence _ one,pn _sequence_zero) < -0.55)
pn _sequence _ one=roud(2 *( rand( 1 ,sum( sum( midband)))-
0.5));
pn _sequence _ zero=round(2 * (rand( 1 ,sum( sum( midband)))-
0.5));
end end
x=l;
y=1;
for (kk = 1 :max _message)
dct_ block=dct2( watermarked _ image(y:y+blocksize-
1 ,x:x+blocksize-l));
coeffcients
1=1;
for i=1 :blocksize
for j=1 :blocksize
if (midbandG ,i)== 1 )
sequence(l)=dct_ blockG,i);
end end end
1=1+1;
cor _ one(kk)=cor2(pn _sequence _ one, sequence );
cor _ zero(kk )=corr2(pn _sequence _ zero, sequence );
if cor _ zero(kk) > cor _ one(kk)
message _ vector(kk)=O;
else
message _ vector(kk)= 1;
end
if (x+blocksize) >= W
x=l;
y=y+blocksize;
else
x=x+blocksize;
end end
message=reshape( message_vector
(1 :Mo*No ),Mo,No);
elapsed _ time=cputime-start _time,
fgure(2)
imshow( message, [])
title('Recovered Message')
X =imread(' dmg 1. tif);
Y=message;
Acc _rate(X,Y);
psnr=psnrl(X,Y,Mo,No);
Code for Accuracy Rate
fction [d]=AccJate(X,Y)
X=double(X);
Y=double(Y);
%X=imread('dmgl.tif);
%Y =imread('message.jpg');
Hl=size(X,I);
WI =size(X,2);
H2=size(Y,I);
W2=size(Y,2);
np=O;
npl=O;
np2=0;
np3=0;
count_ 0r0;
count_ Ex=O;
for i= I:HI
if (X(i= I)
np=np+l;
else
np=np;
end
for j = I:WI
if (XG=I)
npl=npl+l;
else
npl=npl;
end end end
count_ Ornp+np I;
for i= I:H2
if (Y(i=l)
np2=np2+1;
else
np2=np2;
end
for j = I:W2
if (YG=I)
np3=np3+1;
else
np3=np3;
end
end
end
count_ Ex=np2+np3;
A(count_ Excount_ Or)* 100
Code for PSNRjnction
fnction [B] = psnr(image,imagerime,M,N)
image=double(image );
image rime=double(image rime);
if ((sum(sum(image-imagerime))) == 0)
eror('lnput vectors must not be identical')
else
psnr _ num=M*N;
psnr _ den=sum( sum( (image-image rime )."2));
A=psnr _ den/psnr _ num;
B=IO*loglO(255."2/A); end
Ret
Code for comparator
Z33
X =imread('lena.jpg');
Y= imread('dct2 _watermarked _ mod.jpg');
I =corr2(X, Y)
I1=std2(I)
IV. CONCLUSION
We have described recent developments in the digital
watermarking of images in which the watermarking
technique is invisible and designed to exploit some aspects
of the human visual system. Many of these techniques rely
either on tanspaency (low-amplitude) or fequency
sensitivity to ensure the mark's invisibility. Watermaks that
ae image adaptive use visual models to locally maximize
the amplitude of the embedded watermark, while
maintaining the watermark's imperceptibility. This type of
algorithm has been shown to be more robust to many attacks
based on linea and nonlinear signal processing operations.
The protection of intellectual property rights is perhaps one
of the last major barriers to the " digital world." While the
techniques presented in this paper are not foolproof, they can
help validate claims of ownership that are required for
intellectual property law enforcement.
REFERENCE
[1] S.P. Mohanty, et aI., "A Dual Watenng Technique for Images",
Proc. 7th ACM Interational Multimedia Conference, ACM-MM'99,
Part 2, pp. 49-51, Orlando, USA, Oct. 1999.
[2] I. Cox, J. Kilian, F. T. Leighton, and T. Shamoon, "Secure spread
spectrum watenarking for multimedia," IEEE Transactions on
Image Processing, vol. 6, no. 12, December, 1997, pp. 1673-1687.
[3] F. M. Boland, J. J. K. Ruanaidh and C. Dautzenberg,
"Watenarking digital images for copyright prtection," Proceedings
of the Interational Conference on Image Processing and its
Applications, Edinburgh, Scotland, July 1995, pp. 321-326.
[4] R. B. Wolfgang and E. J. Delp, "Overview of image security
techniques with applications in multimedia systems," Proceedings of
the SPIE Interational Conference on Multimedia Networks: Security,
Displays, Teninals, and Gateways, November 4-5, 1997, Dallas,
Texas, vol. 3228, pp. 297-308.
[5] M. D. Swanson, M. Kobayashi, and A. H. Tewfk, "Multimedia data
embedding and watenarking technologies," to appear in
Proceedings of the IEEE, 1998.
[6] I. J. Cox and M. L. Miller, "A review of watenarking and the
importance of perceptual modeling," Proceedings of the SPIE
Interational Conference on Human Vision and Electronic Imaging II,
Feb. 10-13, 1997, San Jose, CA, USA, pp. 92-99.
[7] M. Kutter and F. Hartung, "Image watenarking techniques," to
appea in Proceedings of the IEEE, Special Issue on Identifcation
and Protection of Multimedia Infonation, 1999.
[8] I. J. Cox, "Spread-spectrum techniques for image watenarking," to
appear in Proceedings of the IEEE, Special Issue on Identifcation
and Protection of Multimedia Infonation, 1999.
|"
Yusnita Yusof and Othman O. Khalifa. "Digital Watenarking for
Digital Images Using Wavelet Transfonation" appear in prceeding
of the IEEE pp.665-669, April -2007