ISSN: 2229-371X

All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.

MULTILAYER SECURITY BASED ROBUST WATERMARKING TECHNIQUE FOR MEDICAL IMAGES IN DWT-DCT DOMAIN

Baisa L. Gunjal*1, Suresh N. Mali2
  1. Amrutvahini College of Engineering, Sangamner, A’nagar, MS, India.
  2. Imperial College of Engineering and Research, Wagholi, Pune, MS, India
Corresponding Author: aisa L. Gunjal, E-mail: hello_baisa@yahoo.com1
Related article at Pubmed, Scholar Google

Visit for more related articles at Journal of Global Research in Computer Sciences

Abstract

This paper provides strongly robust digital image watermarking scheme for medical images using DWT-DCT domains. Security levels are increased by using different pn sequences, threshold values, summation of pn sequences, Arnold periodicity, Arnold scrambling, DWT and DCT domains. The medical images of 512x512 size used as cover images and grey scale hospital logo of 64x64 size is used as watermark and results are tested for 11 different values of flexing factor with middle and high frequencies then analysed and compared. The scheme gives PSNR up to 42.8846 and NC 0.9451 for high frequency sub band. The robustness with different noise and filtering attacks are tested and presented. Simple, symmetric, orthogonal ‘Haar’ wavelet is used for decomposition and direct flexing factor is used.

Keywords

Orthogonal, DWT-DCT, PSNR, Arnold, Transmission.

INTRODUCTION

Creations, copy, distribution and transmission of multimedia data have become common needs. Digital Image Watermarking provides copyright protection to digital images by hiding important information in original image to declare ownership. Perceptual transparency and robustness, capacity and blind watermarking are main features those determine quality of watermarking scheme [6]. Perceptual transparency means perceived quality of image should not be destroyed by presence of watermark. Robustness indicates resistance to different attacks like compression, scaling, rotation, cropping, noise attacks, sharpening, contrast adjustment etc. Perceptual transparency and robustness are two contrast measures. Hence, researchers strive for strongly robust with better perceptual transparency in watermarking schemes. The watermarking can be achieved either in spatial domain or in frequency domain. In spatial domain, watermark is embedded by directly modifying pixel values of cover image. These algorithms are simple in implementation. But problems with such algorithms are: Low watermark information hiding capacity, Less PSNR, Less Correlation between original and extracted watermark and less security, hence anybody can detect such algorithms. The Frequency domain the watermark is inserted into transformed coefficients of image giving more information hiding capacity and more robustness against watermarking attacks because information can be spread out to entire image [1]. In this paper a combined DWT-DCT based watermarking method is proposed providing multilayer security and robustness.

SURVEY

LSB based watermarking in spatial domain is the straightforward method, but once algorithm is discovered, watermark will be no more secured[3]. An improvement on LSB substitution is to use pseudo random generator to determine pixels to be used for embedding, based on given seed or key. Security of the method is improved but algorithm is not still completely secured[3]. In CWT, Calculating wavelet coefficients at every possible scale is huge amount of work, and it generates a lot of data. There is highly redundant information as per as the reconstruction of the signal is concerned. Due to the attractive features of Discrete Wavelet Transform, researches have been focused on DWT [15].Wang
Hongjun, Li Na have proposed a DWT based method [14] in which watermark was embedded in middle frequency coefficient using :
image
where, F(u, v) is wavelet coefficient, W is randomized binary watermarking,  is flexing factor with  = |m| ,where m is mean value of all coefficients watermarking embedded. But this method doesn’t provide enough security. The method proposed in [14] using DWT was extended in [15] to enhance security of algorithm by using Arnold’s Transform pretreatment for watermark. As given in [16] two phase watermark embedding process was carried out using DWT. Phase 1: Visible watermark logo embedding, Phase 2: Feature extracted watermark logo embedding. The algorithm was based on Texture Based Watermarking. In 2008, as given in [17] using DWT, host image is decomposed into 3 levels recursively. In level one we get 4 sub bands. In level 2, each subband of level 1 is divided to 4 sub bands to give total 16 sub bands. Finally, each subband of level 2 is again divided into 4 sub bands each to give total 64 sub bands. Then’ Generic algorithm’ was applied to find the best subband for watermark embedding to provide perceptual transparency and robustness. But the process is too lengthy and time consuming. Some frequency based watermarking techniques are based on only Discrete Cosine Transform. But common problem with only DCT based watermarking is block based scaling of watermark image changes scaling factors block by block and results in visual discontinuity.[1][6][23][25].As given in [13], J. Cox et. al had presented ‘Spread spectrum based watermarking schemes’, Chris Shoemaker has developed CDMA based Spread spectrum watermarking with one scale DWT and got PSNR between 35-40 db for various attacks [26]. As given in [10], Harsh Varma et. al tested CDMA based watermarking scheme with spatial domain and frequency domain with DCT as well as DWT. But these algorithms have low information hiding capacity. Almost all CDMA based methods have low watermark information hiding capacity [24].

