You are on page 1of 6

3rd INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION 2014

An Image Fragile Watermarking Scheme Based on


Chaotic System for Image Tamper Detection
Md. Moniruzzaman, Md. Abul Kayum Hawlader and Md. Foisal Hossain
Department of Electronics and Communication Engineering
Khulna University of Engineering and Technology, (KUET)
Khulna, Bangladesh
mdzamankuet@gmail.com, kayumkuet09@gmail.com, foisalkuet@yahoo.com
Abstract Image watermarking techniques are specially used to
provide copyright protection, owners identification, image
authentication and tamper detection. Fragile watermarking is
usually used for image authentication and tamper detection. In
this paper, fragile watermarking scheme based on chaotic system
has been proposed. Two dimensional Arnolds cat map has been
used to improve the security of the proposed watermarking
scheme. Arnolds cat map is sensitive to the initial values. This
map is specially used to obtain the scrambled image by shuffling
the pixel positions of the host image. Therefore the number of
iterations and the initial values which are used to obtain
scrambled image can be used as secret keys. The proposed
scheme provides high security, extracts watermark from the
tampered image and also localizes the tampered areas.
Experimental results of proposed method have been compared
with other existing two chaotic system based watermarking
schemes. From the experimental results it can be seen that the
proposed watermarking scheme gives better results than other
chaos based watermarking schemes.
Keywords-watermarking;
chaotic map.

I.

robustness;

fragile-

wateramrk;

INTRODUCTION

Watermarking technique is required to secure data and


prevent unauthorized modification. These security and
prevention is for rapid development of digital technologies,
internet technologies and powerful image processing tools.
Due to the development of digital technologies and internet
technologies, a large amount of digital data can easily be
accessed via different transmission channels. At the same time
with the help of powerful image processing tools data can
easily be manipulated, tampered and distributed.
Watermarking technique is used to prevent these
modifications by embedding a watermark into the host image.
The embedding technique can be visible or invisible, spatial
domain or transformed domain, robust or fragile. In visible
watermarking technique the watermark can be perceived by
human eyes. On the other hand in case of invisible
watermarking technique the watermark cannot be perceived by
human eyes [1]. There are three basic requirements for
invisible watermarking. One of them is that the distortion to
the pixels of host image due to embedding of watermark

should be too small to be noticed. At the same time, it should


be robust in case of various attacks and finally high security
should be provided to the watermarking scheme. In spatial
domain, the watermarks are directly inserted into the bitplanes of the host image pixels. The watermarks are inserted
into the coefficients of a transformed image in case of
transformed or frequency domain. Discrete Cosine Transform
(DCT) [2], Discrete Wavelet Transforms (DWT) [3] are used
to obtain transformed image.
Robust invisible watermarking is the technique from which
it is very difficult to remove the watermark by unauthorized
user [4]. The robustness of the algorithm is the main feature
for robust watermark. Robust watermark resists all kinds of
attacks, such as common signal processing operators and
geometric attacks. Signal processing attacks reduce the
watermark energy while synchronization errors between
encoder and decoder of the watermark can be induced by
geometric attacks. A robust invisible watermarking technique
which protects watermarked image from geometric and signal
processing attacks is presented in [5]. The goal of this
technique is to produce an invisible and robust watermark that
resists signal processing and geometric distortion attacks.
Robust watermarking techniques also provide high resistance
to copy attack and common image attacks [6].
Fragile watermarks are used to locate the tampered areas
when the image has been tampered. Recently many fragile
watermarking schemes for content authentication, integrity
verification and for image tamper detection have been
proposed [7], [8], [9]. In case of fragile watermark, the
robustness is not the most important factor. Perceptual quality,
location capability and security are the most important factors
for fragile watermarking.
Security is one of the most important factors for
watermarking scheme. Specially, key is used to give the
security to the watermarked image [10], [11]. Without using
the key, the information or the watermark cannot be extracted
from the host image. In recent years chaotic maps are being
used to improve the security of the watermarking scheme.
Different chaotic maps have been proposed to provide the
security and to scramble the original image [12], [13], [14].
Fragile watermark has also been proposed based on chaotic
map for image tamper detection [15].

978-1-4799-5180-2/14/$31.00 2014 IEEE

3rd INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION 2014

