PROJECT REVIEW

Digital Watermarking and Steganography

BCI3005 (Slot : F2+TF2)

Submitted by

MAHTAB KAUR SAHI (16BCI0161)

DIVYANSHU NANDWANI (16BCI0127)
KUMOD ARYA (16BCI0172)
SIDDHARTH RAMRAKHIANI (16BCE0715)

on the topic

Implementing Watermarking in Images using DWT in Matlab

done under the guidance

of

Prof. Thenmozhi T
1. Abstract
Watermarking in images possesses
a wide range of applications in
today’s age of technology.
• Data authentication
• Fingerprinting
• Broadcast monitoring
• Owner identification
• Copy protection
• Medical applications
The above listed applications are
quite commonly used and are very
relevant to the current digital
security methodologies. We would
like to implement statistically
undetectable/invisible
watermarking as the first step of
learning how these applications are
carried out, so we are able to
correctly understand where we
stand currently in cyber security
methods and safety mechanisms.
Studying the existing vulnerabilities
and can contribute to the field of
security by improving upon or
creating new methods to
continuously progress in the
grounds of security systems.
2. Introduction
The headway of the Internet has
brought about numerous new open
doors for the creation and
conveyance of substance in
computerized frame. Applications
incorporate electronic publicizing,
continuous video and sound
conveyance, advanced vaults and
libraries, and Web distributing. In
any case, the vital inquiry that
emerges in these applications is the
information security. It has been
seen that current copyright laws are
not adequate for managing
advanced information.
Consequently the insurance and
requirement of protected innovation
rights for computerized media has
turned into a significant issue. This
has prompted an enthusiasm
towards growing new duplicate
prevention and assurance systems.
One such exertion that has been
drawing in expanding interest
depends on advanced watermarking
systems. As steganography give
careful consideration towards the
level of intangibility, watermarking
pay the vast majority of its ascribes
to the vigor of the message and its
capacity to withstand assaults of
evacuation, for example, picture
tasks (revolution, trimming,
separating) and so on in the event of
pictures being watermarked.
Advanced watermarking is the way
toward installing data into
computerized sight and sound
substance with the end goal that the
data (which we call the watermark)
can later be removed or recognized
for an assortment of purposes
including duplicate avoidance and
control. Advanced watermarking
has turned into a functioning and
 vital territory of research, and
