International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856

Robust Reversible Watermarking For Geometric Attack by Proposed Pixel Replacement Method
Dr.Rajendra D.Kanphade1 and Mr.Navnath S. Narawade2
Member IEEE and Professor in Dept of E&TC Engg, Nutan Maharashtra Institute Of Technology And Engineering, Talegaon(D), Pune, India. Research Scholar, Dept of Electronics Engg. Sant Gadgebaba Amravati University, Amravati. Amravati, India Abstract: Reversible watermarking is broadly used in
military and medical applications. In this paper we are presenting a novel pixel replacement method, whose watermark is robust to geometric attack as well as it has maximum embedding capacity than all histogram shifting methods. This idea is generated from histogram shifting method, a well known method for reversible watermarking. Our method also maintains comparable quality of watermarked images. Other techniques affected with geometric attacks such as rotation, scaling and translation are not robust watermarking techniques. They do not recover 100% similar watermark and image with original. Our few modifications proved that our method is robust watermarking method with 100% similarity between original and recovered watermark. In our method, PSNR is slightly reduced than histogram shifting method, (minimum 48 dB) but still it is higher than Dinu Coltucs RCM method and Tians Difference expansion method. The embedding capacity of our method is more than histogram shifting method but it is lesser than RCM and difference expansion method. By compromising quality of watermarked image, embedding capacity can be improved more than difference expansion, RCM and histogram shifting method. Our proposed replacement method is less complex than difference expansion and RCM method. So optimizing quality and embedding capacity, this method can be made superior. This method gets a crown in her head, as we have made it robust watermarking for geometric attack by combining with existing Geometric Transformation Correction method.
2 1

Keywords- Reversible Watermarking, histogram shifting, embedding capacity, processing time, PSNR, robust and geometric attack.

1. INTRODUCTION
Jun Tian[1] have introduced reversible watermarking using two techniques, difference expansion and generalized least significant bit embedding, to achieve very good embedding capacity. Alattar derived a Volume 2, Issue 1 January - February 2013

