1 / 17

A Lossless Robust Data Hiding Scheme

A Lossless Robust Data Hiding Scheme. Source ： PATTERN RECOGNITION Authors ： Xian-Ting Zeng, Ling-Di Ping, Xue-Zeng Pan Speaker ： Nguyen Thai Son Date ： 2009/11/19. Outline. Related works Proposed scheme Experimental results Conclusions .

tyanne
Télécharger la présentation

A Lossless Robust Data Hiding Scheme

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. A Lossless Robust Data Hiding Scheme Source ：PATTERN RECOGNITION Authors：Xian-Ting Zeng, Ling-Di Ping, Xue-Zeng Pan Speaker： Nguyen Thai Son Date ：2009/11/19

  2. Outline • Related works • Proposed scheme • Experimental results • Conclusions

  3. Related works(1/5) Ni’s scheme a 5 7 205 202 n 1 i å a = - ( a b ) 203 200 206 201 i i n b = i 1 i 208 207 207 201 204 205 202 209 α = [( 5 - 7 )+( 205 - 202 )+( 200 - 203 ) +( 201 - 206 )+( 208 - 207 )+( 207 - 201 ) +( 205 - 204 )+( 209 - 202 )]/ 8 = 1 I Cover image

  4. Related works(2) - Ni’s scheme

  5. Related works(3) - Ni’s scheme 15 5 5 7 7 7 205 215 205 202 202 202 203 203 203 210 200 200 206 206 206 201 201 211 208 218 208 207 207 207 207 217 207 201 201 201 204 204 204 215 205 205 202 202 202 209 209 219

  6. Related works(4) - Ni’s scheme

  7. Related works(5) - Ni’s scheme 252 242 252 3 3 3 13 3 13 52 52 52 embedding 1 242 242 242 62 52 62 48 48 48 58 48 58 83 83 73 73 73 73 60 60 50 62 62 62 59 59 59 69 59 69 75 75 75 63 73 73 original block #1 Case 1 of category 2 α= -3 original block #2 Case 2 of category 4 α= 7 embedding 0 With K=5, compute β= 2K = 10

  8. The proposed scheme (1/5) a 5 7 205 202 n i å a = - ( a b ) 203 200 206 201 i i b = i 1 i 208 207 207 201 Ck is block kth 204 205 202 209 α = [( 5 - 7 )+( 205 - 202 )+( 200 - 203 ) +( 201 - 206 )+( 208 - 207 )+( 207 - 201 ) +( 205 - 204 )+( 209 - 202 )] = 8 Foundation of the propose scheme I Cover image C

  9. The proposed scheme The distribution of αbefore applying extra space The distribution of αafter applying extra space • T and G are 2 thresholds • Explore extra space S1

  10. The proposed scheme Embedding Processes [-T,T] • Embedding bit 0, this block remains intact • Embedding bit 1, the shifting rule like that:

  11. The proposed scheme when embedding bit 0, α [-T, T], bit-0-zone When embedding bit 1, α[T+G, 2T+G] or [-(2T+G),-(T+G)], bit-1-zone

  12. The proposed scheme 5 20 5 5 7 7 7 7 205 205 205 220 202 202 202 202 5 7 205 202 203 203 203 203 200 200 215 200 206 206 206 206 201 216 201 201 203 200 206 201 208 223 208 208 207 207 207 207 222 207 207 207 201 201 201 201 208 207 207 201 204 204 204 204 220 205 205 205 202 202 202 202 209 209 224 209 204 205 202 209 Original block Stego block • Example embedding processes : Extra space S1 α = 8 T = 120 G = 0

  13. The proposed scheme Extracting Processes • Compute the value of αof block • If α [-T, T], bit-0-zone, a bit 0 is extracted • if α[T, 2T+G] or α[-(2T+G),-T], bit-1-zone, a bit 1 is extracted • The cover image can be recovered by:

  14. The proposed scheme 20 5 7 7 205 220 202 202 5 7 205 202 203 203 200 215 206 206 216 201 203 200 206 201 208 223 207 207 207 222 201 201 208 207 207 201 204 204 220 205 202 202 224 209 204 205 202 209 Original block Stego block T = 120 G = 0 • Example for n extracting processes : α = 8 and α [-T,T] Extract bit 0 α = 128 and α [T, 2T+G] Extract bit 1

  15. Experimental results

  16. Conclusions • High embedding capacity and robustness • Simple and efficient • Can be applied to various images

  17. Thank you for listening

More Related