Digital Image Watermarking ELE 488 Final Project, Fall 2011 Princeton University Ali JavadiAbhari.

Slides:



Advertisements
Similar presentations
[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
Advertisements

Watermarking 3D Objects for Verification Boon-Lock Yeo Minerva M. Yeung.
Robust Invisible Watermarking of Volume Data Y. Wu 1, X. Guan 2, M. S. Kankanhalli 1, Z. Huang 1 NUS Logo 12.
Sheng-Wen Peng  Introduction  WATERMARKING FOR IMAGE AUTHENTICATION  COPY-COVER IMAGE FORGERY DETECTION  PCA Domain Method  EXPERIMENTAL.
1 Self-Recovery Fragile Watermarking Scheme with Variable Watermark Payload Fan Chen, Hong-Jie He, Yaoran Huo, Hongxia Wang Southwest Jiaotong University,
Introduction to Watermarking Anna Ukovich Image Processing Laboratory (IPL)
Watermarking Techniques Digital Rights Seminar © April 28, 2006 Mahmoud El-Gayyar.
1 A video authentication scheme for H.264/AVC Main profile Nandakishore Ramaswamy Multimedia Processing Lab July 9 th, 2004.
Information Hiding: Watermarking and Steganography
Vishnu Vardhan Reddy Mukku Mav ID : Under the guidance of.
Audio and Video Watermarking Joseph Huang & Weechoon Teo Mr. Pirate.
Digital Watermarking for Multimedia Security R. Chandramouli MSyNC:Multimedia Systems, Networking, and Communications Lab Stevens Institute of Technology.
Digital watermarking technique for protecting digital images
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A November 2005Analysis of Attacks on Common Watermarking Techniques 1 A study on the robustness.
» Copying images is easy » Distributing images is easy » But what if we want to protect our rights to an image?
Detecting Digital Image Forgeries Using Sensor Pattern Noise presented by: Lior Paz Jan Lukas, jessica Fridrich and Miroslav Goljan.
Watermarking Technology Ishani Vyas CS590 Winter 2008.
Secure Spread Spectrum Watermarking for Multimedia Ishani Vyas CS590 Winter 2008.
Digital Watermarking. Introduction Relation to Cryptography –Cryptography is Reversibility (no evidence) Established –Watermarking (1990s) Non-reversible.
By Elo Leung and Wing Wong CS 265 Section 2 Spring 2004.
Multimedia Security Digital Video Watermarking Supervised by Prof. LYU, Rung Tsong Michael Presented by Chan Pik Wah, Pat Nov 20, 2002 Department of Computer.
Audio Steganography Echo Data Hiding
Digital Signal Processing Final Project Proposal R 資工碩一 馬智釗 Reference : “Rotation, scale, and translation resilient digital watermarking based.
A Review on: Spread Spectrum Watermarking Techniques
Digital Watermarking Parag Agarwal
Adam Day.  Applications  Classification  Common watermarking methods  Types of verification/detection  Implementing watermarking using wavelets.
Watermarking University of Palestine Eng. Wisam Zaqoot May 2010.
By : Vladimir Novikov. Digital Watermarking? Allows users to embed SPECIAL PATTERN or SOME DATA into digital contents without changing its perceptual.
Multimedia Copyright Protection Technologies M. A. Suhail, I. A. Niazy
Thái Chí Minh Trần Lương Khiêm 1. Content  Introduction  History  Applications  Requirements  Techniques  Attacks 2.
Watermarking Matt Elliott Brian Schuette. Overview Goals Methods Comparison Attacks References.
Digital Watermarking Simg-786 Advanced Digital Image Processing Team 1.
Digital Watermarking -Interim Report (EE5359: Multimedia processing) Under the Guidance of Dr. K. R. Rao Submitted by: Ehsan Syed
Russell Taylor. How the law supports Copyright Copyright Designs and Patents Act 1988 Copyright arises when an individual or organisation creates a work,
Information hiding in stationary images staff corporal Piotr Lenarczyk Military Uniwersity of Technology Institute of Electronics and Telecomunication.
Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester ITGD 2202 University of Palestine.
DIGITAL WATERMARKING SRINIVAS KHARSADA PATNAIK [1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN Presented by SRINIVAS KHARSADA PATNAIK ROLL.
Yarmouk university Hijjawi faculty for engineering technology Computer engineering department Primary Graduation project Document security using watermarking.
Digital image processing is the use of computer algorithms to perform image processing on digital images which is a subfield of digital signal processing.
1 影像偽裝術的最新發展 Chair Professor Chin-Chen Chang Feng Chia University National Chung Cheng University National Tsing Hua University.
Digital Watermarking -Project Proposal (EE5359: Multimedia processing) Under the Guidance of Dr. K. R. Rao Submitted by: Ehsan Syed
ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission (12 – 7 – 06) Digital Watermarking What? Why? How? Attacks, Legal issues 12/7.
Secure Spread Spectrum Watermarking for Multimedia Young K Hwang.
PRESENTED BY, C.RESHMA –II CSE S.POORNIMA –II IT.
Multiple watermarking Wu Dan Introduction (I) Multipurpose watermarking Ownership watermarks (very robust) Captioning watermarks ( robust)
Program Homework Implementation of the Improved Spread Spectrum Watermarking System.
Digital Watermarking Multimedia Security. 2 What is the Watermark ? Paper Watermark –the technique of impressing into the paper a form, image, or text.
Vishnu Vardhan Reddy Mukku Mav ID : Under the guidance of.
Spread Spectrum and Image Adaptive Watermarking A Compare/Contrast summary of: “Secure Spread Spectrum Watermarking for Multimedia” [Cox ‘97] and “Image-Adaptive.
MMC LAB Secure Spread Spectrum Watermarking for Multimedia KAIST MMC LAB Seung jin Ryu 1MMC LAB.
DATA EMBEDDING IN SCRAMBLED DIGITAL VIDEO -BY 08L31A L31A L31A L31A0487 UNDER THE GUIDENCE OF Y.SUKANYA.
By: U.Aruna M.Shanthi Priya Allows users to embed special pattern or some data into digital contents without changing its perceptual quality. When data.
 Digital images store large amounts of data and information. This data can be manipulated to some extend without being detected by human eyes.  DWT(Discrete.
DEPARTMENT OF ECE, BEC, BAGALKOT
DCT watermarking Speaker: Paul 1.
Ikhwannul Kholis Universitas 17 Agustus 1945 Jakarta
IMAGE PROCESSING IMAGE WATERMARKING
Visible Watermarking of An Image Using DCT Technique
Reference Ingemar J. Cox, Joe Kilian, F. Thomson Leighton, and Talal Shamoon, "Secure Spread Spectrum Watermarking for Multimedia," IEEE Trans. on Image.
DONE BY S.MURALIRAJAN M.NIRMAL
Watermarking for Image Authentication ( Fragile Watermarking )
Steganography with Digital Images
Dept. of Elec. & Comp. Engineering
Parag Agarwal Digital Watermarking Parag Agarwal
Source: Pattern Recognition Letters, Article In Press, 2007
A Self-Reference Watermarking Scheme Based on Wet Paper Coding
A Robust and Recoverable Tamper Proofing Technique for Image Authentication Authors: Chin-Chen Chang & Kuo-Lung Hung Speaker : Chin-Chen Chang.
A Self-Reference Watermarking Scheme Based on Wet Paper Coding
A New Method for Tamper Detection and Recovery
A Quadratic-Residue-based Fragile Watermarking Scheme
Presentation transcript:

Digital Image Watermarking ELE 488 Final Project, Fall 2011 Princeton University Ali JavadiAbhari

Watermarking Why? Fingerprinting (tracking) Indexing (search engines) Copyright protection and owner identification Data hiding Data authentication (fragile watermarks) Recovery (self-embedding) Properties Visibility (transparency) Robustness Payload Security (not through obscurity) 2

In This Project Three techniques 1.Yeung-Mintzer (bit-plane slicing) 2.Cox (spread spectrum watermarking) 3.Fridrich (Self-embedding) They show a wide range of applications of watermarking. Their comparison reveals valuable information. 3

Yeung-Mintzer LUT based fragile watermarking method in the spatial domain Good for tamper detection at single pixel level Limit run of 1s and 0s in LUT to avoid large effect on original image On average only half the pixels are modified 4

Yeung-Mintzer Change to the image are invisible 5

Yeung-Mintzer Change to the image are invisible 6

Yeung-Mintzer Good for local modification detection (e.g. Cropping) 7

Yeung-Mintzer Good for local modification detection (e.g. Cropping) 8

Yeung-Mintzer Very fragile. Lighting up the whole image by 10 intensity values: 9

Yeung-Mintzer Very fragile. Lighting up the whole image by 10 intensity values: 10

Cox Watermarking in the frequency (DCT) domain Series of random numbers ω i are inserted into the K most significant coefficients by: c i '=c i.(1+αω i ) 1≤i≤K Gamma (γ) is a measure to let us know the extent of manipulation, and cannot show where the tampering has taken place (unlike Yeung-Mintzer) and obviously cannot provide the correct form (unlike Fridrich) Quite robust (retains random numbers’ values) 11

Cox The watermark’s effect can be found only with close inspection, still pretty invisible: 12

Cox The watermark’s effect can be found only with close inspection, still pretty invisible: 13

Fridrich Self-embedding DCT of 8x8 blocks is taken, encoded into 64-bit string, and embedded in LSB of destination block Source and destination block linked via an encoding vector, usually 0.3 of image size in length Has recovering capabilities, unlike previous methods The recovered parts are of low quality (less than 50% JPEG) Works best for local changes (forgery) since both destination and source must not be modified 14

Fridrich Example 1: (Vector=0.4hor+0.1ver) 15

Fridrich Example 1: (Vector=0.4hor+0.1ver) 16

Fridrich Example 2: (Vector=0.4hor+0.1ver) 17

Fridrich Example 2: (Vector=0.4hor+0.1ver) 18

Contribution Previous method shows a flaw in the method proposed in the paper by Fridrich If Block 2 is inconsistent with both Block 1 and Block 3, it might be that Block 2 is not tampered but the other two are. Need to check Block 0 to be sure 19

Contribution Example 2: (Vector=0.4hor+0.1ver) 20

Comparisons Yeung-MintzerCoxFridrich Philosophy Detect any change, at the level of individual pixels Be more robust; determine weather change is strong enough or not Detect local tampering, and also correct it Visibility (qualitative transparency) Invisible Effect on original image * (quantitative transparency) % % % Robustness Very FragileVery robustRobust to local modifications Information needed for decoding LUTK largest coefficients, their indices, the random numbers and alpha Encoding vector Recoverable No Yes *Based on Lenna. Measuring average difference between pixels by summing differences, and dividing by image size times pixel range (256) 21

Comparisons Yeung-Mintzer (recovered logo) Cox ( γ ) Fridrich (recovered image) CropShows crop location (unacceptable) Recovered FilterEdges ruined (acceptable) Destroyed IlluminateDestroyed (acceptable) Partial destruction NoiseNoisy (acceptable) Partial destruction RotateSame rotation (unacceptable) - Using morphological transformations as benchmarks: 22

Cropping out a rectangle γ=0.2065(Cox) (Yeung-Mintzer) (Fridrich) 23

Lowpass Filtering γ=0.8856(Cox) (Yeung-Mintzer) (Fridrich) 24

Illuminating γ=0.4870(Cox) (Yeung-Mintzer) (Fridrich) 25

Adding Noise γ=0.5690(Cox) (Yeung-Mintzer) (Fridrich) 26

Rotating γ=0.0170(Cox) (Yeung-Mintzer) (Fridrich) MATLAB out-of-bound access in Fridrich algorithm 27

References [1] M. Yeung and F. Mintzer. Invisible Watermarking for Image Verification. Journal of Electronic Imaging, pp , [2] I. Cox, J. Kilian, T. Leighton, T. Shamoon. Secure Spread Spectrum Watermarking for Multimedia, IEEE Transaction on Image Processing, vol.6, no.12, pp , [3] J. Fridrich, M. Goljan, Protection of Digital Images Using Self- Embedding, Symposium on Content Security and Data Hiding in Digital Media, NJ, USA, May 14, [4] R. C. Gonzalez and R.E. Woods, Digital Image Processing 4th Edition, Prentice Hall, New Jersey, [5] B.B. Zhu, M.D. Swanson and A.H. Tewfik. When seeing isn’t believing. IEEE Signal Processing Magazine, pp. 40–49,

Thank You! Any Questions? 29