1 / 16

Data Hiding Watermarking for Halftone Images

Data Hiding Watermarking for Halftone Images. Ming Sun Fu , Student Member, IEEE, and Oscar C. Au , Senior Member, IEEE, IEEE TRANSACTIONS ON IMAGE PROCESSING, Vol. 11, No. 4, Apr. 2002, pp. 477 -484. Outline. Introduction Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT )

vashon
Download Presentation

Data Hiding Watermarking for Halftone Images

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. Data Hiding Watermarking for Halftone Images Ming Sun Fu, Student Member, IEEE, and Oscar C. Au, Senior Member, IEEE, IEEE TRANSACTIONS ON IMAGE PROCESSING, Vol. 11, No. 4, Apr. 2002, pp. 477 -484

  2. Outline • Introduction • Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) • Data Hiding with Original Multitone Image (DHED, MDHED) • Conclusions

  3. Introduction • Halftone images • Error diffusion • Jarvis kernel and Steinberg kernel

  4. Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) • Data Hiding Self Toggling(DHST) • use seed generate a set of N pseudo-random location. • embedded 0 or 1 ( 1 bit ) • simple & error correction coding • “salt-and-pepper” noise • intensity being about 128 location [ 10, 752, 950, . . . ] hiding bit stream [ 0 1 0 . . . halftone image Ex. 150 * 150

  5. Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) • Data Hiding Pair Toggling(DHPT) • slave pixel is chosen randomly. • two errors are introduced instead of one • complexity is slightly larger than DHST • fewer“salt-and-pepper” noise • M=

  6. Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) • Data Hiding by Smart Pair Toggling(DHSPT) • Candidate is Min [conafter(m,n)] • Define

  7. Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) • Data Hiding by Smart Pair Toggling(DHSPT) Ex. before after 1+2+2=5 2+1+2+1+1=7 - = 12 +

  8. Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) - W( f(X0, Xmaster) + f(X0, Xmaster)) = 2 before after vertical or horizontalmaster w(i) = 2  conbefore(m, n) + conafter(m, n) = 10 other master w(i) = 1  conbefore(m, n) + conafter(m, n) = 11 -

  9. Data Hiding without Original Multitone Image (DHST, DHPT, DHSPT) conbefore=1+2+2+1+2=8 conafter=11-8=3 conbefore=0 conafter=10-0=10 conbefore=2+2+1=5 conafter=10-5=5

  10. Data Hiding with Original Multitone Image (DHED, MDHED) • Error diffusion

  11. Data Hiding with Original Multitone Image (DHED, MDHED) • Error diffusion

  12. Data Hiding with Original Multitone Image (DHED, MDHED) • Error diffusion

  13. Data Hiding with Original Multitone Image (DHED, MDHED) • Data Hiding Error Diffusion

  14. Data Hiding with Original Multitone Image (DHED, MDHED) • Modified Data Hiding Error Diffusion

  15. Conclusions 4096/(512*512)=1.6 % 28900/(512*512)=11 %

  16. 隱藏多量資料時 good choice Steinberg 皆優於 Jarvis kernel Conclusions 隱藏少量資料時 不見得取得優勢 28900/4096 = 7 倍

More Related