2011 Seventh International Conference on Computational Intelligence and Security

A Digital Watermarking Algorithm Based on Wavelet Packet Transform and BP Neural Network
Qiao Baoming, Zhang Pulin, Kang Qiao College of Science, Xian University of Science and Technology, Xian 710054 e-mail: qiaobm@xust.edu.cn
AbstractA new blind digital watermarking algorithm based on wavelet packet transform and BP Neural Network was proposed in this paper. The algorithm first decomposed the host image via discrete wavelet packet transform, then embedded water-marking into the position which was chosen by the key in wavelet image. In the process of embedding watermarking, eight neighborhood pixels around the embedded point was selected as sample input of the BP neural network, and the pixel value of the embedded point was chosen as the ideal output, finally, trained the neural network. Using the trained neural network, blind watermarking extraction was achieved. Keywords-component; formatting; style; styling; insert

pixels around the embedded point was selected as sample input of the BP neural network, and the pixel value of the embedded point was chosen as the ideal output, finally, trained the neural network. Using the trained neural network, blind watermarking extraction was achieved [1][11]. II.
WATERMARKING EMBEDDING ALGORITHM

A. The generation of waterarking sequences In the paper, a simple and effective method is adopted which is through the rearrangement of the binary watermark by columns, one-dimensional watermark sequence W, the size of K was obtained. B. Doing wavelet packet teansform for the original image Firstly, we did level 1 discrete wavelet transform for the original host image I, and then can get the approximate component CA, the level of detail component CH, the vertical detail component CV, and the detail of the angular component CD. This four sub-images formed Fig.1(b), Secondly, we performed level 1 discrete wavelet transform for the four components respectively. For example, After transforming CA, we obtained the approximate component CAA, the level of detail component CAH, the vertical detail component CAV, and the detail of angular component CAD. After transforming CH, the approximate component CHA, the level of detail component CHH, the vertical detail component CHV, and the detail of angular component CHD can be get; After transforming CV, the approximate component CVA, the level of detail component CVH, the vertical detail component CVV, and the detail of angular component CVD obtained, and after transforming CD, we had the approximate component CDA, the level of detail component CDH, the vertical detail component CDV, and the angular detail component CDD, The sixteen sub-images formed Fig.1(c), and Fig.1(a) is the original host image.

I.

INTRODUCTION

Digital watermarking is an important branch of the information hiding technology. The so-called digital watermarking is the digital signal which is not perceived to be embedded in digital carrier. It can be images, text, symbols, figures, and all can be used as identification information. A large number of perception redundancy part are common in multimedia data, so watermarking embedding in them can achieve the purpose of hiding. The basic idea that wavelet transform apply to image processing is decomposed the image by multi-resolution, then generate sub-image with different spaces and independent bands, at last, process the coefficients of subimage. The neural network has the characteristics of approaching non-linear mapping, and has good generalization ability. If a neural network was trained in the watermark embedding process, through studying, the corresponding relations of pixel values between before and after embedding the watermark signal is obtained, then the watermark can be extracted by using the trained neural network, thus the blind detection of the watermarking algorithm is achieved. This paper presents a new algorithm of digital watermarking based on wavelet analysis and neural network . The watermark was embedded in the wavelet image which was the host image after discrete wavelet packet transform, so that the watermarking could be embedded into a narrower and finer band, and the transparency and robustness of watermarking could be enhanced better. This algorithm decomposed the host image by discrete wavelet packet transform. Then watermarking was embedded into the position which was chosen by the key in wavelet image. In the watermarking embedding process, eight neighborhood
978-0-7695-4584-4/11 $26.00 2011 IEEE DOI 10.1109/CIS.2011.117 503

a

(b)

(c)

Fig.1 the flow chart of wavelet packet decomposition

