Project Review on

MINIMIZATION OF EFFECTS OF ROTATION AND CROPPING

ATTACKS ON WATERMARKED IMAGES USING NEURAL NETWORK
1.B.CHANDANA(15AT1A0414)
2.J.MEENAKSHI (15AT1A0451)
3.C A.KUSUMALA (15AT1A0441)
4.E.LIKHITHA (15AT1A0444)
5. B .KARISHMA(15AT1A0436)

Under the Guidance of

Dr.N.Ramamurthy
Professor of ECE

Department of Electronics & Communication Engineering

G. Pullaiah College of Engineering and Technology(Autonomous)
Near Venkayapalle, Pasupula Village, Nandikotkur Rd, Kurnool, Andhra Pradesh 518452
 Abstract
Watermarked images are affected by various attacks
such as cropping, salt&pepper noise and rotation. These
attacks destroy the inserted watermark, so that the
copyright problem may arise. The effect of these attacks
can be reduced by properly inserting the watermark with
effective algorithm. In this project, a blind transform
domain based algorithm using Back Propagation Neural
Network is introduced. The proposed algorithm is robust
to cropping and rotation attacks compared to other
algorithms.
 Literature Review
DIGITAL WATERMARKING
Digital watermarking is the method of
embedding data into digital multimedia content. This is
used to verify the credibility of the content or to
recognize the identity of the digital content's owner.

Digital watermarking can be employed for

multiple purposes, such as:
Copyright protection
Source tracking
Hidden communication.
TYPES OF WATERMARKING
Digital watermarking schemes are typically classified
into three categories.
Private or non blind watermarking which requires the
prior knowledge of the original information and secret
keys at the receiver.
Semi private or semi blind watermarking where the
watermark information and secret keys must be
available at the receiver.
Public or blind watermarking where the receiver must
only know the secret keys .
 WATERMARKING TECHNIQUES
The watermarking techniques classified as spatial
domain and transform domain techniques based on the domain of
watermark insertion. The texture block coding method, least significant
bit insertion method and patch work method are existing methods in
the spatial domain.
In transform domain methods, special transformations
are used to process the coefficients infrequency domain to hide the
watermark. Different transform domain methods include “Fast Fourier
Transform”, “Discrete Cosine Transform”, “Discrete wavelet transform”,
“Curvelet Transform”, “Counterlet Transform”, etc. In transform domain
methods the watermark is inserted in to frequency coefficients of the
host image.
 ADVANTAGES OF DWT OVER DCT
Watermarking in the DWT domain has numerous advantages
over other transforms; particularly the Discrete Cosine Transform
(DCT).The main advantage of wavelet transforms is that they provide
the multi-resolution description of an image, where the image is
available at different resolution levels. Wavelets also process an image
from low to the high resolution sequentially so that the missing data
can be detected at another level.
DWT is closer to the properties of the human visual
system than the DCT, as the selection of embedding is flexible by
splitting the signal into individual bands. DWT watermarking
techniques follow Human Visual System (HVS) characteristics; it is
difficult to detect the watermark existence in the cover image.
 Discrete Wavelet Transformation
LL2 HL2
Level 1 Level 2
LH2 HH2
LL1 HL1
HL1
Original
image LH1 HH1
LH1 HH1

The Discrete Wavelet Transform (DWT) was invented by the

Hungarian mathematician Alfred Haar. For an input represented by a
list of 2n numbers, the Haar Wavelet Transform simply pair up
input values, storing the difference and passing the sum . This
process is repeated recursively, pairing up the sums, finally resulting
in 2n-1 differences and one final sum. DWT decomposes input
image into four components namely LL, HL, LH, and HH. The lowest
resolution level LL consists of the approximation part of the original
image. Haar wavelet uses two types of filters. One is low-pass filter
and the other is a high pass filter
 The output of the low-pass filter is obtained by
averaging the input, while the output of the high pass filter is
obtained from the differences of the inputs . Low pass filter
contained more information than high pass filter, because most of
signal energy is concentrated in low pass filter. The basic idea of the
DWT for two dimensional images described as follows. An image is
first decomposed into four parts of high, middle, and low frequency
sub components (LL1, HL1, LH1, and HH1) by critically sub sampling
horizontal and vertical channels using sub component filters.
BACK PROPAGATION NEURAL NETWORK
(BPNN):-
Back Propagation Neural Network is a multi-layer feed forward
network . The learning mechanism employed in BPNN is supervised and
is of feed forward network, where errors are back propagated to adjust
the weights. In general a neural network is represented by branches and
nodes with directions, where the information transmission takes place
by means of the reactions between the nodes of different layers such as
input, hidden and output layers. Back propagation neural network has
good non-linear approximation where the relationship between cover
image wavelet coefficients and watermarked image wavelet coefficients
is established by adjusting the weights between the layers. The number
of nodes in the hidden layer depends upon the size of the network.
Watermark Embedding Algorithm using
BPNN:
Step 1: Read the color image of size NxN.
Step 2: Resize the color image of size into 512x512 pixels and use it as cover
image.
Step 3: Compute Red, Green and Blue planes of the cover image and select
Blue plane to embed the watermark.
Step 4: Read the bitmap of size 64x64 Barbara as the watermark.
Step 5: Compute fourth level DWT on the Blue plane of the cover image to
get the frequency subband coefficients {HH1, HL1, LH1, {HH2, HL2, LH2, {HH3,
HL3, LH3, {HH4, HL4, LH4, LL4}}}}.
Step 6: Select the high and middle frequency coefficients to embed the
watermark, and use the key to select the beginning position of the
watermark.
Step 7: Apply the DWT coefficients to BPNN to perform quantization and then get
the output .