FOUNDATIONS OF OUR METHODOLOGY

A. DISCRETE WAVELET TRANSFORM (DWT)
ISO has developed and generalized still image compression standard JPEG2000 which substitutes DWT for DCT. DWT offers muti resolution representation of image and DWT gives perfect reconstruction of decomposed image. Discrete wavelet can be represented as
image
When image is passed through series of low pass and high pass filters, DWT decomposes the image into sub bands of different resolutions [6][18][19][20]. Decompositions can be done at different DWT levels.
image
At level 1, DWT decomposes image into four nonoverlapping multiresolution sub bands: LL1 (Approximate sub band), HL1 (Horizontal sub band),LH1 (Vertical sub band) and HH1 (Diagonal Sub band). Here, LL1 is low frequency component whereas HL1, LH1 and HH1 are high frequency (detail) components [7][8][9]. Embedding watermark in low frequency coefficients can increase robustness significantly but maximum energy of most of the natural images is concentrated in approximate (LL) sub band. Hence modification in this low frequency sub band will cause severe and unacceptable image degradation. Hence watermark is not embedded in LL sub band. The good areas for watermark embedding are high frequency sub bands (HL, LH and HH), because human naked eyes are not sensitive to these sub bands.
B.DISCRETE COSINE TRANSFORM (DCT)
The discrete cosine transform (DCT) represents an image as a sum of sinusoids of varying magnitudes and frequencies. The DCT has special property that most of the visually significant information of the image is concentrated in just a few coefficients of the DCT [21]. It’s referred as ‘Energy compaction Property’. The DCT for image A with M x N size is given by:
image
image
As DCT is having good energy compaction property, many DCT based Digital image watermarking algorithms are developed. It’s already proved that DWT-DCT combined approach can significantly improve PSNR with compared to only DCT based watermarking methods.
C. ARNOLD TRANSFORM
Arnold Transform has special property that given image comes to it’s original state after specific number of iterations. These specific number of iterations termed as ‘Arnold Periodicity’. Hence Arnold Transform is used as efficient technique for increasing security in watermarking schemes [6]. The Arnold Transform of image is
image
Where, (x, y) ={0,1,.....N} are pixel coordinates from original image. ( A/ , B/ ) are corresponding results after Arnold Transform. The periodicity of Arnold Transform (P), is dependent on size of given image. From equation: 11 we have,
image

OUR METHODOLOGY

The Watermark Embedding and Extraction Process for HL sub band is given below. Same procedure can be applied for HH and LH sub bands.
A) WATERMARK EMBEDDING
Step 1: Read Cover Image of 512x512 size and apply one level DWT. Consider HL1 sub band.
Step 2. Read grey scale watermark of 64x64 size.
Step 3: Depending upon Key K1, generate pn sequence for given watermark and calculate sum say SUM, which is summation of all elements in generated pn sequence Step 4. Determine Arnold Periodicity P for given watermark.
Step 5: If SUM > T, where T is some predefined threshold value, then perform watermark scrambling by Key K2= P+ Count, else perform watermark scrambling by Key K3= P+ Count, where count is programmer defined counter. Here, we get ‘Scrambled Watermark’ by Arnold Transform.
Step 6: Generate two pn sequences: pn_sequence_0 and pn_sequence_1, depending upon sum of all elements of mid band used for DCT transformation.
Step 7: Perform watermark embedding using following equations:
If Watermark bit is 0, then
image
Where D is matrix of mid band coefficients of DCT Transformed block and  is Watermarked DCT block. Step 8: Apply Inverse DWT and then apply Inverse DCT to get ‘Watermarked_Image’.
B. WATERMARK EXTRACTION
Step 1: Read ‘Watermarked_Image’ and apply one level DWT to retrieve HL1 sub band.
Step 2: Use 4x4 size for DCT blocks. Generate two pn sequences: pn_sequence_0 and pn_sequence_1, depending Security levels are increased by using different pn sequences, threshold values, summation of pn sequences, Arnold periodicity, Arnold scrambling, DWT and DCT domains. ‘Perceptual Transparency’ is measured in terms of ‘Peak Signal to Noise Ratio’ which is given by: embedding process, rand(‘state’, 15) is used, then, same process is to repeated here.
Step 3: Extract mid band elements from DCT block and find correlation between ‘extracted mid band coefficients and pn_sequence_0’ as well as ‘extracted mid band coefficients and pn_sequence_1’.
Step 4 Determine watermark bits as follows: If correlation between ‘extracted mid band coefficients and pn_sequence_0’ is greater than ‘extracted mid band coefficients and pn_sequence_1’, then record watermark bit as 0 else record watermark bit as 1. Here we get ‘Intermediate watermark’.
Step 5: Apply Arnold Scrambling to Intermediate watermark’ to give final recovered watermark‘
image

