Reversible Data Hiding Based on Histogram Modification of
Reversible Data Hiding Based on Histogram Modification of Pixel Differences IEEE Transactions on Circuits and System for Video Technology, 2009 Authors: Wei-Liang Tai, Chia-Ming Yeh, and Chin-Chen Chang, Reporter : Wei-De Hsu 1
Outlines Introductions Proposed scheme Histogram Modification on Pixel Differences Binary Tree Structure Prevent Overflow and Underflow Embedding Process Extraction Process Experimental results Conclusions 2
Introductions Ni’s scheme P Z 3
Proposed scheme Histogram Modification on Pixel Differences 55 23 55 45 66 99 34 98 55 66 5 0 2 1 3 2 1 44 55 55 23 2 1 1 0 3 2 2 2 1 33 23 76 11 1 0 4 3 6 5 0 0 22 11 54 44 4 1 2 1 4 3 0 0 2 5 3 4 2 1 3 2 1 10 8 6 Series 1 4 2 2 0 0 1 1 22 33 44 55 66 77 88 99 10 10 Secret=10101 4
Proposed scheme Binary Tree Structure 5
Proposed scheme Prevent Overflow and Underflow 6
Proposed scheme Embedding Process 10 10 9 8 8 6 4 2 0 7 6 Series 1 5 Series 1 4 3 1 2 3 4 5 6 7 8 9 10 11 2 1 0 0 1 2 3 4 5 6 7 8 9 10 7
Conclusions Present an efficient extension of the histogram modification technique Introduced a binary tree that predetermines the multiple peak points used to embed messages only information the sender and recipient must share is the tree level L 8
- Slides: 8