Introduction to Watermark

Advisor Student

Outline
Review of watermarking Applications and examples of watermarking Some architectures of watermarking combined with other techniques

Motive of watermarking
Recent advancements in computer technologies offer many facilities for duplication, distribution, creation, and manipulation of digital contents. Encryption is useful for transmission but does not provide a way to examine the original data in its protected form.

Watermarking process
1) Embedding stage

Spatial domain
flipping the low-order bit of each pixels embedding the watermark in mid-frequency components relatively robust to noise, image processing and compression the quality of the host image will be distorted significantly if too much data is embedded

Frequency domain

2) Distribution stage
Compression, transmission error, and common image processing are seen as an attack on the embedded information

Watermarking process
3) Extraction stage
Blind extraction without original image Semi-blind rely on some data or features Non-blind need original image Evaluate the similarity between the original and detected watermark
False positivewatermark is detected although there is none False negativeno watermark is detected while there is one

4) Detection stage

Watermarking properties
Perceptual transparency Robustness
The mark should resist to
Common signal processing like lossy compression Geometric transformation like image rotation, scaling, and cropping

Security
How easy it is to intentionally remove a watermark

Data capacity
Amount of information that can be stored within the content

Categories of digital watermark

Perceptible Imperceptible Robust
ownership assertion

Fragile
indicate modifications of the content

Semi-fragile
differentiate between lossy transformation that are info. preserving and lossy transformation which are info. altering

Applications
Copyright Protection
Invisible watermark which can tolerate malicious and unintentional attacks It does not prevent people from copying the digital data

Data Hiding
It tries to invisibly embed the maximum amount of data into a host signal => this allows communication using enciphered messages without attracting the attention of a third party Robustness is not important while invisibility and capacity are required

Applications
Authentication and Data Integrity
Verification watermarks are required to be fragile, so that any modification to the image will destroy the mark

Copy Protection
Requirements
Robustness against removal Ability of blind detection Capability of conveying non-trivial number of bits

Applications
Fingerprinting
Trace the source of illegal copies
Different watermarks are embedded by the owner in the copies of the data that are supplied to different customers Transparency and robustness are required

Examples of watermarking
Image Watermarking Document Watermarking Graphics watermarking Video watermarking

Image Watermarking
Robust and imperceptible
The watermark may be scaled appropriately to minimize noticeable distortion to the host

Examples
Texture-based watermark
Embed it into a portion of the image with similar texture

Insert a watermark into the phase components

The phase information is perceptually more inportant than the magnitude data

Document Watermarking
Line-shifts Word-shifts

Document Watermarking
Slight modifications to characters

Graphics Watermarking
Embedding in facial animation parameter (FAP) data
The amount of deviation the watermark signal has on FAP is limited to minimize visible distortion
1% for head rotation 3% for lip motion

Video Watermarking
Copy generation management
Minimum information that must convey
Copy never Copy once Copy no more Copy freely

For DVD, real-time decoding is required Detector placement

Detection in the drive Detection within the application (within MPEG decoder)

Video Watermarking
Examples
For video coding like MPEG or H.26x, we embed the watermark into DCT coefficients
Only partial decoding of block DCT is necessary for watermark embedding If constant bit rate is required, only nonzero DCT coefficients are marked

Layered Access Control Schemes on Watermarked Scalable Media

Scalability spatial, temporal and SNR scalability A typical MPEG-2 conditional access receiver

Layered Access Control Schemes on Watermarked Scalable Media

A typical MPEG-2 conditional access receiver
Control Word change very often so that fast (simple) decryption algorithm would not be broken easily EMM (Entitlement Management Message) with the aid of EMM, the broadcaster can change the status of the user accessibility of contents ECM (Entitlement Control Message)

Layered Access Control Schemes on Watermarked Scalable Media

A typical MPEG-2 conditional access receiver
Problem
We send the key to user via reliable channel, while the content goes through an unreliable channel. Key and contents wont arrive at the same time => Synchronization problem

Solution
Using robust watermark to embed the ECM and EMM information into the content

Layered Access Control Schemes on Watermarked Scalable Media

Receiver architecture of the proposed method

Layered Access Control Schemes on Watermarked Scalable Media

Receiver architecture of the proposed method
Current layer is decrypt by the key Ki extracted from past layer The user key Gi should be obtained before receiving media data, for instance, by manually or automatically update after subscription

Conclusion
Cryptography does not provide error tolerance. By combining cryptography and robust watermarking techniques, the key receives stronger error-protection since the robust watermark can tolerate transmission errors/attacks The key is implicitly synchronized to the content

A Novel Public Watermarking System based on Advanced Encryption System

Motive
Almost proposed watermarking methods keep the watermarking algorithm private to ensure the embedded watermark secret

Proposed watermark embedding algorithm