EXPERIMENTAL RESULTS

This paper is implemented in Matlab. The medical images of 512x512 size used as cover image and grey scale hospital logo of size 64x64 size is used as watermark. The scheme is also tested for middle and high frequency sub bands with different attacks like Noise addition, filtering etc. The performance is measured by: ‘Perceptual Transparency’ and ‘Robustness’. The Perceptual Transparency’ is measured by PSNR which is given by:
image
Where, f (i, j) is pixel of original image. f ‘(i, j) is pixel values of watermarked image. MaxI is the maximum pixel value of image. Robustness is measure of immunity of watermark against attempts to remove or destroy it by image modification and manipulation like compression, filtering, rotation, scaling, collision attacks, resizing, cropping etc. Robustness is measured in terms of Normalized Correlation (NC). The correlation factor (Normalized Correlation) measures the similarity and difference between original ‘watermark and extracted watermark[22] . The NC is given by:
image
Where, N is number of pixels in watermark, wi is original watermark, wi’ is extracted watermark. Experimental results show that scheme gives better PSNR 42.8846 and NC 0.9451for high frequency sub band. The test results for 11 different values of flexing factor at HL,LH and HH sub bands are presented and analysis is done. The results are shown in Table 1 and Figure 3, Figure 4 and Figure 5.
image
image
image

CONCLUSION

Experimental results show that our scheme provides multilayer security with DWT-DCT domain for medical images. The different pn sequences, threshold values, summation of pn sequences, Arnold transform, DWT and DCT domains are used for providing high security. The complete analysis of watermark embedding in middle and high frequency is provided. It is found that DCT –DWT based method provides good results with compared to only DCT based methods. We are getting maximum NC up to 0.9451 proving that extracted watermark is has much better quality.

ACKNOWLEDGEMENT

