Documente Academic
Documente Profesional
Documente Cultură
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 2, July August 2012 ISSN 2278-6856
Keywords: Reversible watermarking, DCT, geometric attack, high and middle frequency coefficients, PSNR.
1. INTRODUCTION
With increase in technology, usage of digital media has increased tremendously. With the increasing availability of digitally stored information and the development of new multimedia services, security questions are becoming even more urgent. The acceptance of new services depends on whether suitable techniques for the protection of the watermarks are available? The development of Internet and numerous hardware and software applications have created a need for security. In a military applications, where the hidden data is of prime importance. A map of a specific region is hidden inside a image. Though image is affected with geometric attack such as translation and scaling attack, our method Volume 1, Issue 2 July-August 2012
recovers 100 % similar to original map. Recently, with the quick development of multimedia and network technologies, the transmission of digital products has become more widespread. Because digital products can quite easily be copied and modified, the problem of protecting their copyrights will be seriously challenged. Digital watermarking, which is an auxiliary method for traditional encryption measures, can effectively protect the copyrights of digital products. J.R.Hemandez,M.Amado have presented DCT domain watermarking techniques for still images .They have analyzed DCT domain with frequency coefficients[1]. Yi Du, Ting Zhang have analyzed A Reversible and Fragile Watermarking Algorithm Based on DCT. They have changed high frequency coefficients as per embedding bit value. This algorithm has less embedding capacity.But this algorithm is very robust to geometric attack[2]. B. Yang, M. Schmucker, X. Niu, C. Busch, S. Sun says that Integer DCT Coefficients techniques with Histogram Modification is reversible[3]. Basic DCT algorithm is useful for reversible watermarking[5-7]. According to the differences in capacities of thwarting attacks, digital watermarking can be classified into robust watermarking, semi-fragile watermarking and fragile watermarking. Robust watermarking is quite robust to modification and mainly used to protect intellectual property of digital products. Semi-fragile watermarking is partly robust, but its only fragile to intended tampering[8]. Fragile watermarking, which is fragile to each kind of modification, is mainly used for authentication of integrity and reliability of digital products. In some fields, such as military, medical and legal fields, the requirements for the quality of images are rigidly demanded, i.e., any drop in image quality isnt permitted if the embedding of the watermarks leads to the drop. A new type of watermarking technology called reversible watermarking is presented recently to meet such needs . Reversible means that watermarked images can be restored to original ones, which also means that watermarks can be completely reversed. Reversible watermarking has a widely used prospect, so it has caused many emphases from information scientists [2]. A Page 27
. where, IDCT:f(x,y)=
Watermark
Original Image
DCT
Embedding Process
IDCT
Watermarked Image
Extraction Process
DCT
Watermark
Original Image
Figure 1 Block Diagram In this paper, watermarks can be embedded in the DCT domain. The image with the size of MN ( M and N both are the integral times of eight) will be divided into blocks of 88 pixels, and then the total number of blocks is defined as , which can be given as follows
represents the block. One way is to add zigzag scanned DCT coefficients, starting from as shown in a table I, which makes calculations complex, and other way to arrange the coefficients in a simple linear order as shown in table II, starting from . Linear consideration of coefficients are nothing but addition of middle and high frequency coefficients which are bottom two rows. DCT coefficients whose orders are from in each compose a set of high frequency coefficients called The number and the total value of elements
Page 28
Table 2 DCT straight scanning order for high and middle frequency.
15
10
Si
-5
-10
-15
20
10
Si
-10
-20
-30
200
400
600 Di
800
1000
1200
Page 29
1) Read the original image. 2) Divide it into blocks of size 8*8. 3) Perform DCT operation on each block of size 8*8. 4) Take watermark to be embedded and find its binary sequence. 5) If watermarking bit is 0,then no changes to be made in 3. RESULT 8*8 blocks Si. 6) If watermarking bit=1,then changes to be made in DCTed blocks Si. Table 3: Result table
DCT Embedding in High freq components Sr.No. Image Attack PSNR Similarity measure of extracted watermark with original watermark 100% 100% 60.93% 100% 100% 60.54% 100% 100% 60.54% 100% 100% 60.54% 100% 100% 60.54% 100% 100% 60.54% 100% 100% 60.54% 100% 100% 60.54%
Lena
18.07 18.07 18.07 22.46 22.46 22.46 9.75 9.75 9.75 13.23 13.23 13.23 19.50 19.50 19.50 24.09 24.09 24.09 22.89 22.89 22.89 23.57 23.57 23.5
Embedding in High & Embedding in High Embedding in High & Middle freq freq components Middle freq components components PSNR Similarity PSNR Similarity PSNR Similarity measure of measure of measure of extracted extracted extracted watermark watermark watermark with with with original original original watermark watermark watermark 24.1 100% 18.07 100% 24.1 100% 24.1 24.1 20.03 20.03 20.03 12.60 12.60 12.60 19.14 19.14 19.14 16.64 16.64 16.64 25.95 25.95 25.95 15.54 15.54 15.54 19.54 19.54 19.54 100% 60.93% 100% 100% 60.93% 100% 100% 60.93% 100% 100% 60.93% 100% 100% 60.93% 100% 100% 60.93% 100% 100% 60.93% 100% 100% 60.93% 18.07 18.07 22.46 22.46 22.46 9.75 9.75 9.75 13.23 13.23 13.23 19.50 19.50 19.50 24.09 24.09 24.09 22.89 22.89 22.89 23.57 23.57 23.5 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 24.1 24.1 20.03 20.03 20.03 12.60 12.60 12.60 19.14 19.14 19.14 16.64 16.64 16.64 25.95 25.95 25.95 15.54 15.54 15.54 19.54 19.54 19.54 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100% 100%
Boat
Barbara
Brain
Cartoon
Baboon
Cman
veg
Page 30
watermark
shifting method. This methods embedding capacity can be increased by 4x4 DCT and further increased by 2x2 DCT. But it reduces quality of watermarked image. DCT method is quite suitable for geometric attacks such as scaling and translation attack. In case of scaling attack, as every coefficient is changed but it do not affect overall Si out of [T1,T2]. As the sum Si of higher and middle frequency coefficients are not affected, a 100% similar watermark recovery is possible. But if image is attacked with rotational attack, all pixel values in image changes, which results into hardly 61% similarity between original and recovered watermark. Result table shows that this method is not supporting to rotational attack.
Figure 3: Figure shows(a)watermarked image(b)recovered watermarked image (c)watermark(d)difference between original and recovered image
REFERENCES
[1]J.R.Hemandez,M.Amado,DCT domain watermarking techniques for still images as detector performance analysis and a new structure, in IEEE Transactions on image Processing,2000,vol.9,pp.55-68. [2]Yi Du, , Ting Zhang,A Reversible and Fragile Watermarking Algorithm Based on DCT,2009,ICAICI,978-0-7695-3816-07/09-IEEE DOI 10.1109/AICI 2009.30 [3] B. Yang, M. Schmucker, X. Niu, C. Busch, S. Sun, "Reversible Image Watermarking by Histogram Modification for Integer DCT Coefficients", in IEEE .6th Workshop on Multimedia Signal Processing, pp. 143146,Siena, Italy, Sept. 2004. [4]A. K. Jain, Fundamentals of Digital Image Processing, New Jersey: Prentice Hall Inc.,1989. [5]A. C. Hung and TH-Y Meng, A Comparison of fast DCT algorithms, Multimedia Systems, No. 5 Vol. 2, Dec 1994. [6] G. Aggarwal and D. D. Gajski, Exploring DCT Implementations, UC Irvine, Technical Report ICS-TR98-10, March 1998. [7] J. F. Blinn, What's the Deal with the DCT, IEEE Computer Graphics and Applications,July 1993, pp.7883.
Figure 4: Different images on which we have implemented our algorithm and lastly a watermark 3.1 Experiment and Discussion We have performed experimentation on different images such as high quality images medical images and carton images. Above result table shows that quality of watermarked image reduces. We get less PSNR as compared to histogram shifting method. But it is comparable with IWT method. As each and every coefficients are affected with this method, the quality of watermarked image reduces. But this DCT method is robust to geometric attacks such as rotation, translation and scaling attack. Result table clearly shows that this method is 100% reversible to geometric attack. The embedding capacity of this method is also very less as compared to other methods such as chaotic neural network method, difference expansion method and RCM method. But it is quite comparable with histogram Volume 1, Issue 2 July-August 2012
Page 31
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.
Page 32