1 / 18

Reversible Date Hiding Based on Histogram Modification of pixel Differences

Reversible Date Hiding Based on Histogram Modification of pixel Differences. IEEE Transactions on circuits and systems for video technology, VOL. 19, NO. 6,JUNE 2009 Wei-Liang Tai,  Chia -Ming Yeh ,   Chin-Chen Chang 報告者 : 許睿 中 日期 :6.20. Outline. Introductions Proposed

makoto
Download Presentation

Reversible Date Hiding Based on Histogram Modification of pixel Differences

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. Reversible Date Hiding Based on Histogram Modification of pixel Differences IEEE Transactions on circuits and systems for video technology, VOL. 19, NO. 6,JUNE 2009 Wei-Liang Tai,  Chia-Ming Yeh,   Chin-Chen Chang 報告者:許睿中 日期:6.20

  2. Outline • Introductions • Proposed • Experimental results • Conclusions

  3. Introductions • Ni et al. proposed ”Reversible data hiding” • While multiple pairs of peak and minimum points can be used for embedding , the pure payload is still a little low. • Multiple pairs of peak and minimum point must be transmitted to the recipient.

  4. Proposed x xi-1 : predictive pixel xi : original pixel peak 2 3 3 2 2 2 d -1 -1 0 0 1 1 2 2 2 0 0 0 3 0 Secret=101 Secret=101 yi=xi+b =2+1 =3 y

  5. Proposed x xi-1 : predictive pixel xi : original pixel peak 2 3 3 2 2 2 d 1 -1 1 1 -1 1 3 3 3 0 0 1 4 4 1 2 2 2 2 2 2 2 0 0 3 3 3 3 3 0 3 0 Secret=101 yi=xi-1 =2-1 =1 y

  6. Proposed peak peak

  7. Proposed y x 2 peak 1 3 4 2 2 3 3 di=yi-xi-1 =3-2 =1 b=1 xi=yi-1 =3-1 =2

  8. Proposed y x 2 3 3 2 2 peak 1 3 4 2 2 3 3 di=yi-xi-1 =4-2 =2 xi=yi-1 =4-1 =3

  9. Proposed-Binary Tree Structure Binary Tree Structure number of peak point=2L

  10. Proposed-Prevent Overflow or Underflow

  11. Proposed-Embedding 136 133 129 130 x 150 132 139 Embedding level L=2 -6 d -6 129 Secret=101 yi=xi-2L =133-4 =129 7 -1 -2 150 150 -18 3 2L 0 -2L y

  12. Proposed-Embedding 136 133 129 130 x 150 132 139 Embedding level L=2 -6 d 129 Secret=101 Secret=101 yi=xi+(di+b) =139+(3+1) =143 7 -1 -2 150 150 -18 3 2L 0 -2L y 143

  13. Proposed-Embedding 136 133 129 130 x 150 132 139 Embedding level L=2 -6 d 137 Secret=101 yi=xi+2L =136+4 =140 7 -1 -2 150 150 -18 3 2L 0 -2L y 128 127 128 140 143

  14. Proposed-Embedding 2L+1 -2L+1 -2L 2L 0

  15. Proposed-Extraction y 140 129 128 127 150 128 143 Embedding level L=2 x 132 di=yi-xi-1 =128-150 =-22 xi=yi+2L =128+4 =132 150 0 -2L+1 2L+1

  16. Proposed-Extraction y 140 129 128 127 150 128 143 Embedding level L=2 x 132 130 129 136 139 133 di=yi-xi-1 =127-132 =-5 150 b=1 0 -2L+1 2L+1

  17. Experimental results

  18. Conclusion • In this letter, we have presented an efficient extension of the histogram modification technique by considering the differences between adjacent pixels rather than simple pixel value. • One common drawback of virtually all histogram modification techniques is that they must provide a side communication channel for pairs of peak and minimum points. • To solve this problem, we introduced a binary tree that predetermines the multiple peak points used to embed messages; thus, the only information the sender and recipient must share is the tree level L.

More Related