2 different watermarks for the spatial and frequency domain separately
Robust watermark for frequency domain Fragile watermark is embedded into the LSB plane in spatial domain

A Novel Public Watermarking System based on Advanced Encryption System

Robust watermark embedding algorithm
1. 2. 3. 4. WRS = RS_Encode(Wo) IZ = Set_LSB_Zero(Io) CS0 = DWT(IZ) MSCPS = Order_of_Significant_Coefficients(CS0, k, ||WRS||)
C-MSCPS = Rijndael_Encrypt(MSCPS, K) WMPS = Select_Watermark_Positions(C-MSCPS, ||WRS||)

5. CSw = Embed_Robust_Watermark(CS0, WMPS, WRS) 6. Iwf = IDWT(CSw)

A Novel Public Watermarking System based on Advanced Encryption System

Robust watermark embedding algorithm Details in step 4
k||WRS|| most significant coefficients (MSC) of the LL band of CS0 are selected first The order of these MSC is reordered in the descending order of magnitude to be MSCPS Cipher-MSCPS (C-MSCPS) is obtained by encrypting MSCPS with a key K using the Rijndael block cipher Finally, ||WRS|| most significant bytes of C-MSCPS are selected as the embedding positions => We embed the first bit of WRS into the position corresponds to the most significant byte of the C-MSCPS

A Novel Public Watermarking System based on Advanced Encryption System

Robust watermark embedding algorithm Examples of step 4

A Novel Public Watermarking System based on Advanced Encryption System

Robust watermark embedding algorithm The watermarking method in step 5
If WRS(i) = 0, then vi = vi (1 ) If WRS(i) = 1, then vi = vi (1 +)

In sum, the watermark is added to the significant coefficients of the LL band of the original image to ensure its robustness

A Novel Public Watermarking System based on Advanced Encryption System

Fragile watermark embedding algorithm
7. 8. Iwfz = Set_LSB_Zero(Iwf) RS-ECC = Generate_RS_ECC(Iwfz)
RS-ECC contains all the parity check bits of Encoded ReedSolomon code

9. C-RS-ECC = Rijndael_Encrypt(RS-ECC, K) 10. Iw = Embed_Fragile_Watermark(Iwfz, C-RS-ECC)

All the LSB of Iwf are replaced with C-RS-ECC in a raster scan order

A Novel Public Watermarking System based on Advanced Encryption System

Conclusion
The robust watermark WRS is used to carry the copyright information while the fragile watermark C-RS-ECC is used to verify the image integrity and capable of providing the ability to recover altered image

A Novel Public Watermarking System based on Advanced Encryption System

Watermark Extraction Procedure

Inspection phase
The test Iw image is inspected whether Iw is altered or not

Extraction phase

Inspection phase
1. 2. 3. 4. (Iwz, C-RS-ECC) = Extract_Fragile_Watermark_and_Set_LSB_Zero(Iw) RS-ECC = Rijndael_Decrypt(C-RS-ECC, K) RS-ECC = Generate_RS_ECC (Iwz) If RS-ECC == RS-ECC, jump to Extraction phase Fix_Image(Iwz, RS-ECC)

A Novel Public Watermarking System based on Advanced Encryption System

Extraction phase
1. 2. 3. CSW = DWT(Iwz) CS0 = DWT(IZ) MSCPS = Order_of_Significant_Coefficients(CS0, k, ||WRS||)
C-MSCPS = Rijndael_Encrypt(MSCPS, K) WMPS = Select_Watermark_Positions(C-MSCPS, ||WRS||)

4.

WRS = Extract_Robust_Watermark(CSW, CS0, WMPS)

WRS(i) = 1, if vi > vi WRS(i) = 0, if vi < vi

5.

W = RS_Decode(WRS)

A Novel Public Watermarking System based on Advanced Encryption System

Flow chart of watermark extraction

Reference
1. W.A. Wan Adnan, S. Hitam, S. Abdul-Karim, M.R.Tamjis, A Review of Image Watermarking, in Proceedings, Student Conference on Research and Development, Aug. 2003, pp.381384 C.I. Podilchuk, E.J. Delp, Digital WatermarkingAlgorithms and Applications, IEEE Signal Processing Magazine, Vol. 18 Issue 4, July 2001, pp. 33-46 S.H. Kwok, C.C. Yang, K.Y. Tam, Watermark Design Pattern for Intellectual Property Protection in Electronic Commerce Applications, in Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, Vol. 2, Jan 4-7 2000.

2.

3.

Reference
4. F.C. Chang, H.C. Huang, H.M. Hang, Layered access control schemes on watermarked scalable media, IEEE International Symposium on Circuits and Systems, Vol. 5, May 2005, pp. 4983-4986 K.M. Chan, L.W. Chang, A novel public watermarking system based on advanced encryption system, International Conference on Advanced Information Networking and Applications, Vol. 1, 2004, pp. 48-52

5.