2011 International Conference on Electronic & Mechanical Engineering and Information Technology

Watermark Algorithm for Color Image Authentication and Restoration

H o n g w e n Lin, Shaoqing Yang, Linzhou X u Dept. of Information and Communication Engineering Dalian Naval Academy Dalian Liaoning, China yunzheyue0132@163.com, sqyang@online.ln.cn, xulinzhou@yahoo.com AbstractAn authentication watermark algorithm for color image tampered region detection and recovery is proposed in this paper. The watermark is generated by the host image, and it is embedded in the 7th and 8th bit planes of the host image. During authentication process, rough judgment step and accurate judgment step are performed in series, thus marks the tampered region correctly. The tampered regions may be restored by the regions not tampered. Experimental results show that proposed method has good invisibility, and is suitable for accurate authentication and recovery based applications. Keywords- image authentication; image restoration; fragile watermark; image tamper localization
I. INTRODUCTION

section 3, experimental results and performance analysis are presented. At last, we state some conclusions in section 4.
II. PROPOSED METHOD

The proposed method consists of watermark generation and embedding process, watermark extraction and tamper localization process and image recovery process. A. Watermark generation and embedding Let I be the host color image of size MxM, it is decomposed into IR> IG and IB which denote the red, green and blue components of the host image respectively. For each component, the embedding process is the same. The process of the red component IR is introduced as an example. (l)The 2 least significant bits (LSB) of all pixels in red component IR are set to zeros, and the modified component is represented as IR1. (2)IR1 is partitioned into non-overlapping blocks of 2x2 pixels. The blocks are numbered from top-to-bottom and left-to-right, thus each block may be denoted as IR\(i) , / = l,2,...,MxM/4 (3)For each block IR\(j) IRl(j) , use blocking mapping sequence generation method to find its mapping block , and store the sequence number pair [/, j] .The mapping process is as follows:

With the development of multimedia processing software, it is easy to modify multimedia documents, and it's hard to identify whether a file is modified directly, this brings challenges to content authentication and copyright protection of digital media. Digital watermark, also called tamperproofing or content verification, provides a possible solution to the above issue, it hides a secret and personal message to protect a product's copyright or to demonstrate its data integrity. Watermark can be classified into two types according to its function, namely authentication watermark [14] and copyright protection watermark[5'6]. The former is used to detect whether a digital content is modified, forged or specially manipulated. Invisibility of watermark, precision of tamper localization and recovery capacity are parameters that must be considered when design a authentication watermark. The latter is used to validate copyright information, it can extract watermark from tampered digital media correctly and thus protect the benefit of the copyright owner. The main requirements of copyright protection watermark are copyright invisibility, embedded data capacity, robustness against most attacks the image could undergo and security. In the past, lots of work have been done on the research of authentication watermark for color image[1'2], most authors are mainly concentrated in whether images are tampered and tampered region location, but tampered regions are not recovered. In this paper, we propose a color image authentication watermark method which not only locates the tampered region correctly but also recovers the tampered image content. The organization of this paper is as follows: The section follows provides the main idea of the proposed method. In

j = [(m x N) mod /] +1
where / , j N = MI are sequence numbers of the

^
block,

4 ,is the total numbers of the block. In order to

obtain a one-to-one mapping , m e [0, TV 1] must be a prime number and is used as a secret key. (4)For each sequence number pair [/, j], calculate the

mean of block IRl(i) and quantized it by a quantization step Q, the quantized number is converted to binary number and stored in the 8th bit planes of IRl(l) and the 7 th bit planes of IRl(j). The same work is done to component IG and IB, note that the prime number in step(3) is different for the three components, which is denoted as ml, ml and m3 . At last, the three modified components are composed to generate watermarked image IM.

978-l-61284-088-8/ll/$26.00 2011 IEEE

2773

12-14 August, 2011

B.

Watermarks extraction and tamper localization

DR\i)

= 0 , the corresponding block IMR{i) is authentic.

is invalid;

