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 4, July August 2013 ISSN 2278-6856

Robust dual watermarking using DWT & SVD

Mr. Saurabh Athalye1, Mrs. Minal Puranik2
1

Department of Electronics & Telecommunication Engineering, Rajendra Mane College Of Engineering & Technology, Ambav.
2 Department of Electronics, Shah & Anchor Kuttchi Engineeing College,Chembur.

Abstract: Now a days digital image watermarking have

become useful tool in copyright protection & authentication. In this proposed scheme new method of robust & blind dual watermarking using DWT(Discrete wavelet transform) & SVD(Singular value decomposition) transforms is presented. In proposed technique two grayscale watermarks are used for watermarking in grayscale host image. Secondary watermark can be embedded in primary watermark only with the help of SVD & this watermarked primary can be embedded in host image by means of DWT & SVD. This dual watermarking will be invisible watermarking. An efficient watermark extraction method is presented.

watermark is embedded into primary watermark and the resultant watermarked image is used as watermark for the host image. A reliable watermark extraction scheme will developed for the extraction of the primary as well as secondary watermark from the distorted image. With experimental evaluation we will demonstrate that the proposed scheme is able to withstand a variety of attacks..

2. PROPOSED METHOD
In the proposed scheme, both the watermarks are invisible. For embedding, both the images are transformed into wavelet domain. Further SVD transform is performed on both the images and sum up the singular values to find the new singular values. Both the watermarks are embedded in the same manner. An efficient watermarking extraction scheme is introduced for finding both primary and secondary watermarks. ADVANTAGES Dual Watermarking is used by DWT and SVD. High hiding Capacity & High Robustness

Keywords DWT, Invisible, Robust, SVD, Watermark.

1. INTRODUCTION
In the recent years, the advance of editing software and the popularity of the Internet, illegal operations, such as duplication, modification, forgery and others in digital media, have become easy, fast and difficult to prevent. Therefore, the protection of the intellectual property rights of digital media has become an urgent matter. The one of the solution for this is Digital Watermarking. It can be used for tracking the images that were illegally distributed. Watermarking, when complemented with encryption, can serve for many purposes, such as copyright protection, broadcast monitoring and data authentication. There are many watermarking algorithms proposed in literature. Some of them operate either in the spatial domain or in the frequency domain. In the recent years, a new transform is introduced for watermarking namely Singular Value Decomposition (SVD). In SVD domain, a common approach is to modify the singular values by the singular values of a visual watermark [1, 2]. SVD is one of the most useful tools of linear algebra with several applications in image and signal processing. In the recent years, Digital Watermarking is used for copyright protection and authentication. In proposed method, a new Dual Watermarking Scheme based on DWT-SVD is presented to improve the robustness and protection [4, 5]. Both Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) have been used as a mathematical tool to embed watermark in the image. In the proposed technique, two watermarks are embedded in the host image. First watermark is called primary watermark, which is a gray scale digital image. Second watermark is called secondary watermark which is a gray scale meaningful logo instead of randomly generated Gaussian noise type watermark. The secondary Volume 2, Issue 4 July August 2013

3. SINGULARVALUE DECOMPOSITION
Let A be a general real(complex) matrix of order m n. The singular value decomposition (SVD) of A is the factorization A=U*S* (1) where U and V are orthogonal(unitary) and S = diag(1, 2, ..., r ), where i, i = 1(1)r are the singular values of the matrix A with r = min(m, n) and satisfying 12...r (2) The first r columns of V the right singular vectors and the first r columns of U the left singular vectors. Use of SVD in digital image processing has some advantages. First, the size of the matrices from SVD transformation is not fixed. It can be a square or a rectangle. Secondly, singular values in a digital image are less affected if general image processing is performed. Finally, singular values contain intrinsic algebraic image properties.

4. METHODOLOGY
4.1Watermark Embedding 4.1.1.Embedding secondary watermark 1) Perform SVD on secondary watermark. = Page 360

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 4, July August 2013 ISSN 2278-6856
2) Perform SVD on primary watermark. = 3) Modify singular values of primary watermark with singular values of secondary watermark. = + a. 4) Obtain modified primary watermark which is watermarked watermark. = 4.1.2 Embedding watermarked primary watermark in host image. 1) Peform 2-level DWT on host image. LL HL LH HH = 4) Extract singular values of primary watermark from all non-overlapping rectangles. = 5) Obtain all estimates of primary watermark. = 6) Select the primary watermark estimate as detected watermark which has largest correlation co-efficient & denoted by 4.2.2 Extraction of secondary watermark 1) Perform SVD on determined primary & original primary watermark. = = 2) Extract singular values of secondary watermark. = Watermark Embedding:-