Original
Image

Scrambled
Image Iscr

K-times
iterations of
Arnold cat
map

Extract 8-bits
from each
pixel of Iscr

Calculate
XOR of 8 bits
of each pixel
Is XOR(x, y)
= W(x, y)?

Binary
watermark (W)

yes

no
Watermarked
Image

No
change
in the
pixels of
Iscr

Modify the pixels of


Iscr by changing LSB

Cat map (T-K)


times

Fig.1: Block diagram of embedding process

Watermarked
Image

Cat maps
K times

Scrambled
Image

Calculate XOR
of 8 bits of
each pixel

Extract 8 bits from each


pixel of scrambled
Image

Original
watermark

Extracted watermark
(XOR results)

XOR
Cat maps (T-K)
times

Locate modified
areas

Fig.2: Block diagram of extraction algorithm

In this paper, a watermarking scheme has been proposed


based on two dimensional Arnolds cat map which can be
used for tamper detection. Arnolds cat map has been used to
obtain the scrambled image from the original image. The
scrambled image can be obtained by shuffling the pixel
positions of the host image with the help of Arnolds cat map.
Then the scrambled image has been divided into 8-bit planes.
In the proposed scheme, a binary watermark has been
embedded into the scrambled image by using XOR operator.
Then finally, the watermarked image from the modified
scrambled image can be obtained by performing inverse cat
map.
The rest of the paper is organized as follows. In section-II,
Arnolds cat map is described briefly. The proposed
watermarking scheme is explained in section-III. The
experimental results and comparison is discussed in sectionIV. Finally, section-V concludes the paper.
II.

x' = [x + py] mod (n)

(1)

y' = [qx + (pq + 1)y] mod (n)

(2)

Here, (x', y') represents the new position of (x, y) after


Arnolds cat transform and n is the dimension of the image. p
and q are the initial values in which the sensitivity of cat map
depends. Therefore p and q can be used as keys.

ARNOLDS CAT MAP

Large numbers of chaotic algorithms have been proposed


for image watermarking. As the security issue is the major
attention for watermarking algorithms, chaotic maps generate
chaotic image pattern for increasing the security. These types
of maps are sensitive to initial conditions. Two dimensional
Arnold cat map shuffles the pixels positions of the original
image without changing the pixels gray level intensities. The
2D Arnold cat map [15] can be obtained by-

Fig.3: Periodic phenomenon in Arnolds cat map. (a)-is the original image
[256 256]; (b) & (c) are the scrambled images after K=20 & 160 iterations,
respectively; (d) cameraman image after completing a period (T=K=192).

978-1-4799-5180-2/14/$31.00 2014 IEEE

3rd INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION 2014

