1 / 15

A New Data Hiding Method in Binary Image

A New Data Hiding Method in Binary Image. Authors: Jeanne Chen, Tung-Shon Chen, Meng- Wen Cheng Source: Proceedings of the IEEE Fifth International Symposium on Multimedia Software Engineering, 2003, pp. 88 - 93 Speaker: Yu-Chi Liu ( 劉又齊 ) Date: 2004/09/22. Outline.

ozzy
Download Presentation

A New Data Hiding Method in Binary Image

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 New Data Hiding Method in Binary Image Authors: Jeanne Chen, Tung-Shon Chen, Meng- Wen Cheng Source: Proceedings of the IEEE Fifth International Symposium on Multimedia Software Engineering, 2003, pp. 88 - 93 Speaker: Yu-Chi Liu (劉又齊) Date: 2004/09/22

  2. Outline • Block Data Hiding Method ( BDHM ) • Data Hiding • Partitioning Block • Calculating Characteristic Value • Hiding the Data • Data Retrieving • Experimental Result • Conclusions • Comments

  3. Secret data Partitioned block Calculating characteristic value Data hiding Stego- image Original image Partitioned block Calculating characteristic value Data retrieving Stego- image Secret data Flow for data hiding and retrieving Block Data Hiding Method ( BDHM ) return

  4. 4x4 … 0 1 0 1 0 1 … 1 0 0 0 0 1 0 1 0 1 0 0 1 0 0 0 1 0 0 1 BjS1 BjS2 … … … … … … 1 0 0 0 1 1 0 1 1 0 0 0 0 1 block j … 0 0 0 0 0 1 … 1 1 0 1 0 1 … BjS3 BjS4 The original MxM image partition into 4x4 blocks Repartitioning into 3x3 sub-blocks Partitioning Block

  5. 0 1 0 1 0 1 1 0 0 r1=3 0 0 1 r2=3 0 0 0 0 0 1 Calculated characteristic value 0 1 0 1 BjS1 BjS2 Rj=3 1 0 0 1 1 0 0 0 T=3 1 1 0 1 1 0 0 0 0 1 Bj 0 0 r3=4 0 0 0 r4=3 1 1 1 0 1 0 1 BjS3 BjS4 Calculating Characteristic Value (1/4) • ri = characteristic value of sub-block i • ( pixel value = 1‘s number in sub-block ) • Rj = characteristic value of block j • ( min r of sub-blocks ) T = Number of min r

  6. 0 1 0 1 0 1 0 0 0 0 1 1 1 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 0 1 1 1 1 0 0 0 1 1 1 1 1 0 1 0 1 0 0 1 1 0 1 1 1 1 0 1 0 0 1 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 1 1 0 0 1 1 Rj=3 Rj=4 Rj=5 Rj=7 Rj=2 1 0 0 1 0 1 If Rj=0 If Rj=9 0 1 0 1 0 1 1 0 0 1 1 0 Calculating Characteristic Value (2/4) • Sorting blocks in ascending order by Rj … … Select for 3 ≤ Rj ≤ 6 else no action to these block And why ?

  7. Wj = 4 Wj = 7 Calculating Characteristic Value (3/4) • Definition • Wj = number of neighbor pixels with similar value in block j Characteristic： 0 1 0 1 Rj=3 1 0 0 1 Wj=7 1 0 0 0 1 1 0 1 Bj

  8. 0 0 1 1 0 1 0 1 0 0 1 1 1 0 0 0 1 1 0 1 0 0 0 0 0 0 1 0 1 1 0 0 1 0 1 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 0 0 1 1 1 0 0 Rj=5 Rj=3 Rj=4 Rj=4 Wj=4 Wj=7 Wj=8 Wj=7 Fj=9 Fj=10 Fj=11 Fj=12 Calculating Characteristic Value (4/4) • Sorting blocks in ascending order by Fj • Fi = Rj + Wj …

  9. 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 0 Partitioned 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 1 1 0 1 1 1 0 1 r1=3 r2=3 r3=4 r4=3 Fj=10, T=3, Rj=3 Hiding the Data (1/2) • If we want to hiding data that value is 1 , and we • don’t to doing anything.

  10. 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 0 Partitioned 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 1 1 0 1 1 1 0 1 r1=3 r2=3 r3=4 r4=3 Fj=10, T=3, Rj=3 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 1 r1=3 r2=3 r3=3 r4=3 Fj=10, T=4, Rj=3 Hiding the Data (2/2) • If we want to hiding data that value is 0, then we • must change T value to 2 or 4.

  11. 0 1 0 1 0 1 1 0 0 0 0 1 0 1 0 1 0 0 1 0 0 0 1 0 0 1 r1=3 r2=3 1 0 0 0 0 1 0 1 1 0 0 0 0 1 block j 0 0 0 0 0 1 0 1 0 1 0 1 r3=3 r4=3 Data Retrieving 4x4 Rj =3 … … Wj=7 … … … … … … Fj=10 … T=4 … … The stego- image partition into 4x4 blocks Repartitioning into 3x3 sub-blocks Hidden data = 0 F value decision to data retrieve order T value decision to hidden data is 0 or 1 go

  12. Experimental Result

  13. Experimental Result

  14. Experimental Result

  15. Experimental Result

More Related