512*512 , Where {LL,LH,HL,HH} 2) The details & approximation sub-images of the host image is segmented into non-overlapping rectangles of 128*128 using zig zag sequence. 3) Perform SVD on modified primary watermark. = 4) Perform SVD on all non-overlapping rectangles. = 5) Modify the singular values of all non-overlapping rectangles with the singular values of the new primary watermark as = + 6) Obtain all modified non-overlapping rectangles = Where {LL,LH,HL,HH} 7) After embedding reconstruct approximation & all the detail parts using De-zig-zag sequence. 8) Perform 2-level inverse DWT to get watermarked host image. 4.2 Watermark Extraction 4.2.1 Extraction of primary watermark 1) Perform 2-level DWT on host as well as watermarked image. and Where {LL,LH,HL,HH} 2) Above results are segmented into non-overlapping of size 128*128 and 3) Perform SVD transform on non-overlapping rectangles. =

Fig 4.2.2.1: Watermark embedding algorithm. Watermark Extraction:-

Fig 4.2.2.2: Watermark extraction algorithm.

Volume 2, Issue 4 July August 2013

Page 361

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 4, July August 2013 ISSN 2278-6856 5. RESULTS
5.1 Test cases 5.1.1 Digital Camera image
Host Image Noise attack No attack Salt & Pepper (D*=0.03 ) Poisson Cropped (1/4th) Image resize (30%) Rotation ( ) PSNR Correlation coefficient Primary Secondary watermar watemark k 0.99 0.50 0.47 0.56

5.2 Snapshot

Digital Camera (Sunset )

43.40 33.99

38.50 29.77 42.47

0.93 0.92 0.92

0.72 0.92 0.39

Figure: 5.1.: Medical image (Teeth) Without any attack. 5.3 Graphs 5.3.1 Corerealation coefficient of primary

28.84

0.72

0.79

Table 5.1.1 Test cases- Digital Camera image

5.1.2 Medical image

Correlation coefficient Host Image Noise attack No attack Salt & Pepper (D*=0.03) Poisson Cropped (1/4th) Image resize (30%) Rotation ( ) PSNR 43.31 34.30 Primary watermark 0.99 0.49 Secondary watemark 0.99 0.68

Medical (Teeth)

Figure: 5.3.1: Variation of correalation coefficient of primary 5.3.2 Corerealation coefficient of secondary

37.39 29.92 43.30

0.95 0.89 0.98

0.70 0.92 0.66

30.61

0.80

0.76

Table 5.1.2 Test cases- Medical image 5.1.3 Baboon image

Correlation coefficient Host Image Noise attack No attack Salt & Pepper (D*=0.03) Poisson Cropped (1/4th) Image resize (30%) Rotation ( ) PSNR 43.31 34.43 Primary watermark 0.99 0.75 Secondary watemark 0.99 0.64

Figure: 5.3.2: Variation of correalation coefficient of secondary

Baboon

37.40 30.98 43.31

0.98 0.85 0.63

0.82 0.95 0.21

6. CONCLUSIONS
Proposed scheme can act as an efficient invisible watermarking technique. Since DWT and SVD transforms are used simultaneously, we obtain inherent advantages of both the transforms. General image processing doesnt affect singular values of digital image hence use of SVD makes this technique robust. It can sustain noise attack as well as image processing operations, hence robustness is achieved. Page 362

30.69

0.70

0.73

Table 5.1.3 Test cases- Baboon image

Volume 2, Issue 4 July August 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 4, July August 2013 ISSN 2278-6856 REFERENCES
[1] An SVD oriented watermark embedding scheme with high qualities for the restored images. Chin-Chen Chang 1,2 ,Chia-Chen Lin, Yih-Shin Hu. ICIC International 2007 ISSN 1349-4198. Volume 3, No 3, June 2007. [2] Digital image watermarking using singular value decomposition . Sura Ramzi sheriff, College of engineering, University of Mosul. Vol 07, No 03, 2010. 3rd scientific conference information technology 2010, Nov 29-30. [3] DWT based watermarking algorithm using Haar wavelet.Anuradha1 , Rudresh Pratap Singh 2. IJECSE ISSN 2277-1956/VZNI-01-06. [4] Robust blind DWT based digital image watermarking using singular value decomposition. Hbibollah Danyali1, Morteza Makhloghi2, Fardin Akhlugian 3. ICIC International 2012 ISSN 1349-4198. Volume 08, No 07(A) July 2012. [5] Robust watermarking scheme based on RDWT-SVD embedding data in all subbands. Samira Lagzian, Mohsen Soryani, Mohmod Fathy. 978-1-42449834/11 2011 IEEE.

Volume 2, Issue 4 July August 2013

Page 363