Presenting: Yossi Salomon Noa Reiter Guides: Dr. Ofer Hadar Mr. Ehud Gonen.

Slides:



Advertisements
Similar presentations
Spatial Domain Image Watermarking Robust against Compression, Filtering, Cropping and Scaling By Sebé, Domingo-Ferrer, Herrera Information Security Dec.
Advertisements

CHEN XIAOYU HUANG. Introduction of Steganography A group of data hiding technique,which hides data in undetectable way. Features extracted from modified.
Data Compression CS 147 Minh Nguyen.
INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, ICT '09. TAREK OUNI WALID AYEDI MOHAMED ABID NATIONAL ENGINEERING SCHOOL OF SFAX New Low Complexity.
Digital Watermarking for Telltale Tamper Proofing and Authentication Deepa Kundur, Dimitrios Hatzinakos Presentation by Kin-chung Wong.
Introduction to Watermarking Anna Ukovich Image Processing Laboratory (IPL)
Information Hiding: Watermarking and Steganography
Error detection and concealment for Multimedia Communications Senior Design Fall 06 and Spring 07.
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?
Fifth International Conference on Information
Adaptive MPEG-2 Video Data Hiding Scheme Anindya Sarkar, Upmanyu Madhow, Shivkumar Chandrasekaran, B. S. Manjunath Presented by: Anindya Sarkar Vision.
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
Watermarking Technology Ishani Vyas CS590 Winter 2008.
1. 2 u Copyright Protection u Authentication of multimedia data u Robust Data Hiding and Security issues.
Watermarking For Image Authentication Presented by San-Hao Wang.
In the last part of the course we make a review of selected technical problems in multimedia signal processing First problem: CONTENT SECURITY AND WATERMARKING.
A Novel Scheme for Hybrid Digital Video Watermarking By Pat P. W. Chan Supervised by Michael R. Lyu 2/2/2004 Computer Science and Engineering Department.
Digital Image Watermarking Er-Hsien Fu EE381K Student Presentation.
Perceptual Watermarks for Digital Image and Video ECE 738 paper presentation Pei Qi ECE at UW-Madison
Digital Watermarking Parag Agarwal
Digital Watermarking With Phase Dispersion Algorithm Team 1 Final Presentation SIMG 786 Advanced Digital Image Processing Mahdi Nezamabadi, Chengmeng Liu,
DCT-Domain Watermarking Chiou-Ting Hsu and Ja-Ling Wu, "Hidden digital watermarks in images," IEEE Trans. On Image Processing, vol. 8, No. 1, January 1999.
Robustness Studies For a Multi-Mode Information Embedding Scheme for Digital Images Daniel Eliades Mentor: Dr. Neelu Sinha Department of Math and Computer.
Information hiding in stationary images staff corporal Piotr Lenarczyk Military Uniwersity of Technology Institute of Electronics and Telecomunication.
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.
Multiple Image Watermarking Applied to Health Information Management
1 Security and Robustness Enhancement for Image Data Hiding Authors: Ning Liu, Palak Amin, and K. P. Subbalakshmi, Senior Member, IEEE IEEE TRANSACTIONS.
Data Hiding in Image and Video Part I: Fundamental Issues and Solutions ECE 738 Class Presentation By Tanaphol Thaipanich
Johann A. Briffa Mahesh Theru Manohar Das A Robust Method For Imperceptible High- Capacity Information Hiding in Images. INTRODUCTION  The art of Hidden.
Outline Kinds of Coding Need for Compression Basic Types Taxonomy Performance Metrics.
Compression video overview 演講者:林崇元. Outline Introduction Fundamentals of video compression Picture type Signal quality measure Video encoder and decoder.
An introduction to audio/video compression Dr. Malcolm Wilson.
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:
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Multiple-description iterative coding image watermarking Source: Authors: Reporter: Date: Digital Signal Processing, Vol. 20, No. 4, pp , 2010.
Quantization Watermarking Design and Analysis of Digital Watermarking, Information Embedding, and Data Hiding Systems Brian Chen, Ph. D. Dissertation,
An Improved Method Of Content Based Image Watermarking Arvind Kumar Parthasarathy and Subhash Kak 黃阡廷 2008/12/3.
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
Data Hiding in Image and Video: Part II—Designs and Applications Min Wu, Heather Yu, and Bede Liu.
Blind image data hiding based on self reference Source : Pattern Recognition Letters, Vol. 25, Aug. 2004, pp Authors: Yulin Wang and Alan Pearmain.
Program Homework Implementation of the Improved Spread Spectrum Watermarking System.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 4 ECE-C490 Winter 2004 Image Processing Architecture Lecture 4, 1/20/2004 Principles.
Digital Watermarking Multimedia Security. 2 What is the Watermark ? Paper Watermark –the technique of impressing into the paper a form, image, or text.
An introduction to audio/video compression Prepared by :: Bhatt shivani ( )
MMC LAB Secure Spread Spectrum Watermarking for Multimedia KAIST MMC LAB Seung jin Ryu 1MMC LAB.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 5 ECEC 453 Image Processing Architecture Lecture 5, 1/22/2004 Rate-Distortion Theory,
 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.