Thanks to BCUD, Pune for providing ‘Research Grant’ for this work. File Ref. No.-BCUD/OSD/390 Dated 25/10/2010. We are thankful to ‘Amrutvahini College of Engineering, Sangamner, A’nagar’ and ‘Imperial College of Engineering and Research, Wagholi, Pune’, MS, India for providing technical support for this work. We also acknowledge the Encyclopedia of medical images used in this work, from the URL (http://www.images.md ).

References

  1. Saied Amirgholipour Kasmani, Ahmadreza Naghsh- Nilchi, "A New Robust Digital Image Watermarking Technique Based on Joint DWT-DCT Transformation”, Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference,11-13 Nov. 2008,Volume: 2, pp: 539-544
  2. K. Ramani, E Prasad, S Varadarajan, “Stenography using BPCS to the integer wavelet transform”, IJCSNS international journal of Computer science and network security, vol-7, No: 7 July 2007.
  3. Ramani K.; Prasad E.V, Varadarajan S.; Subramanyam A,"A Robust Watermarking Scheme for Information Hiding", Advanced Computing and Communications,16th International Conference,14-17 Dec. 2008 pp:58 – 64.
  4. S. Joo, Y. Suh, J. Shin, H. Kikuchi, and S. J. Cho., “A new robust watermark embedding into wavelet DC components,” ETRI Journal, 24, 2002, pp. 401-404.
  5. Voloshynovskiy. S. S. Pereira and T. Pun. 2001. “Attacks on Digital watermarks: classification, Estimation-Based attacks and Benchmarks”, Comm, Magazine. 39(8):118- 126.
  6. Ahmad Nilchi1, Ayoub Taher,” A New Robust Digital Image Watermarking Technique based on the Discrete Cosine Transform and Neural Network”, pp:1 – 7, April 2008.
  7. M.S. Hsieh, and D.C. Tseng, “Hiding digital watermarks using multi-resolution Wavelet transform”, IEEE Transactions on industrial electronics, vol:48, No:5, pp:875-882, Oct, 2001.
  8. H. Guo, and N. Georganas, “Multi-resolution Image Watermarking Scheme in the Spectrum Domain,” Proceeding of IEEE Canadian Conference on Electrical and Computer Engineering, pp. 873-878, May, 2002.
  9. Wang, S. and Y. Lin, “Wavelet Tree Quantization for Copyright Protection Watermarking,” IEEE Trans. Image Processing, vol. 13, no. 2, pp: 154-164, 2004.
  10. Harsh Varma, Abhishek Singh, Raman Kumar ,”Robustness of Digital Image Watermarking Techniques against brightness and rotation attacks”, (IJCSIS) International Journal of Computer Science and Information Security, Vol No:1, 2009.
  11. V.R. Ratnaparkhe, R.R.Manthalkar and Y.V.Joshi, “Texture Characterization of CT Images Based on Ridgelet Transform”, ICGST International Journal on Graphics, Vision and Image Processing, GVIP,Volume 8, 2008, pages:43-50.
  12. M.S. Joshi, R.R. Manthalkar, Y.V.Joshi,’ Image Compression Using Curvelet, Wavelet and Ridgelet Transform: A Comparative study’ ,ICGST GVIP, ISSN 1687-398X, Volume 8, Issue III, October 2008, Pages: 25-34
  13. Ingemar J. Cox, Joe Kiliany, Tom Leightonz and Talal Shimon, “Secure Spread Spectrum Watermarking for Multimedia”, IEEE Trans. on Image Processing, 6, 12, 1673-1687, (1997).
  14. Wang Hongjun, Li Na,” An algorithm of digital image watermark based on multiresolution wavelet analysis”, International Workshop on VLSI Design and Video Technology, Proceedings, 28-30 May 2005, pp: 272- 275.
  15. Na Li; Xiaoshi Zheng; Yanling Zhao; Huimin Wu; Shifeng Li ,”Robust Algorithm of Digital Image Watermarking Based on DWT”, Electronic Commerce and Security, International Symposium ,Volume, Issue , 3-5 Aug. 2008 PP::942 – 945.
  16. Krishnan, N. Selvakumar, R.K. Rajapandian, S. Arul Mozhi, K. Nelson Kennedy Babu, ”A Wavelet Transform Based Digital Image Watermarking and Authentication”, Annual IEEE Conference, in India, 15- 17 Sept. 2006, pp: 1-6
  17. Abu-Errub, A., Al-Haj, A.,”Optimized DWT-based image watermarking”, First International Conference on Applications of Digital Information and Web Technologies, IEEE,2008, 4-6.
  18. Rafel C. Gonzalez, Richard E.Woods, Steven L. Eddins, “ Digital Image Processing using Matlab”, Pearson Education, Fourth Impression, 2008, Pages:79-295.
  19. C. Sidney Burrus, Ramesh A. Gopinath and Haitao Guo, “Introduction to Wavelets and Wavelet Transformation”, Prentice Hall, 1998, ISBN: 0-13-489600-9, pp: 1-70.
  20. N.J. Fliege, “Multirate Digital Signal Processing”, Jon Wiley and Sons, 1994, ISBN: 0- 471-93976-5, Pages: 1- 283.
  21. Maria Petrou, Panagiota Bosdogianni ,” Image Processing: The Fundamentals”, John Wiley and Sons, 1st edition, 1999, ISBN:0471998834. Pages:1-322.
  22. Navas, K.A. Ajay, M.C. Lekshmi, M. Archana, T.S. Sasikumar, M. ,"DWT- DCT-SVD based watermarking", 3rd International Conference on "Communication Systems Software and Middleware and Workshops, ISBN: 978-1-4244-1796-4, 6-10 Jan. 2008,page(s): 271- 274.
  23. Fan Gu, Zhe-Ming Lu and Jeng-Shyang Pan, "Multipurpose Image Watermarking in DCT Domain using Subsampling," 2005 IEEE International Symposium on Circuits and Systems, vol. 5, pp. 4417-4420.
  24. Mwangi, E.,"A wavelet based image watermarking scheme with a CDMA embedding technique", 9th International Symposium on Signal Processing and Its Applications,2007. ISSPA 2007, ISBN: 978-1-4244- 0778-1, pages:1-4.
  25. EL-Fegh, D.Mustafa, Zakaria Suliman Zubi, Faraj A Elmouadib, "Color image watermarking based on the DCT-domain of three RGB color channels", ISBN ~ ISSN: 1790-5109 , 978-960-474-067-3 , 2009, Pages 36- 39.
  26. Liang Tan, Zhi-jun Fang, ”An Adaptive Middle Frequency Embedded Digital Watermark Algorithm Based on the DCT Domain”, ISBN: 978-0-7695-3366-7,2008, Pages: 382-385.