Professional Documents
Culture Documents
Digital Watermarking
Digital Watermarking
Ng Huy Phc Trn Kim Ln Phm Quc Hip 50701831 50701259 50700812
PART 1
INTRODUCTION
STEGANOGRAPHY
Steganography (art of hidden writing) The art and science of writing hidden messages in such a way that no one apart from the intended recipient knows of the existence of the message. The existence of information is secret.
STEGANOGRAPHY
Histaeus used his slaves (information tattooed on a slaves shaved head)
STEGANOGRAPHY
Physical steganography
STEGANOGRAPHY
Digital steganography
Network steganography
DEFINITION
The process of embedding information into a digital signal in a way that is difficult to remove. The signal may be text, images, audio, video.
DEFINITION
Example:
GENERAL APPLICATIONS
Copyright Protecton To prove the ownership of digital media.
GENERAL APPLICATIONS
Tamper proofing To find out if data was tampered.
GENERAL APPLICATIONS
Quality Assessment Degradation of Visual Quality
LIFE-CYCLE PHASES
CLASSIFICATION
Digital watermarking techniques can be classified in many ways : Visibility Robustness Perceptibility Capacity Embedding method
VISIBILITY
Visible
Text or a logo which identifies the owner of the media.
Invisible
Information is added as digital data to audio, picture or video, but it cannot be perceived. May be a form of Steganography.
ROBUSTNESS
Robust
Resisted a designated a class of transformations. Against adversary based attack. (e.g. noise addition to images) Used in copy protection application.
Example: Robust Private Spatial Watermarks
ROBUSTNESS
Fragile
Fail to be detected after the slightest modification. Used for tamper detection.
Example: Blind Fragile DCT based Watermarks
ROBUSTNESS
Semi-fragile
Resist benign tramsformations but fails detection after malignant transformations. Robust against user-level operation. (e.g. image compression) Used for detect malignant transformation.
Example: Blind Semi-fragile Spatial Watermarks
PERCEPTIBILITY
Perceptible
Its presence in the marked signal is noticable, but non-intrusive.
Imperceptible
Original cover signal and the marked signal are close to perceptually indistinguishable.
PERCEPTIBILITY
Watermarking
Stanford Bunny 3D Model Visible Watermarks in Bunny Model Distortion
Watermarking
Stanford Bunny 3D Model Invisible Watermarks in Bunny Model Minimal Distortion
CAPACITY
Depend on the length of the embedded message. Zero-bit long
Detect the presence or absence of the watermark. A 1 denotes the presence. 0 denotes the absence.
N-bit long
Modulated in the watermark. Support multiple watermarks.
EMBEDDING METHOD
Spread-spectrum
The marked signal is ontained by an additive modification. Modestly robust. Have a low information capacity.
EMBEDDING METHOD
Quantization type
The marked signal is ontained by quantization Low robustness. Have a high infoirmation capacity.
Amplitude modulation
The marked signal is ontained by additive modification similar to spread spectrum method. Embedded in the spatial domain.
DESIGN REQUIREMENTS
As much information (watermarks) as possible. Capacity Only be accessible by authorized parties. Security Resistance against hostile/user dependent changes Robustness Invisibility Imperceptibility
SIMPLE WATERMARKING
A very simple yet widely used technique for watermarking images is to add a pattern on top of an existing image. Usually this pattern is an image itself - a logo or something similar.
LSB with watermarking information, the image will still look the same to the naked eye.
FREQUENCY-BASED TECHNIQUES
Watermarking in the frequency domain involves selecting the pixels to be modified based on the frequency of occurrence of that particular pixel. Transform an image into the frequency domain. A block-based DCT watermarking approach is implemented. An image is first divided into blocks and DCT is performed on each block. The watermark is then embedded by selectively modifying the middlefrequency DCT coefficients.
FREQUENCY-BASED TECHNIQUES
What is DCT ? Formally, the discrete cosine transform (DCT) is a linear, invertible function
F : RN -> RN (where R denotes the set of real numbers), or equivalently an invertible N N square matrix
FREQUENCY-BASED TECHNIQUES
The image is separated into different resolution The original image is high-pass filtered, yielding the three large images, each describing local changes details in the original image It is then low-pass filtered and downscaled, yielding an approximation image. This image is high-pass filtered to produce the three smaller detail images. And low-pass filtered to produce the final approximation image in the upper-left.
SPREAD-SPECTRUM TECHNIQUES
A Narrow-band signal is transmitted over a much larger bandwidth such that the signal energy presented in any signal frequency is undetectable A watermark is spread over many frequency bins so that the energy in one bin is very small and certainly undetectable.
SPREAD-SPECTRUM TECHNIQUES
SPREAD-SPECTRUM TECHNIQUES
Because the watermark verification process knows the location and content of the watermark, it is possible to concentrate these weak signals into a single output with high SNR (Signal-to-noise ratio). Remark
To destroy such a watermark would require noise of high amplitude to be added to all frequency bins. The location of the watermark is not obvious. Frequency regions should be selected that ensures degradation of the original datafollowing any attack on the watermark.
PART 3
ATTACKING METHODS
Foundations of Attacking
3 effects make detection of watermarking useless:
Watermark cannot be detected. False watermarks are detected. Unauthorized detection of watermark.
Classification of Attacking
Removal attacks Geometrical attacks Cryptographic attacks Protocol attacks
Removal Attacks
Most obvious method Aim for complete removal of watermarking Extreme form of this type is restore the original object Can happen unintentionally due to operations in some certain applications.
Geometrical Attacks
Do not actually remove the embedded watermark Intend to distort the watermark detector synchronization with the embedded information
Cryptographic Attacks
Aim at cracking the security methods in watermarking schemes Finding a way to remove the embedded watermark information Embed misleading watermarks High computational complexity
Protocol Attacks
Aim at attacking the entire concept of the watermarking application First proposed in framework of invertible watermark The attacker subtracts his own watermark from the watermarked data and claims to be the owner Another type is copy attack
Some Methods
Collusion Attack
Estimate the watermark from different works with same watermark The attackers can obtain an approximation of the watermark by averaging the watermarked works
Some Methods
Remodulation Attack
Damage watermark base on watermark estimation
Some Methods
Copy Attack
Estimate a watermark from watermarked data and copy it to some other data