C. The position selection of embedding watermark The wavelet packet transform domain was chosen to embed watermark. The method to select a position of embedding watermark was as following. Firstly, divided the image of wavelet packet coefficients into 3 3 blocks, Secondly calculate the standard deviation of each blocks, and arrange the standard deviation in ascending order. Then choose the block center, which the first K standard deviation corresponding to, as an embedding position, where K indicated the size of the watermark sequence. The position of embedding watermark must be known first when extract the watermark, so It is necessary to save the position matrix as a file by using the save command in MATLAB. The average formula for each block is 1 1 1 mean= s(i + m, j + n) (1) 9 m=1 n=1 The formula of computing variance for each block is 1 1 1 2 Var = (2) ( s (i + m, j + n) mean) 8 m = 1 n = 1 The formula of standard deviation for each block is

of nodes in hidden layer. The selection of nodes in hidden layer is very important for network training and studying. If hidden nodes is too few, the network would not have the necessary ability to learn and necessary information processing capabilities.

Fig.3 BP neural network

stadev = var (3) s (i + m, j + m) represent the wavelet coefficients of each block; s (i, j ) represent the wavelet packet coefficients of the center position in each block. Variable; m, n is the variation that other coefficients relative to the center position.

Conversely, too many hidden nodes increased the complexity of network structure greatly, and was easier for network to fall into local minimum in the learning process. Meanwhile, It made the network learn very slowly. The common method of selecting is the trail and error method, generally based on experience to select the hidden layer of nodes, was very random. The empirical formula for determining the number of hidden nodes is N = nm + cn + d (4) Where N is the hidden nodes; n is the number of input nodes; m is the number of output nodes; c, d is the parameters to be determined. In general, the following posterior formula is used. N = nm + 1.6799 n + 0.9298 (5) In this article, n = 8, m = 1, N 4.7 ,taking N = 5 ,The neural network has three layers, there were 8 nodes in input layer,5 nodes in hidden layer, 1 node in output layer. In coefficient image of wavelet packet S, the coefficient of wavelet packet which was selected to embed the watermarking was Sij , and the eight wavelet packet around it was
as the input of network. As shown above, the output of neural nodes in output layer was yij , the expected output of net-work was Sij . We select the embedding positions of K by the key, and these points and the points around them formed a learning sample space of the network. The network which is well trained is used for the blind detection of watermarking.

D. The establishment of the BP neural network model for watermarking The embedded technique of transform domain was used in this paper. And in order to improve the robustness, neural network was introduced, since it can fully approximate any complicated non-linear relationship. Thus the neural network model established can well describe the relationship between selected wavelet packet coefficients and their neighborhood. Neural network model is as following.
Si 1, j 1 Si 1, j Si 1, j +

Si , j 1

Si , j

Si , j +1

Si +1, j Si +1, j Si +1, j +

3 3 Coefficient blocks of wavelet packet Figure.2 is a 3 3 block of wavelet packet coefficients, the center was where the watermark is to be embedded. We select eight coefficients of wavelet packet around the center as the input of BP neural network, and the coefficient of center wavelet packet as the expected output, then train the neural network. Fig.3 was the structure of BP neural network. For the multi-layer network, the number of input nodes and output nodes are determined by the problem itself. Choosing the size of network is mainly determining the size
Figue2.

E. Embed watermarking Embed watermarking using the formula as following p (i , j ) = s (i , j ) + ( 2 + )( 2 w( k ) 1) (6) p (i , j ) was the wavelet packet coefficient of embedded watermarking, s (i, j ) was the k-th wavelet packet coefficients to be embedded according to the key; was the radio

504

of the standard deviation of the coefficient block and the maximum standard deviation of all the coefficient blocks; is constant, taking = 0.02 ; was adaptive embedding intensity, is fixed embedding strength; w( k ) represent the k-th position of watermarking.

was the wavelet coefficient graph after embedding watermark, Fig.9 was the training figure of BP neural network. The extracted watermark w2, shown in Fig.10, was the same visual effect as the image before embedding.