difference expansion transform for triplets and extended Tians algorithm to embed two bits in every triplet of pixels. Dinu Coltuc [2] developed a simple and efficient reversible hiding scheme based on reversible contrast mapping (RCM), which does not need location maps to recover the host image. However, their scheme can not fully control the position where information is embedded, so the quality of the stego image is poor. Tzu-Chuen Lu et. al. removed these drawback and presented new form of RCM in 2008. Histogram shifting method is one of the best method of reversible watermarking. Wien Hong [3] have modified this method and introduced fast method. Histogram shifting technique presented by Ni. Et. Al.[4] have disadvantage that it has more complexity due to image is scanned three times. A modified histogram shifting is presented by Wien Hong, Tung Shou Chen, Kai yung Lin, Wen Chin Chiang(2010)[3], who reduced complexity and improved quality of image. He presented a restricted payload by the distribution of pixel values. In general as an image histogram with greater peak height, the image should have a greater payload. This drawback has been reduced by Mr. Navnath Narawade[5-6] and Dr. Rajendra Kanphade . They have presented improved embedding capacity reversible watermarking than Hongs modified histogram shifting method. They have improved embedding capacity as well. But nobody have thought about robust watermarking for geometric attack. We here present a robust reversible watermarking technique for geometric attack. Watermarking techniques with maximum 90% similarity between original and recovered watermark as well as maximum 90% similarity between original and recovered image is a reality till today. The techniques in the reversible watermarking can roughly be categorized into five types[7], namely Difference expansion[1], Histogram shifting[3], Contrast Mapping[2], Integer Wavelet Transform[8],modulo 256 addition [9], lossless multi resolution transform [10], Page 186

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
circular interpretation of bijective transformation [11], etc. Here in this paper we have developed an algorithm which has increased embedding capacity at the cost of quality of a watermarked image. Our method not only embeds binary image but also suitable for grayscale watermarks. Our method is suitable for color image watermark also. Our method is suitable for military applications where original map images are important. Geometric attack:Consider an image and a rotated, scaled, and translated version of this image, . Then we can write Where RST parameters are respectively. All above attacks may be applied separately. Global geometric transformation correction method can be combined with our proposed method in extraction to understand strength of RST attack. We abbreviate this distortion correction method as GTC method[12]. GTC method uses geometric moments (M), information like its size rowcol, Invariant Centroid IC, radius r, and signs of moment and to understand attack factor. Step 3: (a) From the key K (where position of pixel values were recorded), get pixel values and store it as a wtr_dec pixels. (b)Replace these recorded pixels by a, in watermarked image. (c)Convert wtr_dec to binary values using bin2dec command and recover it as extracted watermark. Step 4: Continue step 3 upto end of watermark. If counter k becomes greater than length of watermark, do not change any value upto end of image scanning completes. Table I: PSNR(dB) of our proposed method. (Abbreviations Used:RCM-Reversible contrast mapping, DEM-Difference expansion method HSM-Histogram shifting method 8BRM-Proposed 8 bit replacement method NA- Not applicable (method is not suitable for these images) (Size of Image is 512x512)
Lena complexity 8 BRM 40.12 less RCM 29.10 More moder ate DEM 32.44 maxim um HSM 51.04 moder ate

2. PROPOSED METHOD
Embedding: Input: Original 8 bit grayscale image I, with MxN pixels and watermark Iw. Output: Watermarked image Iw, and key with the peak point a, and its locations alongwith length of watermark. Step 1: Scan the image I and construct its histogram H(x)[0, 255]. In this histogram obtain peak point a. Step 2: Record the position of pixel value a which is maximum, called key K. Step 3: Scan the watermark. If watermark is binary convert it into decimal value by strcat command. Each value is named as w_d. If counter k is less than length of watermark (a)If scanned pixel value is a, make it w_d. Step 4: Continue step 3 upto end of watermark. If counter k becomes greater than length of watermark, do not change any value upto end of image scanning completes. Extraction and Restoration: The extraction and restoration procedure is given below. Input: Watermarked Image Iw , the peak point a, the key K and the length of the watermark l_w. Output: Original 8 bit grayscale image I and the recovered watermark Iw. Step 1: Scan the image in the same order as in the embedding phase. Step 2: Set counter k=0, k is used to indicate length of watermark. For k is less than length of watermark, l_w, go to step 3 else step 4. Volume 2, Issue 1 January - February 2013

Table II: Embedding Capacity (Bits) of our proposed method 8 BRM RCM DEM HSM Method
Lena 17880 12737 6 13107 2 2235

Table III: Comparison of Pixel Similarity (%) of our proposed 8 bit pixel replacement method (combined with existing geometric transformation counter geometric attack method) (Abbreviations Used:- NCGA-No Counter Geometric Attack, SP-Spy Pixel) a. Extracted Watermark and Original Watermark on Lena Image
8 BRM
Without attack RotationA ttack (900,1800, 2700) Scaling Attack (2) Translatio n Attack(10 ) Exponenti al Pixel Attack(e^ 1.1) NC GA 100 NA GT C 100 100

RCM
NC GA 100 NA GT C 100 100

DEM
NC GA 100 NA GT C 100 100

HSM
NC GA 100 NA GT C 100 100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

NA

100

B. Recovered Image and Original Image 8 BRM RCM DEM HSM

Page 187

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
NC GA 10 0 NA GT C 10 0 10 0 NC GA 10 0 NA GT C 10 0 10 0 NC GA 10 0 NA GT C 10 0 10 0 NC GA 10 0 NA GT C 100 10 0

Without attack Rotation Attack (900,180 0 ,2700) Scaling Attack (2) Translati on Attack(1 0) Exponent ial Pixel Attack(e ^1.1)

NA

10 0 10 0

NA

10 0 10 0

NA

10 0 10 0

NA

10 0 10 0

NA

NA

NA

NA

NA

10 0

NA

10 0

NA

10 0

NA

10 0

Due to above method we got 100% pixel similarity of watermark and cover object, which means our proposed method is robust against geometric attack. While recovering against geometric attack we could improve embedding capacity of original image. We also preprocessed our binary watermark. This preprocessing is essential only for binary watermark. Other gray level or color watermark do not needs preprocessing. Result table 1, shows that embedding capacity of our method is more than HSM and quality is more than RCM and DEM. Our method is a compromised method for embedding capacity and quality. Other methods such as RCM is not suitable for all images. Our proposed method is more suitable for cartoon and medical images.

4. CONCLUSION AND FUTURE SCOPE

In this paper we have presented reversible watermarking by replacement method. We made this method more robust to geometric attack. The attacks that has been applied on this method are listed in the above paragraph. The attacks are counter measured by our algorithm. No any method gives 100% similar watermark and cover object. Hence it gives 100% similarity between recovered watermark and original watermark. While recovered image is also 100% similar to cover object. Hence our method become robust to geometric attack and reversible. The embedding capacity of our robust watermarking is slightly reduced by 8 bits, which is negligible. The PSNR of our method is affected by robust method. Our method is only suitable for predefined geometric attack. Our proposed robust reversible watermarking replacement method gives more embedding capacity than histogram shifting method by maintaining comparable quality of watermarked image. Quality in our method has been slightly reduced than histogram shifting method as shown in the result table. But still we got it higher than Dinu Coltucs RCM method and Tians Difference expansion method. The embedding capacity of our method is more than histogram shifting method but it is lesser than RCM and difference expansion method. By balancing required quality and embedding capacity to a optimistic level, our method can become best suitable than difference expansion, RCM and histogram shifting method. Our method is less complex than difference expansion and RCM method as it deals towards pixel replacement method. Handling of other distortions still remains a challenge. Other attacks on the image gave false results. It may be a future scope for the researchers.

Fig.1: Above images show vast use of our method.

3. EXPERIMENTAL RESULT DISCUSSION

Result table shows that 8 BRM method gives less PSNR as compared to HSM. But more PSNR as compared to other methods such as DE and RCM method. Its embedding capacity is also optimum as shown in result table. The attacks are (1)Rotation attack- If image is rotated with 900, 1800, 2700 , then GTC recognizes this attack and degree of rotation. Our algorithm counter attacks this rotation and rotate the image with -900, 1800, -2700. (2) Scaling attack- GTC also recognizes the scaling attack on the image. The value of scaling has been recognized by our method and then counter scaling attack is done on the image which result into attack free watermark image. We have tested our algorithm with scaling factor of 2 and e^2,e^1.2,e^3 local exponential scaling attack. (3)Translation attack- GTC recognizes the value of translational attack. The value is retranslated into whole image and then this image is processed for extraction of watermark. We have translated our image from 1 to 90 pixel values whose output gave 100% recovered watermark and cover object.

REFERENCES
[1] Tian, J. Reversible data embedding using a difference expansion, IEEE Trans. Circuits Syst. Video Technol., 2003, 13, (8), pp. 890896 [2] Dinu Coltuc and Jean-Marc Chassery,Very Fast Watermarking by Reversible Contrast Mapping, 1070-9908/$25.00 2007 IEEE, SIGNAL Page 188

Volume 2, Issue 1 January - February 2013

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
PROCESSING LETTERS, VOL. 14, NO. 4, APRIL 2007,pp. 255-258. [3] Wien Hong, Tung Shou Chen, Kai Yung Lin and Wen Chin Chiang, A modified histogram shifting based reversible data hiding scheme for high quality images, 2010 Asian Network for Scientific Information, Information Technology Journal, 9(1),2010, 179-183. [4] Junxiang Wang and Jiangqun Ni, A FAST PERFORMANCE ESTIMATION SCHEME FOR HISTOGRAM SHIFTING BASED MULTI-LAYER EMBEDDING, IEEE 17th International Conference on Image Processing, pp. 3701-3704, September 26-29, 2010 [5] Mr.Navnath Narawade, Dr. Rajendra Kanphade,An Increased Quality and Embedding Capacity Histogram Shifting Based Reversible Watermarking, IUP journal of telecommunication. [6] Dr. Rajendra D. Kanphade and N.S. Narawade, Forward Modified Histogram Shifting based Reversible Watermarking with Reduced Pixel Shifting and High Embedding Capacity International Journal of Electronics and Communication Engineering.ISSN 0974-2166 Volume 5, Number 2 (2012), pp. 185-191. [7] Navnath Narawade1 and Dr. Rajendra Kanphade, Reversible Watermarking: A Complete Review, International Journal of Computer Science and Telecommunications, Volume 2, Issue 3, June 2011,pp. 46-50. [8] Xuan, G.R., Yang, C.Y., Zhen, Y.Z., and Shi, Y.Q.: Reversible data hiding using integer wavelet transform and companding technique.Proc. IWDW, 2004. [9] Goljan, M., Fridrich, J., and Du, R.: Distortion-free data embedding for images. 4th Information Hiding Workshop, LNCS, vol. 2137, Springer-Verlag, New York, 2001, pp. 2741. [10] B. Macq, Lossless multiresolution transform for image authenticating watermarking, in Proc. EUSIPCO, Sept. 2000, pp. 533536. [11] C. De Vleeschouwer, J. F. Delaigle, and B. Macq, Circular interpretation of bijective transformations in lossless watermarking for media asset management, IEEE Tran. Multimedia, vol. 5, pp. 97105, Mar. 2003. [12] Mohammad Awrangjeb, Manzur Murshed, and Guojun Lu,Global Geometric Distortion Correction in Images,IEEE conf. AUTHORS
Dr. Rajendra D. Kanphade is presently Principal of Nutan Maharashtra Institute of Engineering and Technology, Pune. He has joined SSGM College of Engineering, Shegaon in 1987. He has been Head of the Electronics Department for the period Oct 2003 to Jan 2006 and also Incharge of VLSI & Embedded System Design Center of SSGMCE, Shegaon. He has completed B.E. (Electronics) degree from SGB Amravati University, Amravati in the year 1987 & M.E (Electronics) from Dr. Babasaheb Ambedkar Marathwada University, Aurangabad in the year 1993. He received Ph.D.(Electronics Engg.) degree from SGB Amravati University, Amravati. His areas of research are VLSI and Embedded system Design, Analog and Mixed Signal Design. He has completed his Ph. D degree from SGB Amravati University, Amravati. He is a member of IEEE, IETE and ISTE. He has published different papers in international journals and Conferences. Mr. Navnath S. Narawade is a research scholar at Electronics and Telecommunication Engg department at Sant Gadgebaba Amravati University , Amravati. He received the M.E.(Electronics and Telecommunication Engg) in 2005 from Govt. College of Engg, Pune under University of Pune, B.E.(Electronics ) from Walchand College of Engg, Sangli under Shivaji University ,Kolhapur. His research interests are focused on image and signal processing, particularly in robust reversible watermarking.

Volume 2, Issue 1 January - February 2013

Page 189