Epson Palo Alto Laboratory 5/8/01 Standards Compliant Watermarking for Access Management Viresh Ratnakar & Onur G.Gulyeruz Please view in full screen presentation.

Slides:



Advertisements
Similar presentations
SWE 423: Multimedia Systems
Advertisements

School of Computing Science Simon Fraser University
Watermarking For Image Authentication Presented by San-Hao Wang.
JPEG.
JPEG Still Image Data Compression Standard
CMPT 365 Multimedia Systems
CS430 © 2006 Ray S. Babcock Lossy Compression Examples JPEG MPEG JPEG MPEG.
5. 1 JPEG “ JPEG ” is Joint Photographic Experts Group. compresses pictures which don't have sharp changes e.g. landscape pictures. May lose some of the.
Roger Cheng (JPEG slides courtesy of Brian Bailey) Spring 2007
1 JPEG Compression CSC361/661 Burg/Wong. 2 Fact about JPEG Compression JPEG stands for Joint Photographic Experts Group JPEG compression is used with.jpg.
Image Compression JPEG. Fact about JPEG Compression JPEG stands for Joint Photographic Experts Group JPEG compression is used with.jpg and can be embedded.
Paul Blythe and Jessica Fridrich Secure Digital Camera.
CSE679: MPEG r MPEG-1 r MPEG-2. MPEG r MPEG: Motion Pictures Experts Group r Standard for encoding videos/movies/motion pictures r Evolving set of standards.
Image and Video Compression
Trevor McCasland Arch Kelley.  Goal: reduce the size of stored files and data while retaining all necessary perceptual information  Used to create an.
Digital Image Watermarking Er-Hsien Fu EE381K Student Presentation.
Introduction to JPEG Alireza Shafaei ( ) Fall 2005.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 8 – JPEG Compression (Part 3) Klara Nahrstedt Spring 2012.
ECE472/572 - Lecture 12 Image Compression – Lossy Compression Techniques 11/10/11.
1 Image Compression. 2 GIF: Graphics Interchange Format Basic mode Dynamic mode A LZW method.
Klara Nahrstedt Spring 2011
By : Vladimir Novikov. Digital Watermarking? Allows users to embed SPECIAL PATTERN or SOME DATA into digital contents without changing its perceptual.
Concepts of Multimedia Processing and Transmission IT 481, Lecture 5 Dennis McCaughey, Ph.D. 19 February, 2007.
Robustness Studies For a Multi-Mode Information Embedding Scheme for Digital Images Daniel Eliades Mentor: Dr. Neelu Sinha Department of Math and Computer.
JPEG. The JPEG Standard JPEG is an image compression standard which was accepted as an international standard in  Developed by the Joint Photographic.
Indiana University Purdue University Fort Wayne Hongli Luo
CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.
JPEG CIS 658 Fall 2005.
Hardware/Software Codesign Case Study : JPEG Compression.
1 Image Formats. 2 Color representation An image = a collection of picture elements (pixels) Each pixel has a “color” Different types of pixels Binary.
1 STOCHASTIC SAMPLING FROM IMAGE CODER INDUCED PROBABILITY DISTRIBUTIONS presenting author: Google.
Reversible hiding in DCT-based compressed images Authors:Chin-Chen Chang, Chia-Chen Lin, Chun-Sen Tseng and Wei-Liang Tai Adviser: Jui-Che Teng Speaker:
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 10 – Compression Basics and JPEG Compression (Part 4) Klara Nahrstedt Spring 2014.
The JPEG Standard J. D. Huang Graduate Institute of Communication Engineering National Taiwan University, Taipei, Taiwan, ROC.
Data compression. lossless – looking for unicolor areas or repeating patterns –Run length encoding –Dictionary compressions Lossy – reduction of colors.
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
JPEG (Joint Photographic Expert Group)
Blind image data hiding based on self reference Source : Pattern Recognition Letters, Vol. 25, Aug. 2004, pp Authors: Yulin Wang and Alan Pearmain.
JPEG Image Compression Standard Introduction Lossless and Lossy Coding Schemes JPEG Standard Details Summary.
JPEG.
Page 11/28/2016 CSE 40373/60373: Multimedia Systems Quantization  F(u, v) represents a DCT coefficient, Q(u, v) is a “quantization matrix” entry, and.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
Introduction to JPEG m Akram Ben Ahmed
Multi resolution Watermarking For Digital Images Presented by: Mohammed Alnatheer Kareem Ammar Instructor: Dr. Donald Adjeroh CS591K Multimedia Systems.
John Hamann Vickey Yeh Compression of Stereo Images.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 7 ECEC 453 Image Processing Architecture Lecture 8, February 5, 2004 JPEG: A Standard.
JPEG. Introduction JPEG (Joint Photographic Experts Group) Basic Concept Data compression is performed in the frequency domain. Low frequency components.
By Dr. Hadi AL Saadi Lossy Compression. Source coding is based on changing of the original image content. Also called semantic-based coding High compression.
An introduction to audio/video compression Prepared by :: Bhatt shivani ( )
Tamal Bose, Digital Signal and Image Processing © 2004 by John Wiley & Sons, Inc. All rights reserved. Figure 11-1 (p. 624) (a) Image coder; (b) image.
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.
H. 261 Video Compression Techniques 1. H.261  H.261: An earlier digital video compression standard, its principle of MC-based compression is retained.
Chapter 8 Lossy Compression Algorithms
Chapter 9 Image Compression Standards
Digital Image Processing Lecture 21: Lossy Compression May 18, 2005
Discrete Cosine Transform
JPEG.
Data Compression.
CMPT 365 Multimedia Systems
Watermarking for Image Authentication ( Fragile Watermarking )
CIS679: MPEG MPEG.
CIS679: JPEG (more) Review of JPEG More about JPEG Lab project.
JPEG Pasi Fränti
Standards Presentation ECE 8873 – Data Compression and Modeling
JPEG Still Image Data Compression Standard
The JPEG Standard.
Hidden Digital Watermarks in Images
Presentation transcript:

Epson Palo Alto Laboratory 5/8/01 Standards Compliant Watermarking for Access Management Viresh Ratnakar & Onur G.Gulyeruz Please view in full screen presentation mode to see the animations.

Epson Palo Alto Laboratory Visible Watermarks for Digital Images: Traditional Schemes—Logos An identifying logo in a corner

Epson Palo Alto Laboratory Visible Watermarks for Digital Images: Traditional Schemes—Blended Marks Unobtrusive visible watermarks aimed at asserting ownership or authenticity

Epson Palo Alto Laboratory Our Goal: Obtrusive visible watermarks that can be removed

Epson Palo Alto Laboratory Obtrusive watermarks that can be removed  Similar to scrambling, except that only parts of the image (located on a distinctive pattern) are modified  Example application: user retrieves a watermarked image over the net, pays $$ to print, the printing driver removes the watermark just for printing  Simple for un-lossy-compressed images: Y = X  R

Epson Palo Alto Laboratory Desired scrambling and descrambling pipeline for compressed images JPEG Image Key K S Scrambler E Watermarked JPEG Image D DeScrambler

Epson Palo Alto Laboratory Format compliance, compression  The XOR idea does not survive lossy JPEG compression  The watermarked image should be format compliant, i.e., in JPEG format  For such completely removable watermarks on JPEG images, we must work with and modify quantized DCT coefficients, not pixels  The size of the watermarked image, ideally, should be no more than the original  We achieve all these goals with the proposed algorithm, DctDots

Epson Palo Alto Laboratory DctDots: Apply corruption to the blocks which lie on the pattern F 0,0 F 0,1 F 0,4 F 0,5 F 0,2 F 0,3 F 0,6 F 0,7 F 0,40 F 0,41 F 0,44 F 0,45 F 0,42 F 0,43 F 0,46 F 0,47 F 1,0 F 1,1 F 1,2 F 1,3 F 2,0 F 2,1 F 2,2 F 2,3 Y (Luminance) Cb (Chrominance) Cr (Chrominance)

Epson Palo Alto Laboratory DctDots: Four “tricks” for corrupting blocks 1.AC Masks: XOR the AC coefficient magnitude bits 2.AC Swaps: Swap AC coefficient blocks 3.DC Shuffles: Shuffle DC differentials within contiguous pattern blocks 4.DC Bit Shuffles: Shuffle DC differentials within contiguous pattern blocks

Epson Palo Alto Laboratory AC coefficients are coded as Bits in H are the Huffman code for (run = R, magnitude-category = S), Bits in V are the S magnitude bits (1’s complement) We apply XOR (with a keyed PRNG) to just the bits in V, thus maintaining format-compliance and ensuring that the size is not changed 1. AC Masks HV

Epson Palo Alto Laboratory 2. AC Swaps  Within a color component, entire blocks of AC coefficients (i.e., the 63 coefficients excluding the DC) can be swapped across blocks lying on the pattern.  The swapping is determined by the PRNG, hence reversible.  Format compliant  Size does not increase

Epson Palo Alto Laboratory 3. DC Shuffles  Quantized DC coefficients are differentially coded, hence tricky  Work with consecutive sequences of blocks to be modified (i.e., on the pattern)

Epson Palo Alto Laboratory 3. DC Shuffles – Contd.  Shuffle the differntial quantized DC values within such a pink sequence  Size does not increase at all  The last block in the sequence undergoes no change to its DC value (thus, include the first white block after the pink sequence in the shuffling)

Epson Palo Alto Laboratory 4. DC Bit Shuffles  This step supplements the DC shuffling step—it also works with the differential DC values from the pink blocks  In this step, we go down to the bit planes of the differential DC term

Epson Palo Alto Laboratory 4. DC Bit Shuffles – Contd. X XXXX0011 XXXXX000 X101 XXX01000 XX XXXXXXXX X XX XXXX Blocks Bit Plane X X 0 0

Epson Palo Alto Laboratory DctDots: Example Result

Epson Palo Alto Laboratory Conclusion  Different goals compared to traditional visible watermarking  DctDots: Format compliant watermarking technique for obtrusive, visible, removable watermarks on JPEG images  Compressed size is exactly the same  Extension to video—only in restricted cases.