improvement and
commercialization of watermarking
methods is being considered
fundamental to help address a
portion of the difficulties looked by
the fast multiplication of
computerized content.
3. Digital Watermarking
The fundamental motivation behind
both cryptography and
steganography is to give mystery
correspondence. In any case, they
are not same. Cryptography
conceals the substance of a mystery
message from noxious individuals,
where as steganography even hide
the presence of the message. Be that
as it may, another rising innovation
known as computerized
watermarking includes the thoughts
and speculations of various subject
inclusion, for example, flag
handling, cryptography, likelihood
hypothesis what's more, stochastic
hypothesis, organize innovation,
calculation plan, and different
procedures. Advanced
watermarking shrouds the copyright
data into the computerized
information through certain
calculation. The mystery data to be
implanted can be some content,
creator's sequential number,
organization logo, pictures with
some unique significance. This
mystery data is inserted to the
computerized information (pictures,
sound, and video) to guarantee the
security, information verification,
recognizable proof of proprietor and
copyright security. The watermark
can be covered up in the
computerized information either
obviously or undetectably. For a
solid watermark implanting, a great
watermarking method is should
have been connected. Watermark
can be inserted either in spatial or
recurrence area. Both the spaces are
extraordinary and have their very
own advantages and disadvantages
and are utilized in diverse situation.
4. Applications
Communicated Monitoring
Sponsors need to guarantee that
they get the majority of the
broadcast appointment which they
buy from supporters. A
nontechnical technique in which
human perception is utilized to
watch the communicate and check
the inventiveness by observing or
hearing is a blunder inclined and
exorbitant. In this way, there ought
to be an auto-recognizable proof
framework, which may store the
recognizable proof codes to the
communicate. There are a few
systems like cryptography that store
the recognizable proof code in the
document header however the
information is probably not going to
endure any kind of adjustments
even arrangement change.
Watermarking is clearly an
appropriate procedure for data
observing. The Watermark exists
inside the substance and is good
with the introduced base of
communicated gear. Despite the
fact that, implanting the ID code is
extremely entangled contrasted
with the cryptography where the
code is set in the document header.
Additionally, it likewise, influences
the visual nature of the work. All
things considered, numerous
organizations secure their
communicates through
watermarking systems.
Possession Assertion
A legitimate proprietor can recover
the watermark from computerized
content to demonstrate his
proprietorship. There are
confinements with literary
copyright sees, as they are
effortlessly removable. Copyright
see imprinted on the physical
archive can't be replicated alongside
the advanced substance. Despite the
fact that, it is conceivable that
content copyright can be set in an
insignificant place of the record to
make them inconspicuous.
Indistinct and indistinguishable
watermark is the best arrangement
as contrasted with the content stamp
for proprietor recognizable proof.
The watermark is not just utilized
for recognizable proof of the
copyright proprietorship however
for demonstrating the responsibility
for archive also. The possession can
be done by removing the inserted
data from the watermarked report.
Exchange Tracking
Exchange following is regularly
considered fingerprinting, where
each duplicate of the work is
remarkably recognized, like the
unique mark that distinguishes a
person. The watermark may record
the beneficiary for each legitimate
dispersion of the work. The
proprietor installs diverse
watermarks in each duplicate. On
the off chance that the work is
abused at that point will the
proprietor have the capacity to
discover the swindler? Noticeable
watermarking is received for
exchange following yet
undetectable watermarking is vastly
improved. For instance, in motion
picture making, the day by day
recordings (additionally called
dailies) are conveyed to the people
who are worried about the motion
picture. Some of the time, the
recordings are unveiled to the press,
so the studios utilize unmistakable
content on corner of the screen,
which recognizes the duplicate of
dailies. In this manner, the
watermark is favored as the content
can without much of a stretch be
expelled.
Content Authentication
The technique to affirm the honesty
of watermarked information and to
ensure that the information isn't
being messed with i.e.
demonstration of building up or
affirming whether picture is bona
fide or not. The term verification
has a broad scope of implications.
For example, a specialist that
chooses whether a segment of
craftsmanship is credible or not, can
a client see or download it? At long
last, the choice is to whether the
substance of a question is remaining
flawless or not after its transmission
on the web. Numerous social
associations invest energy and
contributing cash on new advances
of picture documentation and
computerized libraries development
and so on. In the meantime, these
associations can ensure the
genuineness of the bits of
workmanship they have, since they
have both the proprietorship and the
specialist feelings. At the point
when these works of craftsmanship
are digitized and distributed on the
web, various issues happen.
Typically, a few advanced pictures
found on the web have numerous
distinctions, and yet putting on a
show to speak to the same bit of
craftsmanship. Utilization of
watermarking identified with
verification contains confided in
cameras, video observation and
remote detecting applications,
advanced protection guarantee
proof, journalistic photography, and
computerized rights administration
frameworks. Economically, its
applications are required to develop
as does the uses of computerized
content, for instance, GeoVision's
GV-Series advanced video
recorders for computerized video
reconnaissance to forestall altering.
The computerized work can without
much of a stretch be altered by
utilizing PC assets. A answer for the
alter recognition is watermarking,
where the validation stamp
(watermark) can't remain with the
work after scarcest alteration. On
the other hand, the framework does
not make a difference that the work
is packed or noteworthy changes are
made. This leads toward semi-
delicate watermarking where the
framework endure the neighbourly
controls and delicate against
considerable controls.
Duplicate Control and
Fingerprinting
Duplicate control and fingerprinting
are utilized to keep individuals from
making unlawful duplicates of the
substance. This issue is
fundamentally the same as the
exchange following of the
substance. A proprietor can implant
a watermark into advanced
substance that distinguishes the
purchaser of the duplicate (i.e.
sequential number). In the event
that unapproved duplicates are
discovered later, the proprietor can
follow the birthplace of the
unlawful duplicates.
5. Transform Domain
Contrasted with spatial-area
techniques, recurrence space
strategies are all the more generally
connected. The point is to implant
the watermarks in the phantom
coefficients of the picture. The most
regularly utilized changes are the
Discrete Cosine Transform (DCT),
Discrete Fourier Transform (DFT),
Discrete Wavelet Transform
(DWT), the explanation behind
watermarking in the recurrence
space is that the attributes of the
human visual framework (HVS) are
better caught by the phantom
coefficients.
Discrete wavelet changes (DWT)
Wavelet Transform is an advanced
method every now and again
utilized in computerized picture
preparing, pressure, watermarking
and so on. The changes depend on
little waves, called wavelet, of
differing recurrence and restricted
term. The wavelet change breaks
down the picture into three spatial
bearings, i.e. flat, vertical and
corner to corner. Consequently,
wavelets mirror the anisotropic
properties of HVS all the more
accurately. Extent of DWT
coefficients is bigger in the most
reduced groups (LL) at each level of
disintegration and is littler for
different groups (HH, LH, and HL).
The Discrete Wavelet Transform
(DWT) is right now utilized in a
wide assortment of flag preparing
applications, for example, in sound
and video pressure, evacuation of
commotion in sound, and the re-
enactment of remote reception
apparatus appropriation. Wavelets
have their vitality moved in time
and are appropriate for the
investigation of transient, time-
changing signs. Since the greater
part of the genuine signs
experienced are time fluctuating in
nature, the Wavelet Transform suits
numerous applications
exceptionally well. One of the
fundamental difficulties of the
watermarking issue is to accomplish
a superior trade-off between
strength and perceptivity.
Heartiness can be accomplished by
expanding the quality of the inserted
watermark, yet the unmistakable
contortion would be expanded also.
Nonetheless, DWT is much
favoured on the grounds that it gives
both a concurrent spatial restriction
also, a recurrence spread of the
watermark inside the host picture.
The fundamental thought of discrete
wavelet change in picture process is
to multi-separated deteriorate the
picture into sub-picture of various
spatial area and autonomous
frequencies.
Single Value Decomposition
The particular esteem deterioration
(SVD) is a critical factorization of a
rectangular genuine or complex
lattice. A picture could be viewed as
a grid of nonnegative scalar
sections.
Expect B is M×N picture; the SVD
of B is characterized as:
B= USV' (1)
U'.U = I, V'.V= I (2)
S = diag(σ , σ2 ,σ3 ,… ) (3)
B=σ 1U 1V1 + σ 2U2 V2 + σ 3U3
V 3… + σ P U PV P , P=min(M,N)
(4)
Where p is the rank of lattice B. σi
are the solitary qualities and
arranged in plummeting request.
The principle favourable position of
utilizing SVD in watermarking is
unimportant changes of the
particular estimations of
watermarked picture under the
normal picture preparing assaults.
6. Advantages of DWT 7. Implementation

