1 / 19

Program Homework Implementation of the Spread-Spectrum Watermarking System

Program Homework Implementation of the Spread-Spectrum Watermarking System. 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. Informed Spread-Spectrum Watermarking.

rpeggy
Download Presentation

Program Homework Implementation of the Spread-Spectrum Watermarking System

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Program Homework Implementation of the Spread-Spectrum Watermarking System

  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. Informed Spread-Spectrum Watermarking

  4. Embedder (with original C) • The watermark X = x1 x2… xn ( ex. n = 1000 )xi ~ N(0,1)Use Sign(.) to convert xi into 1 or -1 • The Cover Image C is transformed by N×N DCT. Ct=DCT(C).The coefficients to be altered V = v1 v2… vn(n largest magnitude coefficients in the Ct except DC) • The scaling parameter α (e.g. α = 0.1~100 ?) • Embedding:

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

  6. Informed S-S watermarking system* Ideal Case

  7. Informed S-S watermarking system* Evaluation

  8. Blind Spread-Spectrum Watermarking

  9. Embedder (without original C) • The watermark X = x1 x2… xn ( ex. n = 1000 )xi ~ N(0,1)Use Sign(.) to convert xi into 1 or -1 • The Cover Image C is transformed by N×N DCT. Ct=DCT(C).The coefficients to be altered V = v1 v2… vn(the first n coefficients according to the zigzag order in the Ct except DC) • The scaling parameter α (α =0.1~100 ?) • Embedding:

  10. 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

  11. Blind S-S watermarking systemIdeal Case

  12. Blind S-S watermarking system* Evaluation ?

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

  14. Bonus 1 - Multiple watermarking system

  15. 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

  16. 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.

  17. 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.

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

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

More Related