1. Homework Implementing the spread-spectrum watermarking system

2. 2 Reference Ingemar J. Cox, Joe Kilian, F. Thomson Leighton, and Talal Shamoon, "Secure Spread Spectrum Watermarking for Multimedia," IEEE Trans. on Image Processing, Dec. 1997

3. 3 Embedder (with original C) The watermark X = x 1 x 2 … x n ( ex. n = 1000 ) x i ~ N(0,1) Use Sign(.) to convert x i into 1 or -1 The Cover Image C is transformed by N×N DCT. C t =DCT(C). The coefficients to be altered V = v 1 v 2 … v n (n largest magnitude coefficients in the C t except DC) The scaling parameter α ( ex. α=0.1 ) Embedding:

4. 4 Informed Extractor (with original C) The distorted coefficients V * = v * 1 v * 2 … v * n (n largest magnitude coefficients in the C t except DC) The extracted watermark X * = x * 1 x * 2 … x * n

5. 5 Informed S-S watermarking system * Ideal Case

6. 6 Informed S-S watermarking system * Evaluation

7. 7 Embedder (without original C) The watermark X = x 1 x 2 … x n ( ex. n = 1000 ) x i ~ N(0,1) Use Sign(.) to convert x i into 1 or -1 The Cover Image C is transformed by N×N DCT. C t =DCT(C). The coefficients to be altered V = v 1 v 2 … v n (the first n coefficients according to the zigzag order in the C t except DC) The scaling parameter α Embedding:

8. 8 Blind Extractor (without original C) The distorted image C * is transformed by N×N DCT. C *t =DCT(C * ). The distorted coefficients V * = v * 1 v * 2 … v * n (the first n coefficients according to the zigzag order in the C *t except DC) The extracted watermark X * = x * 1 x * 2 … x * n

9. 9 Blind S-S watermarking system Ideal Case

10. 10 Blind S-S watermarking system * Evaluation ?

11. 11 Attack Lossy Compression JPEG compression Geometric Distortion Rotation Cropping Image Processing Blurring

12. 12 Bonus 1 - Multiple watermarking system

13. 13 Bonus 1 - Multiple watermarking system - Challenges Challenge 1 – Extract exactly correct message Increase α? Change the embedding process to Challenge 2 – Maximize the number of watermarks Find out the optimal k Challenge 3 – Improve the fidelity (PSNR or SAD) of embedded image Change the embedding process to

14. Bonus 2 Please propose a blind watermarking scheme of Chiou- Ting Hsu and Ja-Ling Wu, "Hidden Digital Watermarks in Images," IEEE Trans. On Image Processing, Vol.8, No.1, pp.58~68 January. 1999. 14

15. Bonus 3 Watermarking on other multimedia No limitation on multimedia materials. References: Video “Digital Video Watermarking in P-Frames with Controlled Video Bit-Rate Increase”, IEEE Transactions on Information Forensics and Security, 2008. “Blind MPEG-2 Video Watermarking Robust Against Geometric Attacks: A Set of Approaches in DCT Domain”, IEEE Transactions on Image Processing, 2006. Audio “Spread-Spectrum Watermarking of Audio Signals”, IEEE Transactions on Signal Processing, 2003. “Watermarked Movie Soundtrack Finds the Position of the Camcorder in a Theater”, IEEE Transactions on Multimedia, 2009. Graphics “Watermarking Three-Dimensional Polygonal Models Through Geometric and Topological Modifications”, IEEE Journal on Selected Areas in Communications, 1998. Text “Data Hiding in Binary Image for Authentication and Annotation”, IEEE Transactions on Multimedia, 2004. 15

16. 16 Rules Deadline ： 2011-11-09 繳交方式 將整份程式及說明文件壓縮成一個檔案，以附件寄至助教信箱 （ lymanblue@cmlab.csie.ntu.edu.tw ）。@cmlab.csie.ntu.edu.tw 主旨格式： MMSec2011_Homework1_ 學號 _ 姓名 附件檔名格式： MMSec2011_Homework1_ 學號 _ 姓名.rar or.zip 評分標準 程式功能（ 30% ）：可 embed 及 extract watermark message 。 書面報告（ 70% ）： 須詳細解釋如何執行繳交的程式； 須包含 marked image 與 original image 的 PSNR 及類似第六頁 的圖表（ 即用另外 999 個不同的 watermark extract ）； 須包含各項常見攻擊（見第 11 頁，至少需九種）對此浮水印機 制所造成的影響，並整理成圖表。

17. 17 Rules Deadline ： 2011-11-09 Hand-in instructions: Zip all program files, documentation, and report into one file and send it to lymanblue@cmlab.csie.ntu.edu.tw. lymanblue@cmlab.csie.ntu.edu.tw Title the mail as: MMSec2011_Homework1_studentID_Name Name the attached file as: MMSec2011_Homework1_studentID_Name.rar or.zip Grading criteria: Program （ 30% ）： including embed and extract watermark message. Report （ 70% ）： Clearly describe how to execute your program. Count the PSNR value between the marked image and the original image, and use figures (as shown in page 6) to illustrate which message sequence (among all 1000 sequences) is the correct watermark. Compare the influence of all attacks on your watermarking mechanism. You can illustrate that with figures as shown in page 11, and at least do 9 types of attacks.