Let IM represent the image to be verified, it is decomposed into IMR> IMG and 1MB which denote the red, green and blue components of IM. For each component, the extraction process is the same. The processing of the red component is introduced as an example. (l)The 2 least significant bits of all pixels in red component IMR are set to zeros, the modified component is denoted as IMR1. (2) IMR and IMR1 are partitioned into non-overlapping blocks of 2x2 pixels. The blocks are numbered from top-tobottom and left-to-right, thus each block of IMR and IMR1 may be denoted as IMR(j) and IMR\(P) respectively, / = l,2,.Jl/xM/4. (3)Calculate the mean of each block IRM\(l) and quantized it by quantization step Q, the quantized value is denoted as MeanIMRl ( / ) . (4)Extract binary data from the 7 th and 8th bit planes of block IMR(l) which may , and convert them to decimal numbers, be represented as IMR_bitl(j) and

otherwise, the block IMR(l)

We also get the other two arrays DG and DB which depict the validity of IMG and 1MB. If one of DR'(i) , DG'(i) and DB'(i) ' s value is 0, the 1th block of IMR is marked as tampered. C. Image recovery For each component, the recovery procedure is the same, it is presented as follows(the red component is introduced as an example). (l)Scan all the block of IMR, for each block IMR(i), DR\i) nothing; otherwise, find out IMR(i) if = 1, this means the block is not tampered, we do 's mapping block

IMR(j)

, if DR'(j) = l,

use IMR_bitl(j)xQ
,and set DR\i)

to
to 1;

replace all the pixels in block IMR(i)

IMR_bit8(i).
(5)For each block IMR(j), IMR(j) using method described in and find , record the triple subsection II.A to find its mapping block IMR(j), 's mapping block IMR(k)

[/, j \ k]. Note that, the prime number m must be the same as watermark embedding process. (6)Get a triple [i,j,k] , the authentication of block IMR(j) is a two-step process. Step 1. Rough judgment

if DR'(j) = 0, do nothing. (2)Scan all the block of IMR again, for each block IMR(i) , if DR'(i) = 0 , calculate the number of pixels whose value is 1 in its 8-neighborhood, if the number exceed a threshold th2, IMR(i) is replaced by the mean of the recovered blocks in its 8-neighborhood, and DR (/) is set to 1; otherwise, do nothing. (3)Repeat step(2), until all the values of DR do not change.
III. EXPERIMENTAL RESULTS AND DISCUSSION

1 (MeanIMRlU) = IMR_bit8(j)) and (MeanIMRl(i) = IMR_bitl{j) or MeanIMRl (j) = IMR _ bitl{k)) DR(j) = 0 MeanIMR1(j)*IMR_bit8(j) -1 else
DR(j) = 1 means IMR(j) is not tampered, DR(j) means IMR(j) is tampered and DR(j)

In this section, some experimental results are given to illustrate the invisibility of watermark, precision of tamper detection and recovery capacity of the proposed method. Several color images of size 256 X 256 are adopted in our experiments. For convenience, the "flower" color image is taken as an example for our discussion. Set the quantization factor Q to 16, the threshold thl and th2 to 4 and 3, respectively. A. Invisibility of watermark The invisibility of watermark is measured through peak signal-to-noise ratio (PSNR), which is defined as follows.

(2) = 0

= 1 represents

whether IMR(j) is tampered is still unknown. Step 2. Accurate judgment DR is rearranged into a M12xM12 matrix, denoted as IDR. For each element IDR(x,y) of IDR, if IDR(x,y) = 1, calculate the number of element whose value is 1 in its 8-neighborhood, if the number exceed a threshold th\ , IDR(x,y) is set to 1, otherwise it is set to 0. IDR(x,y) DR' , DR' is rearranged into an 1-dimensional array depict the validity of each block, if

f2 PSNR = 10 log10 ^ 10 (MSE(R) + MSE(G) + MSE(B)) 13

(3)

YLv>(u)-Mk{ij)?
MSE(k) = - ^
Where Ik and IMk

MxN

(4)

are the k color component of host is the maximum gray value

image and marked image. flmx

2774

of IMk,

the size of host image and watermarked image is

MxN. The proposed algorithm modifies the 2 LSBs of the host image, for each pixel, the maximum variation in gray is 3, so the theoretical minimum value of PSNR is as follows:

For quantitative evaluation, two measures are introduced to evaluate the performance of tamper detection, they are detection ratio(DR) and false alarm ratio(FAR).

DR = Nc/NtxlOO% FAR = Nf/(N-Nt) x 100%

(5) (6)

PSNRmin=101og 255 2 x256x256/2^3 2

V / '=1 J=l

/256 256

The host image "flower" and watermarked image are shown in Figure 1(a) and (b). The PSNR of watermarked image respect to the original one is 44.1535, which shows that the watermark is imperceptible.

= 38.5884

Where N is the total number of blocks, Nt is the number of the tampered blocks, Nc is the number of tampered blocks which are correctly detected, Nf is the number of valid blocks which are falsely detected. TABLE I shows the quantitative evaluation results under different attack. As shown in TABLE I, the DR is very high, it is near to 100%. Additional experiments have been done to demonstrate that the FAP is less than 2% under the circumstances that the tamper ratio of watermarked image is not more than 30%.
TABLE I. Tampered Image Figure2(a) Figure2(b) Figure2(c) Nt 2315 2242 4824
RESULT OF QUANTITATIVE ANALYSIS

Nc 2312 2241 4824

Nf 2 4 50

DR 99.87% 99.96% 100.00%

FAR 0.01% 0.03% 0.43%

Figure 1. Host image and watermarked image

C. Recovery capacity The recovery capacity of our algorithm is scaled by PSNR of recovered image respect to watermarked image. The recovery of Figure2(a)-(c) are shown in Figure3(a)-(c), PSNR of each recovered image is 30.9877, 31.2409 and 29.8376 respectively. Experimental results show that the recovery ability drops with the growth of tamper ratio. For our test image, the relation between recovery capacity and temper ratio is shown in TABLE II. As shown in TABLE II, when the tamper ratio is less than 1/2, the proposed method can effectively recover the tampered image, while tamper ratio is less then 1/4, it can recover the tampered image exactly.
IV. CONCLUSION

B.

Precision of tamper detection

In this part, we list 3 kinds of attacks: daub, content replace and deletion, the attacked images are shown in Figure2(a)-(c), the tamper detection results are shown in Figure2(d)-(f), which illustrate the precision of our method. Note that white represents valid, and black represents invalid.

In this paper, we have presented a fragile watermark scheme based on spatial domain to address the issues of authentication and restoration of color image. Strong emphases are laid on the invisibility of watermark, localization accuracy and recovery capacity of tampered image. During authentication and recovery process, the original host image is not needed, so the proposed method is blind, it has strong practicability.
REFERENCES

[1]

[2]

[3] Figure 2. The localization of tamper region

HE Wen-hua. Chaotic Fragile Watermarking Algorithm for Color Image Content Authentication [J]. Journal of Hunan University(Natural Sciences),2009,36(l). pp 55-58. S. Shefali, S.M. Deshapande. Self Embedding Technique for Digital Color Image Authentication and Security[C]. Second International Conference on Industrial and Information Systems,2007.8,ppl47-152. WANG Guo-dong ,LIU Fen-lin, LIU Yuan, An Image Authentication Scheme with Discrimination of Tampers on Watermark or Image[J]. ACTA ELECTRONICA SINICA, 2008,36(7). pp 1349-1354.

2775

[4] [5]

LIU Dong-yan,LIU Wen-bo, ZHANG Gong. Research of Recoverable Semi-fragile Watermarking for Image Content. Journal of Image and Graphics,2010,15(l). pp 20-25. Liu S Z , Bovid A C. Efficient DCT-domain blind measurement and reduction of blocking artifacts [J]. IEEE Trans on Circuits and Systems for Video Technology, 2002, 12 (12). pp 1139-1149.

[6]

Barni M, Bartolini F, Cappellini V, etc. A DCT-domain system for robust image watermarking [J]. Signal Processing, 1998, 66(3). pp 357-372.

Figure 3. Recovery of tampered images

TABLE II. Tamper Ratio PSNR 1/64 43.8998 1/32 40.4655

THE RELATION BETWEEN TAMPER RATIO AND PSNR

1/16 37.9237

1/8 34.9541

1/4 31.4412

3/8 27.3578

1/2 24.2172

3/4 19.7973

2776