A Semi Blind Watermarking Technique for Copyright Protection of Image Based on DCT and SVD Domain

Table of contents

1. I. INTRODUCTION

igital watermarking is the method of embedding data into digital multimedia content without changing the content of original information. This is used to verify the credibility of the content as well as to recognize the identity of the digital content's owner. In digital image watermarking procedure, the inserted watermark should not degrade the visual perception of an original image and must be robust. So, it must endure the attacks such as, gamma correction histogram equalization, cropping and so on.

Digital Image watermarking is implemented in two ways -spatial domain and frequency domain. In spatial domain, the pixel intensity value of the image is directly modified like LSB is modified to achieve high visual perception. The spatial domain techniques have proven to be less robust against attacks like cropping, JPEG compression. In frequency domain the signal or image is transformed into discreet coefficients which are then modified to insert the watermark. Inverse transformation is used to get back the modified coefficients from original signal or image. Insertion, in transformed domain proves to be more robust against attacks like cropping, JPEG compression. Commonly used frequency-domain transforms are the Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), Discrete Fourier Transform (DFT) and Singular Value Decomposition (SVD). Of the frequency domain transforms, DCT and SVD increase the factor result that helps to achieve effective watermarking. In watermarking, there are some factors that measure the quality of watermarking. These are robustness, imperceptibility and Capacity. Robustness is a measurement which indicates how difficult is to remove or destroy watermark from watermarked image. Normalized Cross Correlation (NCC) is used to measure the similarity and difference between the original watermark and extracted watermark which actually measure the robustness. If NCC value is greater, then it is more robust. This value is generally plotted from 0 to 1. Imperceptibility is related to the quality of host image in presence of the watermark. If we cannot distinguish between host image and watermarked image, it is called imperceptibility. Basically imperceptibility depends on similarity between host image and watermarked image. Imperceptibility is measured by PSNR (Peak signal to Noise Ratio). Capacity indicates how much information is embedded into a digital content. In the proposed method, firstly zigzag process is applied to sort out the image to another form. Then DCT is applied on sorted out image to compress the size of image and SVD is applied on DCT compressed image to get singular values which is used to add watermark image. Finally embedding algorithm is implemented. The paper is organized by: Section 2, focuses on overview of terminologies. Section 3, gives details the proposed methodology, watermark embedding and extraction algorithms. In section 4, gives experimental performance results and comparison. Finally conclusion is given in section 5.

2. II. OVERVIEW OF TERMINOLOGY

The theories which are related with the proposed method is described here shortly.

3. a) Discrete Cosine Transformation (Dct)

The DCT is the most popular transform function used in signal processing. It transforms a signal from spatial domain to frequency domain. Due to good performance, it has been used in JPEG standard for image compression. It is a technique applied to image pixels in spatial domain in order to transform them into a frequency domain in which redundancy can be identified. The one-dimensional DCT is useful in processing one-dimensional signals such as speech waveforms. To analyze two-dimensional (2D) signals such as images, we need a 2D version of the DCT. The 2D DCT and 2D IDCT transforms is given by the equation 1 and 2. Two Dimensional (2D) DCT:

??(??, ??) = ??(??)??(??) ? ? ð??"ð??"(??, ??) cos ? ??(2?? + 1)?? 2?? ? * ?????? ? ??(2?? + 1)?? 2?? ? ???1 ?? =0 ???1 ??=0

Two Dimensional (2D) IDCT:

ð??"ð??"(??, ??) = ??(??)??(??) ? ? ??(??, ??) cos ? ??(2?? + 1)?? 2?? ? * ?????? ? ??(2?? + 1)?? 2?? ? ???1 ?? =0 ???1 ??=0

Where, ð??"ð??"(??, ??)and ??(??, ??)are respectively the pixel value and the DCT coefficient and

??(??), ??(??) = ? ? ? ? ? ? 1 ?? , ??, ?? = 0 ? 2 ?? , ????????????????? b) Singular Value Decomposition (Svd)