Step 8: Embed the watermark using the following equation .

Step 9: Perform IDWT on each coefficient to get the watermarked image.

where………. is the selected cover image coefficient to embed the

watermark,
Q is quantization value
is the random watermark sequence.

is the watermarked image coefficient and

Watermark Extraction Algorithm using
BPNN .

Step 1: Select the Blue plane of the watermarked image and

apply DWT.
Step 2: Quantize the DWT coefficient, by Q using BPNN

Step 3: Extract the watermark using the equation.

Step 4: Measure the similarity between the original

watermark and the extracted watermark
EXPERIMENTAL RESULTS

Cover image,
Watermark image,
Extracted watermark,
Watermarked image

5% and 10% crop

attacked
watermarked
image and
extracted
watermark
15% and 20%
crop attacked
watermarked
image and
extracted
watermark

5% and 10%
rotation
attacked
watermarked
image and
extracted
watermark
 15% and 20%
rotation attacked
watermarked
image and
extracted
watermark

Type of attack 5% 10% 15% 20%

PSNR for 25.8128 24.7028 23.6121 22.4557
cropping

PSNR for 24.0348 21.5974 20.5307 19.9213

rotation

Comparision of PSNR of rotation and cropping attacks

 Types of 5% 10% 15% 20%
attack
NCC for 0.9154 0.9187 0.9305 0.9658
cropping
NCC for 0.8141 0.8199 0.8316 0.8363
rotation

Table 1.2 :Comparision of NCC of rotation and cropping attacks

30

25

20

15
PSNR

10 Graph 1.1:PSNR plot

5
of cropping and
0
5 10 15 20 rotation attack
PSNR of cropping PSNR of rotation
 2

1.
6 Graph 1.2: NCC plot of
1.
2 cropping and rotation
attack
NCC

8
0.

4
0.

0
1 2 3 4

NCC of cropping NCC of rotation

Fig. 1.6: original

image,
Watermark,
Extracted
watermark,
Watermarked
image
Fig. 1.7:5% and 10%
crop attacked
watermarked image and
extracted watermark

Fig. 1.8:.15% and

20% crop attacked
watermarked image
and extracted
watermark
 Fig1.9: 5 degrees and
10 degrees rotation
attacked watermarked
image and extracted
watermark

Fig1.10: 15 degrees and

20 degrees rotation
attacked watermarked
image and extracted
watermark
Type of attack 5% 10% 15% 20%

PSNR of 29.6547 28.6244 27.5744 26.1349

cropping
PSNR of 23.5404 21.1039 19.9095 19.3169
rotation

Table 1.3: Comparision of PSNR of rotation and cropping attacks

Type of attack 5% 10% 20% 30%

NCC of cropping 0.9569 0.9334 0.9242 0.9184

NCC of rotation 0.8213 0.8292 0.8330 0.8373

Table 5.2:Comparision of NCC of rotation and cropping attacks

 Graph 1.3 : PSNR plot of
cropping and rotation attack

Graph 1.4 : NCC plot of

cropping and rotation attack
 Conclusion
The watermark embedding and extraction algorithms
developed using BPNN in DWT domain using biorthogonal
wavelets. The PSNR and NC are taken as the parameters to
test the imperceptibility and robustness of the watermarked
images. The imperceptibility measured by finding peak signal
to noise ratio. The robustness tested by measuring the
normalized correlation coefficient against cropping and
rotation attacks. The normalized correlation coefficient is used
to check the similarity between original watermark and
extracted watermark.
 Reference
•Palak Jain &Umesh G “Robust watermarking technique for textured images”6th
ProcediaComputerScience,International Conference on Smart Computing and
Communications,ICSCC 2017, 7-8 December 2017, Kurukshetra, India.

•Boris Escalante-Ramírez and S. L. Gomez-Coronel “A Perceptive Approach to

Digital Image Watermarking Using a Brightness Model and the Hermite
Transform”Mathematical Problems in Engineering, Volume 2018, Article ID
5463632, 19 pages.

•AmarjotKaur&Jagdeep Singh “Digital Image Watermarking Techniques: A

Review”,International Journal of Advanced Research in Computer
Science,Volume 8, No. 8, September-October 2017.

•G.Fahmy, M.F.Fahmy, and U.Mohammed“Nonblind and Quasiblind Natural

Preserve Watermarking” Hindawi Publishing Corporation, EURASIP Journal
on Advances in Signal Processing, Volume 2010, Article ID 452548, 13 pages.
 IE S
E I R
Q U
A N Y
 O U
K Y
A N
T H