• It has many special advantages over DWT-SVD- Matlab

other conventional transforms such
%% DWT - SVD Watermarking
as Discrete Fourier Transform
function [psnr_values,
(DFT) and Discrete Cosine psnr2dB_values] = dwt_svd()
Transform (DCT). The DFT and % clear workspace
clear all;
DCT are full frame transforms and
close all;
hence any change in the transform clc;
coefficient affects the entire image.
folder_name = uigetdir(pwd,
However, there are cases where the
'Select Directory Where the .m
transformation is implemented Files Reside');
using a block based approach if ( folder_name ~= 0 )
if ( strcmp(pwd, folder_name)
== 0 )
• DWT is very useful to identify the cd(folder_name);
areas in the host image where a end
watermark can be embedded else
return;
effectively. This property allows the
end
exploitation of the masking effect of
the human visual system [cover_fname, cover_pthname] =
...
uigetfile('*.jpg; *.png; *.tif;
*.bmp', 'Select the Cover Image');
• After the image is processed by the if (cover_fname ~= 0)
wavelet transform, most of the cover_image =
strcat(cover_pthname,
information contained in the host
cover_fname);
image is concentrated into the LL cover_image = double(
image. LH sub band contains rgb2gray( imread( cover_image ) )
mostly the vertical detail );
cover_image =
information which corresponds to
imresize(cover_image, [512 512],
horizontal edges. HL band 'bilinear');
represents the horizontal detail else
return;
information from the vertical edges
end
[watermark_fname,
watermark_pthname] = ...
uigetfile('*.jpg; *.png; *.tif;
*.bmp', 'Select the Watermark
Logo');
if (watermark_fname ~= 0)
watermark_logo =
strcat(watermark_pthname,
watermark_fname);
watermark_logo = double(
im2bw( rgb2gray( imread(
watermark_logo ) ) ) );
watermark_logo =
imresize(watermark_logo, [512
512], 'bilinear');
else
return;
end
numOfKeys = 20;
gaussian_plot = false;
print_figures = true;
if (gaussian_plot == false)
secret_key = 3; % random secret
key
watermarked_image =
watermark_embedding(cover_imag
e, watermark_logo, ...
secret_key, print_figures);
watermark_extraction(watermarked
_image, watermark_logo,
secret_key, ...
print_figures, true);
else
psnr_values = zeros(1,
numOfKeys);
psnr2dB_values = zeros(1,
numOfKeys);
decoded_correct = zeros(1,
numOfKeys);
decoded_wrong = zeros(1,
numOfKeys);
% [m, n] =
size(watermark_logo);
% correctWatermarkDiff =
zeros(1, m*n);
wrongWatermarkDiff = zeros(1,
length(watermark_logo));
for key = 1:numOfKeys
% Embedding with the right
key
[watermarked_image,
original_signature] = ...
watermark_embedding(cover_imag
e, watermark_logo, key,
print_figures);
watermarked_images_dir =
strcat(pwd,
'\watermarked_images\',
num2str(key), '.png');
%imwrite(uint8(watermarked_ima
ge), watermarked_images_dir,
'png');
imshow(watermarked_image)
% Transform the original
watermrak (i.e. the original
signature) to
% the interval [-1, 1]
original_signature(find(original_si
gnature == 0)) = -1;
% Measure the degree of
distortion of the original and the
watermarked
% image using PSNR (dB)
 psnr_values(key) =
psnr(cover_image,
watermarked_image);
psnr2dB_values(key) =
pow2db(psnr_values(key));
% Detection with the right
key, message_correct is actually
the
% watermark_logo because in
essence that's what I'm hidding in
the
% cover image. Whereas the
watermark_correct is actually the
signature
% which helps in the detection
of false acceptance and false
% rejection
[~, ~, recon_sig_corr, LL4,
HH4] = ...
watermark_extraction(watermarked
_image, watermark_logo, key, ...
print_figures, true);
% transform the
watermark_correct(i.e. the
reconstructed_signature)
% and the
watermark_wrong(i.e. the wrong
reconstructed signature)
% to the interval [-1, 1]
recon_sig_corr(find(recon_sig_corr
== 0)) = -1;
LL4 = LL4(:)';
HH4 = HH4(:)';
LL4 = LL4 - mean(LL4);
HH4 = HH4 - mean(HH4);
comb_HH4_LL4 = [LL4
HH4];
% decoded_correct(key) =
(abs(comb_HH4_LL4) *
recon_sig_corr')/512^2;
% decoded_correct(key) =
sum(comb_HH4_LL4 .*
recon_sig_corr)/512^2;
% Detection with the wrong
key
[~, watermark_wrong,
recon_sig_wrng, LL4wr, HH4wr]
= ...
watermark_extraction(watermarked
_image, watermark_logo, key+11,
...
print_figures, false);
watermark_wrong(find(watermark
_wrong == 0)) = -1;
LL4wr = LL4wr(:)';
HH4wr = HH4wr(:)';
LL4wr = LL4wr -
mean(LL4wr);
HH4wr = HH4wr -
mean(HH4wr);
combwr_HH4_LL4 = [LL4wr
HH4wr];
% decoded_wrong(key) =
(abs(combwr_HH4_LL4) *
watermark_wrong')/512^2;
% decoded_wrong(key) =
sum(watermark_wrong .*
original_signature)/512;
% Keep track of the
correlation between the
watermark_correct and
% the watermark_wrong
correlation_correct =
corrcoef(comb_HH4_LL4,
recon_sig_corr);
 decoded_correct(key) =
correlation_correct(2, 1);
correlation_wrong =
corrcoef(combwr_HH4_LL4,
watermark_wrong);
decoded_wrong(key) =
correlation_wrong(2, 1);
% Calculate the difference
between the correct extracted
watermarks and
% the original watermark and
the wrong extracted watermarks
and the orignal
% [Pfa, Pfr] =
correctKeyWatermarkDiff(key, :) =
watermark_wrong -
original_signature;
wrongWatermarkDiff(key, :)
= watermark_wrong -
original_signature;
clear('watermark_correct',
'comb_HH4_LL4',
'watermark_wrong', ...
'combwr_HH4_LL4',
'original_signature', ...
'LL4', 'HH4', 'LL4wr',
'HH4wr');
% Clear workspace
clear('watermark_logo_row',
'watermark_logo_extracted_correct
', ...
'watermark_logo_extracted_wrong'
, 'watermarked_image', ...
'watermark_correct',
'watermark_wrong',
'message_correct', ...
'message_wrong',
'watermarked_image');
end
meanOfDecodCorr =
mean(decoded_correct);
stdOfDecodCorr =
std(decoded_correct);
meanOfDecodWrng =
mean(decoded_wrong);
stdOfDecodWrng =
std(decoded_wrong);
gaussians(meanOfDecodCorr,
stdOfDecodCorr,
meanOfDecodWrng,
stdOfDecodWrng);
PfaPfr(meanOfDecodCorr,
stdOfDecodCorr,
meanOfDecodWrng,
stdOfDecodWrng, numOfKeys);
% Measure bit error rate, and
plot against threshold T of pfa,
% where T = pfa/pfr. Or
equivalently plot BER & E versus
pfa
BER =
BitErrorRate(wrongWatermarkDiff
);
end
end
SIGNATURE GENERATION
%% Signature generation
algorithm for authenticating
matrices U and V
function signature =
signature_generation(U, V, key)
% Proposed algorithm
% 1. Sum the column of orthogonal
matrices and create 1-D array
Usum = sum(U);
Vsum = sum(V);
% 2. Based on the threshold, map
the array values into corresponding
binary digits
Usum_threshold = median(Usum);
% threshold based on median value
of each Uw & Vw matrix
Vsum_threshold = median(Vsum);
% transform Usum martix to binary
using above threshold
Usum(find(Usum >
Usum_threshold)) = 1;
Usum(find(Usum <
Usum_threshold)) = 0;
% transform Vsum martix to binary
using above threshold
Vsum(find(Vsum >
Vsum_threshold)) = 1;
Vsum(find(Vsum <
Vsum_threshold)) = 0;
clear('Usum_threshold',
'Vsum_threshold');
% XOR the 2 matrices to obtain 1-
D array of dimension 1x512
UV_XOR = bitxor(uint8(Usum),
uint8(Vsum));
% 3. Generate a PSRNG sequence
using the key of dim. 1x512 and
XOR it with
% the UV_XOR 1-D array above
rand('seed', key);
% produce binary sequence to
perform XOR with UVsum
binary_seq = randi([0 1], 1,
length(UV_XOR));
signature = double(
bitxor(uint8(UV_XOR),
uint8(binary_seq)) ); % signature
length=512
clear('Usum', 'Vsum', 'UV_XOR',
'binary_seq');
end
SIGNATURE EMBEDDING
%% Signature embedding
algorithm
function LL_inv =
signature_embedding(LL,
signature, print_figures)
% 1. Using Haar wavelet, further
decompose LL band to the 4th
level.
[LL_1, HL_1, LH_1, HH_1] =
dwt2(LL, 'haar'); % 1st step
DWT
[LL_2, HL_2, LH_2, HH_2] =
dwt2(LL_1, 'haar'); % 2nd step
DWT
[LL_3, HL_3, LH_3, HH_3] =
dwt2(LL_2, 'haar'); % 3rd step
DWT
[LL_4, HL_4, LH_4, HH_4] =
dwt2(LL_3, 'haar'); % 4rth step
DWT
if (print_figures == true)
% Images coding.
cod_cA = wcodemat(LL_4);
cod_cH = wcodemat(HL_4);
cod_cV = wcodemat(LH_4);
cod_cD = wcodemat(HH_4);
dec2dim = [cod_cA, cod_cH;
cod_cV, cod_cD];
% Plot 4-th step decomposition
%figure;
%image(dec2dim);
 %title('4-th step DWT
decomposition');
clear('dec2dim', 'cod_cA',
'cod_cH', 'cod_cV', 'cod_cD');
end
% 1. choose all in total 512
coefficients from LL_4 & HH_4
% reshape them to row vectors of
size 1x256
LL_4 = reshape(LL_4, 1,
length(LL_4)^2);
HH_4 = reshape(HH_4, 1,
length(HH_4)^2);
% concatenate the above row
vectors into a larger row vector of
size 1x512
combined_LL4_and_HH4_coef =
[LL_4 HH_4];
% keep record of the index position
of negatives to put back the sign in
% inverse process
negative_idxs =
combined_LL4_and_HH4_coef(lo
gical(combined_LL4_and_HH4_co
ef)) < 0;
% keep only the positive integer
parts
% length(binary_coefficients));
combined_LL4_and_HH4_coeff_p
osint = round( abs(
combined_LL4_and_HH4_coef ) );
% separate the integer from the
decimal fraction
combined_LL4_and_HH4_coeff_p
os =
abs(combined_LL4_and_HH4_coe
f);
integer_part =
fix(combined_LL4_and_HH4_coef
f_pos);
fraction_part =
abs(combined_LL4_and_HH4_coe
ff_pos - integer_part);
% Convert the integer part into the
binary code of L=16 bits.
binary_coefficients = {};
for p = 1:length(integer_part)
% binary_coefficients{p} =
bitget( uint16( integer_part(p) ),
16:-1:1 );
binary_coefficients{p} =
decimalToBinaryVector(integer_pa
rt(p), 16);
end
% 2. Replace the n-th bit (10th bit)
position of the coefficient with
% signature bit
for m = 1:length(signature)
for n = 1:16
if (n == 10)
binary_coefficients{1,
m}(n) = signature(m);
end
end
end
% and then convert the binary code
to its decimal representation
bin2decimal = zeros(1,
for x =
1:length(binary_coefficients)
bin2decimal(x) =
binaryVectorToDecimal(double(bi
nary_coefficients{1, x}));
end
% reconstruct orignal array from
integer and decimal fraction parts
% cmb_coef = integer_part +
fraction_part;
bin2decimal = bin2decimal +
fraction_part;
% put back the negative signs
bin2decimal(find(negative_idxs ==
1)) = -
bin2decimal(find(negative_idxs ==
1));
% Clear workspace
clear('LL_1', 'LL_2', 'LL_3',
'LL_4', 'HH_4',
'combined_LL4_and_HH4_coef',...
'negative_idxs',
'combined_LL4_and_HH4_coeff_p
os', 'integer_part',...
'fraction_part',
'binary_coefficients', 'signature');
% reshape the modified LL_4 &
HH_4 sub-bands to their original
size 16x16
% each
LL_4_modified =
bin2decimal(1:256);
HH_4_modified =
bin2decimal(257:end);
LL_4_modified =
reshape(LL_4_modified, 16, 16);
HH_4_modified =
reshape(HH_4_modified, 16, 16);
% Clear workspace
clear('bin2decimal');
% 3. Apply the inverse DWT with
modified LL4 and HH4 band
coefficients.
LL_3_inv = idwt2(LL_4_modified,
HL_4, LH_4, HH_4_modified,
'haar');
LL_2_inv = idwt2(LL_3_inv,
HL_3, LH_3, HH_3, 'haar');
LL_1_inv = idwt2(LL_2_inv,
HL_2, LH_2, HH_2, 'haar');
LL_inv = idwt2(LL_1_inv, HL_1,
LH_1, HH_1, 'haar');
% Clear workspace
clear('LL_1_inv', 'LL_2_inv',
'LL_3_inv', 'LL_4_modified', ...
'HL_1', 'HL_2', 'HL_3', 'HL_4',
...
'LH_1', 'LH_2', 'LH_3', 'LH_4',
...
'HH_1', 'HH_2', 'HH_3',
'HH_4_modified');
end
WATERMARK EMBEDDING
%% Watermark Embedding
algorithm
function [watermarked_image,
signature] =
watermark_embedding(cover_imag
e, watermark_logo, key,
print_figures)
% 1. Apply Haar wavelet and
decompose cover image into four
sub-bands:
% LL, HL, LH, and HH
[LL, HL, LH, HH] =
dwt2(cover_image, 'haar');
% 2. Using Haar wavelet, further
decompose LL band to the 4th
level.
% [LL_1, HL_1, LH_1, HH_1] =
dwt2(LL, 'haar'); % 1st step
DWT
% [LL_2, HL_2, LH_2, HH_2] =
dwt2(LL_1, 'haar'); % 2nd step
DWT
% [LL_3, HL_3, LH_3, HH_3] =
dwt2(LL_2, 'haar'); % 3rd step
DWT
% [LL_4, HL_4, LH_4, HH_4] =
dwt2(LL_3, 'haar'); % 4rth step
DWT
if (print_figures == true)
% Images coding.
cod_cA1 = wcodemat(LL);
cod_cH1 = wcodemat(HL);
cod_cV1 = wcodemat(LH);
cod_cD1 = wcodemat(HH);
dec2d = [cod_cA1, cod_cH1;
cod_cV1, cod_cD1];
% Plot one step decomposition
%figure;
%image(dec2d);
%title('One step DWT
decomposition');
clear('dec2d', 'cod_cA1',
'cod_cH1', 'cod_cV1', 'cod_cD1');
end
% 3. Apply SVD to HH (high
frequency) band
[Uh Sh Vh] = svd(HH, 'econ');
% 4. Watermark logo W is
decomposed using SVD
[Uw Sw Vw] =
svd(watermark_logo, 'econ');
% 5. Replace singular values of the
HH (high frequency) band with the
% singular values of the watermark
Sh_diag = diag(Sh);
Sw_diag = diag(Sw);
% for ii = 1:size(Sw, 1)
% Sh_diag(ii) = Sw_diag(ii);
% end
if (length(watermark_logo) >=
256)
Sh_diag(1:length(Sh), :) =
Sw_diag(1:length(Sh), :);
elseif(length(watermark_logo) <
256)
Sh_diag(1:length(watermark_logo)
, :) =
Sw_diag(1:length(watermark_logo
), :);
end
Sh(logical(eye(size(Sh)))) =
Sh_diag;
%----- Signature generation
algorithm
% 6. Generate signature
signature =
signature_generation(Uw, Vw,
key);
%---- Signature embedding
algorithm
% 7. Embedd signature to cover
image
% LL_inv =
signature_embedding(LL_4,
HH_4, signature);
LL_inv =
signature_embedding(LL,
signature, print_figures);
% 8. Apply SVD to obtain the
modified HH band wich now holds
the SV's of
% watermark logo
HH_modified = Uh * Sh * Vh';
% 9. Apply inverse DWT with
modified LL(LL_inv) &
HH(HH_modified) band to
% obtain the watermarked image
% Here the HH band should be the
one modified with SV's
watermarked_image =
idwt2(LL_inv, HL, LH,
HH_modified, 'haar');
if (print_figures == true)
figure;
subplot(2, 2, 1);
imshow(cover_image, []);
title('Cover image');
subplot(2, 2, 2);
imshow(watermarked_image,
[]);
title('Watermarked image');
subplot(2, 2, 3);
imshow(watermark_logo, []);
title('Watermark logo');
end
clear('LL', 'HL', 'LH', 'HH',...
'LL_1', 'HL_1', 'LH_1', 'HH_1',
...
'LL_2', 'HL_2', 'LH_2', 'HH_2',...
'LL_3', 'HL_3', 'LH_3', 'HH_3',...
'LL_4', 'HL_4', 'LH_4', 'HH_4');
clear('Uh', 'Sh', 'Vh', 'Uw', 'Sw',
'Vw', 'Sh_diag', 'Sw_diag');
end
SIGNATURE EXTRACTION
%% Signature extraction algorithm
function reconstructed_signature =
signature_extraction(LLw_4,
HHw_4, lengthOfWatermark)
% 2. Select all coefficient from
LL4 and HH4 band
% reshape them to row vectors of
size 1x256
LLw_4 = reshape(LLw_4, 1,
length(LLw_4)^2);
HHw_4 = reshape(HHw_4, 1,
length(HHw_4)^2);
% concatenate the above row
vectors into a larger row vector of
size 1x512
combined_LLw_4_and_HHw_4_c
oeff = [LLw_4 HHw_4];
% keep record of the index position
of negatives to put back the sign in
% inverse process
negative_watermarked_idxs =
combined_LLw_4_and_HHw_4_c
oeff(logical(combined_LLw_4_and
_HHw_4_coeff)) < 0;
% keep only the positive integer
parts
%
combined_LLw_4_and_HHw_4_c
oeff_posint = round( abs(
combined_LLw_4_and_HHw_4_c
oeff ) );
% separate the integer from the
decimal fraction
combined_LLw_4_and_HHw_4_c
oeff_pos =
abs(combined_LLw_4_and_HHw_
4_coeff);
integer_part_of_watermarked_ima
ge =
fix(combined_LLw_4_and_HHw_
4_coeff_pos);
fraction_part_of_watermarked_ima
ge =
abs(combined_LLw_4_and_HHw_
4_coeff_pos -
integer_part_of_watermarked_ima
ge);
% Clear workspace
clear('LLw_4', 'HHw_4',
'combined_LLw_4_and_HHw_4_c
oeff', ...
'negative_watermarked_idxs',
'fraction_part_of_watermarked_im
age');
% Convert the integer part of
selected coefficient into the binary
code of L bits
binary_watermarked_coefficients =
{};
for y =
1:length(combined_LLw_4_and_H
Hw_4_coeff_pos)
% function
binary_watermarked_coefficients{
y} = bitget( uint16(
integer_part_of_watermarked_ima
ge(y) ), 16:-1:1 );
binary_watermarked_coefficients{
y} =
decimalToBinaryVector(integer_pa
rt_of_watermarked_image(y), 16);
end
% Clear workspace
clear('combined_LLw_4_and_HH
w_4_coeff_pos',
'integer_part_of_watermarked_ima
ge');
% 3. Extract the n-th (10-th) bit
from the coefficient to extract the
signature.
reconstructed_signature = zeros(1,
lengthOfWatermark);
for u = 1:lengthOfWatermark
for v = 1:16
if (v == 10)
reconstructed_signature(u)
=
binary_watermarked_coefficients{
1, u}(v);
end
end
end
% Clear workspace
clear('binary_watermarked_coeffici
ents');
end
WATERMARK EXTRACTION
%% Watermark extraction
algorithm
[watermark_logo_extracted,
generated_signature,
reconstructed_signature, LLw_4,
HHw_4] =
watermark_extraction(watermarked
_image, watermark_logo, key,
print_figures,
signature_authentication)
% 1. Using Haar wavelet,
decompose the noisy watermarked
image into four
% sub-bands: LL, HL, LH, and HH
[LLw HLw LHw HHw] =
dwt2(watermarked_image, 'haar');
% 2. Further decompose LL band
to the 4th level.
[LLw_1, HLw_1, LHw_1,
HHw_1] = dwt2(LLw, 'haar'); %
1st step DWT
[LLw_2, HLw_2, LHw_2,
HHw_2] = dwt2(LLw_1, 'haar');
% 2nd step DWT
[LLw_3, HLw_3, LHw_3,
HHw_3] = dwt2(LLw_2, 'haar');
% 3rd step DWT
[LLw_4, HLw_4, LHw_4,
HHw_4] = dwt2(LLw_3, 'haar');
% 4rth step DWT
% Clear workspace
clear('LLw_1', 'LLw_2', 'LLw_3',
...
'HLw_1', 'HLw_2', 'HLw_3',
'HLw_4', ...
'LHw_1', 'LHw_2', 'LHw_3',
'LHw_4', ...
'HHw_1', 'HHw_2', 'HHw_3', ...
'LLw', 'HLw', 'LHw');
% 3. Apply SVD to watermark
logo
[Uw_x Sw_x Vw_x] =
svd(watermark_logo, 'econ');
% 4. Generate signature using Uw
& Vw matrices
generated_signature =
signature_generation(Uw_x,
Vw_x, key);
% 5. Extract signature from LLw_4
& HHw_4 bands using all of the
512
% coefficients
reconstructed_signature =
signature_extraction(LLw_4,
HHw_4, length(watermark_logo));
if (signature_authentication ==
true)
% 6. Compare the 2 signatures
if ( reconstructed_signature ==
generated_signature |
corr2(reconstructed_signature,
generated_signature) > 0.7 )
% proceed to watermark
extraction if authentication is
successful
% helpdlg('Authentication
was successful!');
% 8. Apply SVD to HH band
[Ucw Scw Vcw] = svd(HHw,
'econ');
% 9. Extract the singular
values from HH band
HH_singularValues =
zeros(length(watermark_logo));
Shh_diag =
diag(HH_singularValues);
Scw_diag = diag(Scw);
%for jj = 1:size(Sw_x, 1)
% Shh_diag(jj) =
Scw_diag(jj);
%end
if (length(watermark_logo) >=
256)
Shh_diag(1:length(Scw), :)
= Scw_diag;
elseif
(length(watermark_logo) < 256)
Shh_diag(1:length(watermark_logo
), :) =
Scw_diag(1:length(watermark_log
o), :);
end
HH_singularValues(logical(eye(siz
e(HH_singularValues)))) =
Shh_diag;
% 10. Construct the
watermark using singular values
and orthogonal matrices
% Uw and Vw obtained using
SVD of original watermark
 watermark_logo_extracted =
Uw_x * HH_singularValues *
Vw_x';
% Clear workspace
clear( 'Uw_x', 'Sw_x', 'Vw_x',
...
'Ucw', ',Scw', 'Vcw',
'HH_singularValues', 'Shh_diag', ...
'Scw_diag');
if (print_figures == true)
figure;
imshow(watermark_logo_extracted
, []);
title('Extracted watermark');
end
% This constitutes a blind
decoding as watermark extraction
process does
% not require original cover
image for extracting the watermark
at the receiver
else
errordlg('Authetication
Failure. The signatures do not
match. No watermark extracted!');
watermark_logo_extracted =
zeros(length(watermark_logo),
length(watermark_logo));
return;
end
else
% Proceed directly to watermark
extraction based on random
selected
% values from HH band using
the key as an indicator
% rand('seed', key);
% produce random sequence to
choose HH values
% index = randi([1 256], 1,
length(watermark_logo));
% 8. Apply SVD to HH band
[Ucw Scw Vcw] = svd(HHw,
'econ');
% 9. Extract the singular values
from HH band
HH_singularValues =
zeros(length(watermark_logo));
Shh_diag =
diag(HH_singularValues);
Scw_diag = diag(Scw);
% Choose random values from
Scw base on key index
% Scw_random_diag =
Scw(index);
%for jj = 1:size(Sw_x, 1)
% Shh_diag(jj) = Scw_diag(jj);
% Shh_diag(jj) =
Scw_random_diag(jj);
%end
% Shh_diag =
Scw_random_diag;
if (length(watermark_logo) >=
256)
Shh_diag(1:length(Scw), 1) =
Scw_diag;
elseif (length(watermark_logo) <
256)
Shh_diag(1:length(watermark_logo
), :) =
Scw_diag(1:length(watermark_log
o), :);
end
HH_singularValues(logical(eye(siz
e(HH_singularValues)))) =
Shh_diag;
% Clear workspace
 clear('Ucw', 'Scw', 'Vcw',
'Shh_diag', 'Scw_diag',
'Scw_random_diag');
% 10. Construct the watermark
using singular values and
orthogonal matrices
% Uw and Vw obtained using
SVD of original watermark
watermark_logo_extracted =
Uw_x * HH_singularValues *
Vw_x';
% Clear workspace
clear('HH_singularValues');
9. Conclusion
Hence, the watermark was applied to
the image and it was undetectable to
the human eye. It was noticed that
the watermark image’s matrix
should be equal to or smaller than
the matrix of the cover image for
proper application of watermark on
the image.

if (print_figures == true)
figure;

imshow(watermark_logo_extracted
, []);
title('Extracted watermark');
end

end

end

8. Result Screenshots
 10. References
DWT Based Digital Watermarking
Technique and its Robustness on Image
Rotation, Scaling, JPEG compression,
Cropping and Multiple Watermarking
S.M. Mohidul Islam ; Rameswar
Debnath ; S.K. Alamgir Hossain
Digital watermarking techniques for
security applications
Sonam Tyagi ; Harsh Vikram
Singh ; Raghav Agarwal ; Sandeep Kumar
Gangwar
Digital watermarking using DWT and
DES
Nirupma Tiwari ; Manoj Kumar
Ramaiya ; Monika Sharma
A Survey of Digital Watermarking
Techniques and its Applications
Lalit Kumar Saini1 , Vishal Shrivastava2
M.Tech1 Research Scholar, Professor2
Department of Computer Science and
Engineering, Arya College of Engineering.
& Information Technology, Jaipur, India
DESIGN AND IMPLEMENTATION
OF IMAGE STEGANOGRAPHY
Journal of Signal and Image Processing
ISSN: 0976-8882 & E-ISSN: 0976-8890,
Volume 3, Issue 3, 2012, pp.-111-113.
CHINCHOLKAR A.A.* AND URKUDE
D.A. Department of Computer Science,
Jawaharlal Darda Institute of Engineering
& Technology, Yavatmal, MS, India.
Real Time Implementation of Digital
Watermarking Algorithm for Image
and Video Application
Amit Joshi 1, Vivekanand Mishra 1 and
R. M. Patrikar 2 1 Sardar Vallabhbhai
National Institute of Technology Surat 2
Visvesvaraya National Institute of
Technology Nagpur India
A Study on Digital Watermarking
Techniques
L. Robert, Department of Computer
Science, Government Arts College,
Coimbatore, Tamilnadu, India
T.Shanmugapriya, Research Scholar,
Bharathiar University, Coimbatore, Tamil
Nadu, India