The Singular Value Decomposition (SVD) is one of the most important matrix decomposition technique used in computer vision. A very powerful set of techniques dealing with sets of equations or matrices that are either singular or numerically very close to singular. SVD allows one to diagnose the problems in a given matrix and provides numerical answer as well. Any m x n matrix A (m >= n) can be written as the product of an m x n column-orthogonal matrix U, an n x n diagonal matrix with positive or zero elements, and the transpose of an n x n orthogonal matrix V. SVD matrix can be represented by the equation:

?? = ??. ??. ?? ?? Where, ?? = ? ? ? ? ? ?? 1 0 . 0 0 0 ?? 2 . 0 0 . 0 0 . 0 0 . . . . ?? ???1 0 . 0 ?? ?? ? ? ? ? ? And ?? ?? ?? = ?? ?? ?? = ?? ???? ?? = ?? ?? 1 , ?? 2 , ? ? . . ?? ???1 , ?? ?? ? 0

The diagonal elements of matrix S are the singular values of matrix A and non-negative numbers.

4. c) Zigzag Process

A zigzag array is a square arrangement of the first N 2 integers, where the numbers increase sequentially as you zigzag along the anti-diagonals of the array. The zigzag scanning process is applying for energy distribution from high to low frequency as well as from low to high frequency with the same manner. The zigzag process gives a sorted out matrix from original matrix. For a graphical representation of zigzag scanning process is shown in fig. 1. Year 2016

5. IV. EXPERIMENTAL RESULTS

The proposed method is simulated using MATLAB 9 with Processor Intel core 2 duo 2.2 GHZ, RAM 2 GB and it tested for the various host and watermark images. Here some experimental results are given. With the host image Lena and watermark image CUET logo are described broadly that helps to analysis the proposed method properly.

6. V. CONCLUSION

In this paper, a DCT-SVD watermarking method using zigzag scanning sequence to sort out image is proposed that gives good PSNR and NCC values to ensure the imperceptibility and robustness. From Table 1 and 3, it is observed that the proposed method gives good PSNR and NCC values that fulfill the algorithmic requirements. The proposed method is superior to the existing method for Gaussian blur, sharpening, JPEG compression, histogram equalization and different kinds of filtering attacks. But in some geometric attacks such as rotation, resizing, cropping and in pixilation the proposed method dose not gives improved results. In future the proposed algorithm can be improved against different kinds of geometric attacks and will try to combine DWT, DCT and SVD domain to ensure better performance and further it can be extended to color images.

7. VI. Acknowledgment

I would like to give special thanks to my honorable supervisor Dr. Mohammad Ibrahim Khan , Professor, Dept. of CSE, CUET for his valuable suggestion, encouragement and sincere guidance throughout my work.