the Image embedded watermarking After embedding the watermarking, the image embedded watermarking is obtained by taking inverse wavelet transform.
III.

WATERMARKING EXTRACTING ALGORITHM

F.

The algorithm firstly decomposed the image of embedded watermarking by discrete wavelet packet. Then determine the embedding position by using the key, according to that, the input of BP network is determined. The simulation result of wavelet packet coefficient is obtained by the trained BP network simulation. After the step in front, extracted the watermarking using the formula as following 1, T1 ( k ) > y1 ( k ) w' ( k ) = (7) 0, T1 ( k ) y1 ( k ) Where k = 1 " K T1 ( k ) was the wavelet coefficient of the k-th embedded watermarking after discrete wavelet packet transform. y1 ( k ) was the coefficient of wavelet packet before embedding into the position where was simulated by BP neural network; w' ( k ) was the value of the k-th extracted watermark. At the last, rearranged the extracted watermarking sequence according to the key, binary watermarking image was obtained.
IV. THE IMPLEMENTATION OF ALGORITHM

Fig.5 Coefficient image of wavelet packet (ss)

Fig.6 Original watermark image (w)

Fig.4 Original host image(I)

In the algorithm, the watermarking image w, the original host image I and the image embedded watermark wx are respectively Figure.4, Figure.6 and Figure.8, the difference between the host image and the image embedded watermark was invisible, and It was successful for the transparency of the algorithm. Fig.5 was wavelet packet coefficient image after the decomposition of the original host image, Fig.7

Fig.7 Coefficient image of wavelet packet embedded watermarking (p)

The experimental results indicated that there were no visual differences between host image and the image embedded watermark. And the watermarking had good imperceptibility. The peak signal to noise ratio

505

was PSNR = 37.2035 , the extracted watermark and the original watermarking similarity was NC = 1 .

REFERENCES [1]. G.Voyatzis, I.Pitas, The Use of Watermarks in the Protection of Digital Multimedia Product, Proceedings of the IEEE.1999,87(7):1197-1207. [2]. John M.Acken, How watermarking Adds Value to Digital Content, Communication of the ACM , 1998, 41(7):74-77. [3]. L.F.Turner, Digital data security system, Patent IPN W089/08915,1989. [4]. Van Schyndel R.G, ,Tirkel A.Z, Osborne C.F, A digital watermark, International Conference on Image Processing, 1994,(2):86-90. [5]. Walter R.Bender, Daniel Gruhl,Norishige Morimoto, Techniques for data hiding, Masssachusetts Institute of Techology Media Lab,1994. [6]. Brassil J.T, Low S; Maxemchuk N.F, Lucent Technol, Bell Labs, Murray Hill NJ, Copyright Protection for the Electronic Distribution of Text Documents, Proceedings of the IEEE,July 1999,87(7):1181-1196. [7]. Dong Zheng, Jiying Zhao, RST Invariant Digital Image Watermarking:Importance of Phase Information, The IEEE Canadian Conference on Electrical and Computer Engineering(CCECE)2003. [8]. Shizhong Liu, Bovik A.C, Efficient DCT-domain blind measurement and reduction of blocking artifacts, IEEE Trans on Circuits and Systems for Videa Technology,2002,12(12):1139-1149. [9]. Deepa Kundur, Dimitrios Hatzinakos, A Robust Digital Image Watermarking Method Using Waterlet-Based Fusion, Proc, of ICIP 97,1997,1:544-547. [10]. Davis K.J, Najarian K, .Maximizing strength of digital watermarks using neural networks, Proceedings of the International Joint Conference on Neural Netwoks,2001,4:2893-2898. [11]. Justin Picard, Arnaud Robert, On the public key watermarking issue Proceedings of SPIE, 2001, 4314:290-299.

Fig.8 Image embedded watermarking (wx)

Fig.9 Training figure of watermarking image

Fig.10 Extracted watermark (w2)

506