{
LSBm(scr)(x, y) = LSBscr(x, y) + 1 ; if LSBscr(x, y)=0
LSBm(scr)(x, y) = LSBscr(x, y) - 1 ; if LSBscr(x, y)=1
a

Where, LSBscr is the least significant bit plane of scrambled


image and LSBm(scr) is the modified least significant bit plane
of scrambled image.
5. Finally, the watermarked image can be obtained by
applying (T-K) iterations on the modified scrambled image.
Here T is the period of the cat map.

Fig.4 (a) original image; (b) watermark image; (c) watermarked image and (d)
extracted watermark from watermarked image.

B. Watermark extraction
The watermark is extracted as follows, step by step-

Scrambled images of the original image can be obtained


from iterations of Arnold cat map. In other words, the number
of iterations K gives scrambled images of K numbers and each
scrambled image is different from others. Therefore the
number of iteration K can also be used as the secret key.

1. Firstly, the scrambled watermarked image IWscr is


obtained by using the correct key.

Another characteristic of Arnolds cat map is that it shows


periodicity. The map has period T when the pixels positions
returns to its original positions after T times being
transformed. The periodicity of Arnolds cat map is shown in
Fig. 3.

3. The check sum is calculated from IWscr by using XOR


operator of 8-bits of each pixel. The check sum or XOR
results give the watermark image that was embedded into the
scrambled image.

III.

THE PROPOSED SCHEME

In this section the proposed watermark embedding and


watermark extraction algorithms have been explained. For
this, gray scale image has been used as the host image I, and
the binary image has been used as the watermark image W.
A. Watermark embedding
The watermark can be embedded as follows step by step1. Firstly, the scrambled image Iscr is obtained from the
original image I using Arnold cat map. The scrambled image
is obtained from the original image after K times iterations of
cat map. Here K acts as a secret key.
2. After obtaining the scrambled image, the scrambled
image is divided into 8-bit planes. In other words, 8-bits are
extracted from each pixel of the scrambled image.
3. From the scrambled image check sum is calculated
using exclusive-or (XOR) operator of 8-bits of each pixel.
4. A binary image is considered as the watermark image
whose size should be equal to the size of the original image.
The pixels of the watermark image are compared with check
sum or XOR results one by one.
(i). The pixels of the scrambled image are unchanged if
the values of watermark pixels are same as the values of XOR
results.
(ii). The pixels of scrambled image are being modified
by changing the Least Significant Bits (LSB) if the values of
watermark pixels are not same as the values of XOR results.

2. Then 8-bits from each pixel of scrambled watermarked


image are extracted.

4. The tampered areas can also be located by the proposed


algorithm. For this exclusive-or (XOR) operation is applied
between the extracted watermark and original watermark.
Then a difference image can be obtained.
Finally, Arnold cat map is applied (T K) times on the
difference image to locate the tampered areas.
IV.

EXPERIMENTAL RESULTS AND COMPARISON

The proposed algorithm has been tested by extensive


experiments using MATLAB (R2009a). In this paper, several
8-bit gray scale images of size 256256 are used as the host
image. The watermark is a binary image and the size of the
watermark is same as the host image. In the proposed scheme,
three parameters can be used as the secret keys described
earlier. The two initial parameters of Arnolds cat map p &
q and the number of iteration K can be used as secret keys.
In this paper, p=1; q=1 and K=20 have been set as the values
of secret keys.
Fig. 4 simply shows the embedding and extracting
scheme of watermark into the original or host image. The
original cameraman image is shown in Fig. 4(a) and Fig. 4(b)
shows the binary watermark image. After embedding the
watermark using the proposed scheme, watermarked image is
obtained which is shown in Fig. 4(c). Finally, the extracted
watermark is shown in Fig. 4(d) which is same as the
embedded one.
Fig. 5 shows several images which are attacked by the
third party. First row of Fig. 5 shows the original images. Fig.
4(b) shows the binary watermark image which is embedded
into the original images of Fig. 5. After embedding the

if ( W(x, y) is not equal XOR(x, y) )

978-1-4799-5180-2/14/$31.00 2014 IEEE

3rd INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION 2014

Fig.5: (a), (b), (c) & (d)- original images; (e), (f), (g) & (h)- watermarked images; (i), (j), (k) & (l)- tampered images; (m), (n), (o) & (p)- extracted watermark with
right key (Key = 20); (q), (r), (s) & (t)-extracted watermark with wrong key (Key=21); (u), (v), (w) & (x)- detected tampered regions.

978-1-4799-5180-2/14/$31.00 2014 IEEE

3rd INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION 2014

Fig.8: the relation between EBR (%) with (a) salt and pepper noise intensity
and (b) cropped image (%).

where, L is the maximum intensity of the gray scale image.

Fig.6: (a), (b) & (c) are the watermarked images attacked by salt & pepper
noise with intensities 0.02, 0.10 & 0.15 respectively; (d), (e) & (f)
corresponding extracted watermarks.

The EBR is used to compute the rate of error bit on the


whole watermark accurate bits. For the original watermark
image W of size m n and the extracted watermark image
W*, EBR is given byEBR = [i j {W(i, j) W*(i, j)}] / (m n)

(5)

where, i is from 0 to m-1 and j is from 0 to n-1.

Fig.7: (a), (b) & (c) are the watermarked images cropped in different
positions; (d), (e) & (f) corresponding extracted watermarks.

watermark into the original images, the watermarked images


are obtained which are shown in the second row of Fig. 5.
Tampered images are shown in third row of Fig. 5 and the
corresponding extracted watermarks with right keys are shown
in the fourth row of Fig. 5. If wrong keys are used in the
extraction procedure of watermark, the extraction of
watermark will be failed which is shown in the fifth row of
Fig. 5. Finally, the tampered areas can also be recovered by
using the proposed scheme shown in the last row of Fig. 5.
In this paper, three performance parameters have been
used to demonstrate the performance of proposed scheme. The
three parameters are- Mean Square Error (MSE), Peak Signal
to Noise Ratio (PSNR) and Error Bit Rate (EBR).
The low value of MSE indicates that the watermarked
image is almost similar to the original image which is desired
for invisible or transparent watermarking. If the original image
is I of size M N and after embedding watermark into I the
watermarked image is I*, then MSE can be obtained byMSE = [x y {I(x, y) I*(x, y)}2] / (MN)

(3)

where, x is form M-1 and y is from 0 to N-1.


PSNR is used to measure the quality of the image and high
value of PSNR means high quality of image affected by low
quality of noise. PSNR is obtained from MSE and is given byPSNR = 10 log10 (L2 / MSE)

(4)

The performance of proposed scheme has been evaluated


under noise attacks. The first row of Fig. 6 shows the attacked
watermarked cameraman images where the attacks have been
done by salt and peppers noise with increasing noise
intensities. The second row of Fig. 6 shows the corresponding
extracted watermarks from the attacked cameraman images,
which indicate that the proposed watermarking scheme is
robust against salt and peppers noise attack.
The watermark can also be extracted from the cropped
image. The first row of Fig. 7 shows that the watermarked
cameraman image is cropped in various positions. The
extracted watermarks from the cropped images are shown in
the second row of Fig. 7. Therefore, it can be said that the
proposed method is also robust against cropping attack.
Fig. 8(a) shows the relation between EBR (%) and salt &
pepper noise intensity. From the Fig. 8, it can be seen that the
error bit rate is only 10% when the noise intensity is 0.2
(which is large enough to attack the whole image). Fig. 8(b)
shows the relation between EBR (%) and cropped image (%).
This figure shows that the EBR is only 25% when the 50% of
the image has already been cropped.
TABLE I shows the comparison results of MSE and PSNR
of the proposed method with other existing methods. The
proposed method has been compared with the chaotic system
based two existing methods in [8] and [14]. Several images
have been used for the comparison results. It can be seen from
the TABLE I that low values of MSE are obtained from the
proposed method compared to the existing methods in [8] and
[14] for all images. At the same time, investigating the
TABLE I it can be seen that high values of PSNR are obtained
from the proposed method compared to the existing methods
in [8] and [14] for all given images.
TABLE II shows the comparison results of EBR between
the proposed method and other two existing methods in [8]
and [14]. In this case, the Sailboat image which is shown in
Fig. 5(b) has been taken as the test image. Low value of EBR

978-1-4799-5180-2/14/$31.00 2014 IEEE

3rd INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION 2014

TABLE I.
Test
images

COMPARISON RESULTS OF MSE AND PSNR


Method [8]

Method [14]

Proposed
method

MSE

PSNR

MSE

PSNR

MSE

PSNR

Fig. 4(a)

0.5482

50.7413

1.897

45.35

0.4997

51.1437

Fig. 5(a)

0.5518

50.7129

1.932

45.27

0.5032

51.1134

Fig. 5(b)

0.5501

50.7261

2.255

44.6

0.5014

51.1289

Fig. 5(c)

0.5410

50.7986

1.892

45.36

0.4927

51.2049

Fig. 5(d)

1.025

48.025

3.163

43.13

0.9299

48.4464

proposed method is also capable of locating the tampered


areas when the image is attacked by the third parties.
REFERENCES
[1]

[2]

[3]

[4]

[5]
TABLE II.
Attacks

Cropping

Salt &
pepper
noise

COMPARISON RESULTS OF EBR

Cox IJ, Matthew LM, Jeffrey AB, et al. Digital Watermarking and
Steganography. Second edition, Burlington, MA: Morgan Kaufmann
Publishers (Elsevier); 2007.
Chandra M. B. and Srinivas K. S., Robust Multiple Image
Watermarking Scheme using Discrete Cosine Transform with Multiple
Descriptions, International Journal of Computer Theory and
Engineering, vol. 1, no. 5, pp. 17938201, 2009.
W. H. Lin, Y. R. Wang, S. J. Horng, A wavelet-tree-based
watermarking method using distance vector of binary cluster, Sci.
Direct Expert Systems with Applications, vol. 36, pp. 98699878, 2009.
Ramani K.; Prasad E.V, Varadarajan S.; Subramanyam A,"A Robust
Watermarking Scheme for Information Hiding", Advanced Computing
and Communications, 16th International Conference, pp. 58 64, 14-17
Dec. 2008.
Ayman, M.A. and D.D. Dwight, Applications of the naturalness
preserving transform to image watermarking and data hiding, Sci.
Direct Digital Signal Process., vol. 14, pp. 531-549, 2004.
Xiao-Li, N., L. Ju, S. Jian-De and Q. Jian-Ping, A Novel watermarking
Method with Image Signature, Springer-Verlag Berlin Heidelberg, pp:
293-298, 2006.

Method [8]

Method
[14]

Proposed
method

[6]

EBR (%)

EBR (%)

EBR (%)

[7]

5%

4.69

6.00

2.57

Li, C.T. and Si, H. Wavelet-based fragile watermarking scheme


for image authentication, J. Electron. Imaging, vol. 16, Issue 1,
Pp. 17-22, 2007.

[8]

10%

9.10

11.00

4.95

15%

14.05

15.00

7.68

0.10

3.82

4.00

3.64

0.15

7.69

8.00

7.56

0.20

10.05

12.00

9.84

S. Rawat, B. Raman. A chaotic system based fragile watermarking


scheme for image tamper detection, Sci. Direct International Journal of
Electronics and Communication, vol. 65, pp. 840-847, 2011.
Monzoy, M.; Salinas, M.; Nakano, M. & Prez, H., Fragile
Watermarking for Color Image Authentication, 4th Int. Conf.
Electrical and Electronic Engineering (ICEEE 2007), pp. 157-160,
2007.
Saraju, P.M., R. Sheth, A. Pinto and M. Chandy, .Crypt Mark: A Novel
Secure Invisible water-marking technique for color images, IEEE
International Symposium on Consumer Electronics pp: 1-6, 2007.
B Surekha, Dr GN Swamy, A Spatial Domain Public Image
Watermarking, International Journal of Security and Its Applications
vol. 5 No. 1, January, 2011.
A. L. A. Dalhoum, B. A. Mahafzah, A. A. Awwad, Ibrahim Aldamari,
Alfonso Ortega, Digital Image Scrambling Using 2D Cellular
Automata, IEEE Computer Society, pp. 28-36, 2012.
Rongrong Ni , Qiuqi Ruan, Yao Zhao, Pinpoint authentication
watermarking based on a chaotic system, science direct Forensic
Science International, vol. 179 , pp. 5462, 2008.
G.Rosline Nesakumari, S.Maruthuperumal, Normalized Image
Watermarking Scheme Using Chaotic System, International Journal of
Information & Network Security, Vol.1, No.4, pp. 255~264, October
2012.
Shao-Hui Liu, Hong-Xun Yao, Wen Gao, Yong-Liang Liu, An image
fragile watermark scheme based on chaotic image pattern and pixelpairs, Applied Mathematics and Computation, vol. 185, pp. 869882,
2007.
P. N. Khade and P. M. Narnaware, 3D Chaotic Functions for Image
Encryption, IJCSI International Journal of Computer Science Issues,
vol. 9, Issue 3, No 1, May 2012.

Intensity

indicates extracted watermark is almost similar to the original


watermark. Investigating TABLE II, it can be seen that the
proposed method gives low value of EBR than the methods in
[8] and [14] which proves that the proposed method is robust
against cropping and salt and pepper noise attacks.

[9]

[10]

[11]

[12]

[13]

[14]

V. CONCLUSION
In this paper, chaotic system based fragile image
watermarking scheme has been proposed. Two dimensional
Arnolds cat map has been used to scramble the image. Three
secret keys are obtained for the proposed method. The
watermark can be extracted from the watermarked image
using the correct keys. By investigating the experimental
results, it can be said that the proposed method gives low
values of MSE and high values of PSNR compared to the
existing methods in [8] and [14] which is required for image
watermarking. The proposed method also gives low value of
EBR compared to the existing methods in [8] and [14]. This
property proves the robustness of the proposed method. The

[15]

[16]

978-1-4799-5180-2/14/$31.00 2014 IEEE

You might also like