Figure 1. F 1 .
1Input host image HI and apply Zigzag sequence to sort out the image SI. 2. Apply DCT on Sorted out image SI to compress it. 3. Apply SVD to produce U, S singular values and V matrix. 4. Input watermark wi to embed with host image.
Figure 2. 5 .FFigure 1 :
51Figure 1: Zigzag scanning process
Figure 3. Figure 2 :
2Figure 2: Watermark Embedding process
Figure 4. Figure 3 :
3Figure 3: Watermark Extraction process
Figure 5.
performance of the proposed method we need to compute PSNR (Peak Signal to Noise Ratio) and NCC (Normalized Cross Correlation) values. Normally, PSNR is used to measure imperceptibility between the original image and watermarked image. PSNR is defined by the eqn. (4). And NCC is used to measure robustness i.e. how similar the original and extract watermark image. NCC value can be calculated by the defined eqn. (5). ??(??, ??) ? ?? ?? (??, ??)] (??, ??)|
Figure 6. Table 1 :
1
Year 2016
Host image Watermark image PSNR NCC
12 Lena CUET logo 31.4550 0.9976
Living room CUET logo 31.4114 0.9959
( ) Volume XVI Issue VII Version I Baboon Birds Boat Fruits Salt and Pepper Noise Poison noise Copyright image Cameraman CUET Logo Copyright image Speckle Noise Median Filter (3x3) 30.4195 35.0406 30.0704 30.5127 0.9906 0.9829 0.9980 0.9945
Journal of Researches in Engineering Gaussian Blur (5x5) Pixelate 2 (mosaic) (Photoshop) Gaussian Noise (0.3) JPEG 30:1
Global
JPEG2000 50:1 Sharpen 80
Resize 512->256->512 Rotation 20
Note: A F © 2016 Global Journals Inc. (US)Attacked watermarked image and corresponding extract watermark image.
Figure 7. Table 2 :
2
Year 2016
13
XVI Issue VII Version I
) Volume
Attacks ?? Existing Method DWT-?? SVD (ref : 6 ) 2 Proposed Method DCT-SVD (5) Journal of Researches in Engineering ( F
Gaussian Blur (5x5) Sha r pen 80 0.8850 0.6990 0.9845 0.9179 Global
Average Filter (3x3) Not given 0.8428
Median Filter (3x3) Not given 0.9233
Wiene r Filter (3x3) Not given 0.9528
Con tr ast -20 (Photoshop) 0.7380 0.3529
Gau s sian noise 0.3 0.8650 0.2186
1

Appendix A

  1. ICACCI-2012. International Conference on Advances in Computing, Communications and Informatics,
  2. Combined DWT-DCT Digital Image Watermarking. Ali Al-Haj . Journal of Computer Science 2007. 3 (9) p. .
  3. , A Sverdlov , S Dexter , A M Eskicioglu .
  4. Digital Image Watermarking Using Singular Value Decomposition. D V S Chandra . Proceedings of 45th IEEE Midwest Symposium on Circuits and Systems, (45th IEEE Midwest Symposium on Circuits and SystemsTulsa, OK
    ) August 2002. p. .
  5. Robust Secure and Blind Watermarking Based on DWT DCT Partial Multi Map Chaotic Encryption. E A Hagras , M S El-Mahallawy , A Z Eldin , M W Fakhr . The International Journal of Multimedia & Its Applications (IJMA) November 2011. 3 p. .
  6. Robust DWT-SVD Domain Image Watermarking: Embedding Data in All Frequencies. E Ganicand , A M Eskicioglu . Proceedings of the ACM Multimedia and Security Workshop, (the ACM Multimedia and Security WorkshopMagdeburg , Germany
    ) 2004. September 20 -21, 2004. p. .
  7. A hybrid SVD-DCT watermarking method based on LPSNR. F Huang , Z H Guan . Pattern Recognition Letters 2004. 25 p. .
  8. Robust Image Watermarking in Frequency Domain. G D Leena , S S Dhayanithy . International Journal of Innovation and Applied Studies 4 Apr. 2013. 2 p. . (IJIAS))
  9. A DCT Domain System for Robust Image Watermarking. M Barni , F Bartolini , V Cappellini , A Piva . Signal Processing May 1998. 66 p. .
  10. A Robust Blind Image Watermarking Scheme in Spatial Domain for Copyright Protection. M Kaur , S Jindal , S Behal . International Journal of 3. Dr. M. A. Dorairangaswamy August, 2009. 1. (International Journal of Engineering and Technology)
  11. Robust Image Watermarking in the Spatial Domain. N Nikolaidis , I Pitas . Signal Processing 1998. 66 (3) p. .
  12. A SVD-Based Watermarking Scheme for Protecting Rightful Ownership. R Liu , T Tan . IEEE Transactions on Multimedia March 2002. 4 (1) p. .
  13. A DCT-SVD based Robust Watermarking Scheme for. S Mukherjee , AK . Grayscale Research in Engineering & Applied Sciences 2012. 2 (2) p. .
  14. On the Security of an SVD based Ownership watermarking. Y , Yongdong Wu . IEEE transactions on Multimedia August, 2005. 7.
  15. A wavelet based watermarking algorithm for ownership verification of digital images. Y Wang , J F Doherty , R E Van Dyck . IEEE Transactions on Image Processing February 2002. 11 (2) p. .
  16. A Block-SVD Based Image Watermarking Method. Z Zhou , B Tang , X Liu . Proceedings of the 6th World Congress on Intelligent Control and Automation, (the 6th World Congress on Intelligent Control and AutomationDalian, China
    ) June 21 -23, 2006.
Notes
1
© 2016 Global Journals Inc. (US)
Date: 2016-01-15