Complexity varying intra prediction in H.264 Supervisors: Dr. Ofer Hadar, Mr. Evgeny Kaminsky Students: Amit David, Yoav Galon.
1 Digital Water Marks. 2 History The Italians where the 1 st to use watermarks in the manufacture of paper in the 1270's. A watermark was used in banknote.
An improved SVD-based watermarking scheme using human visual characteristics Chih-Chin Lai Department of Electrical Engineering, National University of.
IMAGE COMPRESSION.
Ikhwannul Kholis Universitas 17 Agustus 1945 Jakarta
Data Compression.
Pat P. W. Chan,  Michael R. Lyu, Roland T. Chin*
Reference Ingemar J. Cox, Joe Kilian, F. Thomson Leighton, and Talal Shamoon, "Secure Spread Spectrum Watermarking for Multimedia," IEEE Trans. on Image.
High Capacity Data Embedding in JPEG Bit Streams Using Visual Models
K. ZEBBICHE , F. KHELIFI and A. BOURIDANE
Data Compression.
Data Compression CS 147 Minh Nguyen.
Watermarking with Side Information
Watermarking for Image Authentication ( Fragile Watermarking )
Increasing Watermarking Robustness using Turbo Codes
Parag Agarwal Digital Watermarking Parag Agarwal
Reference Ingemar J. Cox, Joe Kilian, F. Tomson Leighton, and Talal Shamoon, “Secure Spread Spectrum Watermarking for Multimedia,” IEEE Trans. On Image.
Spread Spectrum Watermarking
Author: Minoru Kuribayashi, Hatsukazu Tanaka
A Robust and Recoverable Tamper Proofing Technique for Image Authentication Authors: Chin-Chen Chang & Kuo-Lung Hung Speaker : Chin-Chen Chang.
Presentation transcript:

Presenting: Yossi Salomon Noa Reiter Guides: Dr. Ofer Hadar Mr. Ehud Gonen

Outline  Main  What is Watermark  Methods Comparison  Methods  Our improvement

Project description  Design and implement different types of watermark techniques.  Correlation based methods.  Modulo base method.  Compare the methods using different measurement.  Improve modulo method in order to minimize bandwidth.

What is Digital Watermark???   A technique which allows an individual to add hidden copyright notices or other verification messages to digital Image.   Watermark message is a group of bits describing information pertaining to the signal or to the author of the signal.

Outline  Main  What is Watermark  Methods Comparison  Methods  Our improvement

Measuring watermark quality Three main quality measurements exists:  Capacity – inserting as much data possible in a fixed capacity.  Robustness – resistance against different types of attacks, noises and etc…  Imperceptibility – watermark must be imperceptible to human eyes.  Tradeoff between the three measurements. Robustness Capacity Imperceptibility

How to compare different methods???  It is very important to select a variety of measurements representing different aspects of watermark technique.  Each measurement must be held on the same watermark and image.  Each attack will operate the same way on each method.

Measurements  PSNR : This is the most critical measurement, it examines the damage done to the image by embedding the Watermark.  Watermark recovery: Measures the watermark total robustness, high Watermark recover ability will insure the success of the method.  Robustness against Noise: Pictures are often transmitted through communication channels, we would like to simulate this noisy channels.  Robustness against Attacks: Preventing a third side from achieving or damaging the Watermark at the lowest possible redundancy.

Outline  Main  What is Watermark  Methods Comparison  Methods  Our improvement

Correlation Based Methods  Many methods uses the correlation tool properties in order to embed and extract watermarks.   Correlation is a statistical tool which measures the amount of similarity between two parameters or random process.

Modulo Based Method  This method created and improved by Dr. ofer hadar team, and called: High Capacity Data Embedding In JPEG Bit Stream  Most images transmitted over the web are compressed using JPEG.  First we need to understand what is JPEG.

JPEG compression: ZIGZAG QDCT Entropy Coding

 We will change the coefficients in order to achieve sum mod2^n equals to watermark pixel value.  The main idea of the method is changing coefficients while minimizing image distortion.  Selecting the coefficients that will be changed in order to insert the watermark is effected by three main criteria's. Modulo Method criteria's

 In jpeg compression, each coefficient will be rounded to it’s closest integer.  For example coefficients 6.51 and 6.99 will both be rounded up to 7,although changing 6.51 value to 6 after quantization will create a lower distortion than changing  Using this idea, we will change coefficients closer to the middle. Half way close criteria

 Different coefficients influence image quality differently.  For example, changing low level coefficient may critically damage image quality.  While selecting coefficients we must consider coefficients magnitude.  Each coefficients will have a magnitude weight factor. Magnitude of the DCT coefficient criteria

Position of the DCT coefficients criteria  Changing low level coefficients will create visible distortion.  Changing high level coefficients will damage watermark robustness (LPF for exp)  We will prefer to change Middle level coefficients.

Outline  Main  What is Watermark  Methods Comparison  Methods  Our improvement

Minimizing Bandwidth  JPEG stream final stage is entropy coding. In this stage each coefficient is coded using run level table.  Code length decrease monotonically, as function of level.  Our goal is to reduce the length with distortion restriction.

Minimizing Bandwidth (cont)  Tradeoff :  Distortion – changing more coefficients or changing coefficient farer from the middle will create a bigger distortion.  Bandwidth (Rate) – choosing the round down possibility will lead to level dropping and reduce bandwidth.  Number of Max coefficients selected:

Minimizing Bandwidth (cont)   Cost Function is built in order to combine the two main parameters, Distortion and Rate. selecting coefficients can be formulated in the following way: Distortion between original block and new coefficient chosen. Number of Bits allocated for Frame. Number of Bits for our selected coefficients.

Lagrange theorem: Lagrange theorem:  Using rate as a fixed restriction, we can use Lagrange theorem to transform our cost function into an equation without restriction. big means that more weight is given to the Rate parameter.  Calculating optimal rate and distortion using different will lead to converging into our optimal solution.