1. A DIGITAL IMAGE WATERMARKING PREPARED BY AMAR RAEED KHORSHıD ALHıLALı ıD : 201271555 R.G. Schyndel, A. Tirkel, and C. Osborne, “A Digital Watermark”, Procedding of 1994 International Conference on Image Processing (ICIP), Austin, Texas, November 13-16, 1994, pp. 86-90.

2.  Introduction & overview  Background  Watermark Properties  Embedding  Detection  The artıcle‘s containment  summery Index

3. INTRODUCTION& OVERVıEW  Watermark--an invisible signature embedded inside an image to show authenticity or proof of ownership  Discourage unauthorized copying and distribution of images over the internet  Software can be used to search for a specific watermark

4. BACKGROUND WATERMARK PROPERTIES  Watermark should appear random, noise-like sequence  Appear Undetectable  Good Correlation Properties  Common sequences A) Normal distribution B) m-sequences W=[1 0 0 1 0 0 1 1 0 1 1 1 0 1 0 0 1 1 1 1 0 1 0 0 0]

5. WATERMARK EMBEDDING WatermarkOriginal ImageWatermarked image Watermark placed into information content of Original Image to create Watermarked Image Image Content Spatial Domain (Least Significant Bit) Wavelet Transforms DCT Coefficients

6. SETUP-WATERMARK EMBEDDING Image 1000 Highest Coeff DCT Inter- leave Water- mark Water- marked Image IDCT DC Component Excluded for 1000 Highest Coefficients Interleaving prevents burst errors Watermarked Image Similar to original image

7. Original ImageWatermarked Image 512x512 “Mandrill” Image

8. WATERMARK DETECTION * =  Suspected Image Extracted Watermark Original Watermark Correlation Watermark Extracted from Suspected Image Compute correlation of Extracted and Original Watermark

9. THE ARTıCLE ‘S CONTAINMENT 1.We have An images 512*512 8 bit gray scal with m- Sequence 2^9 pixle long. 2.First method is embedding of the m-sequence on the LSB of the image data. 3.The original 8 bit gray scale image data is capable of compression to 7 bits by adaptive histogram manipulation. 4.The resulting image is practically indistinguishable from the original. 5.This process enabled LSB to carry the watermark. 6.The watermark can be decoded by comparing the LSB bit pattern with a stored counterpart

10. THE ARTıCLE ‘S CONTAINMENT 1.The second method’s LSB addition for embedding the watermark. 2.The decoding process makes use of the unique and optimal auto – correlation function of m-sequences. 3. This process requires the examination of all of patteren and its current İmplementation, must be performed offline which its principle disadvantige 4. the decoder is more complex form the first method. 5. Analysis of the image histogram indicates that a 3 bit dynamic range compression (from 8 bits down to 5 bits)should permit threshold detection to be successful.

11. SUMMERY 1.The presentation is talking about digital watermarking techniques. 2.This presentation examines the feasibility of embedding a digital watermark on test images. 3.The main problems found with adding the watermark is in retaining the dynamic range of the original image and the autocorrelation output.

12. THANK YOU FOR LISTıNING