Professional Documents
Culture Documents
3
Me
Steganography Exis ssage
te
sec nce
ret
4
Steganography
5
Steganography
6
An example
AND
7
What is Watermarking?
Watermark
Recognizable image or pattern in paper that appears
lighter when viewed by transmitted light
Watermarking
The process of embedding information into another
object/signal
8
Digital Watermarking
Technique which allows an individual to add hidden
copyright notices or other verification messages to
digital media
9
Classification of Watermarks
10
A visible watermark
12
Invisible Watermark example
13
Steganography V/S watermarking
watermarking the hiding data is used to protect the
original image (e.g.copyright management)
14
Watermark Categories
Robust Watermark
Embedded invisible watermarks.
Resist to image processing or attacks.
Used for copyright protection or to verify the ownership.
Fragile Watermark
Destroy easily on modifying host signal
Used for tamper detection
Semi Fragile Watermark
Sensitive to signal modification
Feature of both robust & Fragile watermark.
Provides data authentication
15
Types of Watermarking
Algorithms
Non Blind
Use the original signal/image to extract embedded
Watermark
Semi Blind
Don’t use the original signal
Use side information and/or original watermark
Blind
Don’t use original signal or side information
Most challenging
16
Watermarking Techniques
Spatial Domain Watermarking
Watermark embedded by modifying pixel values(for
image)
DCT, wavelet
17
Spread Spectrum Watermarking
• The watermark is transformed into a bit string b1b2….b64
• For each bit bi, a pseudorandom matrix Ri of integers {1-1}
is generated.
64 different matrices consisting pseudorandomly of {1 -1}
• Ri matrices depend on the bi of the watermark
A matrix +Ri is used if bi represents a 0,
A matrix -Ri is used if bi represent a 1
• sum of all random patterns Ri defines the watermark W:
64
W = Ri
i 1
watermarked image IW is generated by adding the watermark into
cover image I IW = I + kW;
18
LSB substitution
19
Replaces the N LSB planes of the cover image by
the N MSB planes of the hidden image
N= 4 bit hide
Host Pixel: 10110001 Secret Pixel: 00111111
Replace By
21
A DCT-based technique
coefficients
If the watermark contains n bits, use a secret key to locate n
blocks at “pseudo-random” locations.
The ith block Bi is used to carry the jth bit of the watermark, wj.
large image can store some data that is quite difficult to detect
in comparison to the LSB method.
24
Watermarking applications
25
Watermarking applications
26
References
Books
Digital Watermarking :Ingemar Cox,Matthew Miller,Jeffrey Bloom
MULTIMEDIA SECURITY TECHNOLOGIES FOR DIGITAL RIGHTS
MANAGEMENT:Edited by: Wenjun Zeng, Heather Yu, Ching-Yung Lin
Papers
A Functional Taxonomy of Software Watermarking- Nagra,Thomborson,Collberg
A TUTORIAL ON DIGITAL WATERMARKING-Fernando P´erez-Gonz´alez and Juan
R. Hern´andez
Collberg,Thomborson Software Watermarking: Models and Dynamic Embeddings
G. Langelaar, I. Setyawan, and R. Lagendijk. Watermarking digital image and
video data. IEEE Signal Processing Magazine, 17:20–46, 2000.
[2] C. Rey and JL. Dugelay. A survey of watermarking algorithms for image authentication.
EURASIP Journal on Applied Signal Processing, 6:613–621, 2002.
F Hrtung M kultimedia (1999). “Watermarking techniquest”. Journal of Processding of the
IEEE,Vol. 87, No. 7,pp.1079-1107.
27
Questions
or
Comments
Thank You