Reversible Data Hiding Scheme using Prediction Error Expansion
Reversible Data Hiding Scheme using Prediction Error Expansion in Pixel Value Blocking and Ordering Source: International Journal of Applied Engineering Research ISSN , Volume 14, Number 8 (2019) pp. 2029 -2037 Authors: Satyajit De, Biswapati Jana, Alok Haldar Speaker: Rueifong Jhang Date: 2020/02/13
Outline • Related work • Proposed scheme • Experiments • Conclusions
Related work—PVO(Pixel Value Ordering)
Related work—Li et al. ’s Scheme 45 47 51 52 S: 1 44 47 51 53
Related work—Jung’s Scheme Use three pixels block 15 13 16 S: 1 15 Sort: 13, 15, 16 13 17
Proposed scheme 15 13 16
Proposed scheme—Location Map Store by an array Lmap(i)=0 Lmap(i)=1 Lmap(i)=2 No embedding
Proposed scheme Lmap(i)=0 Conditions: si = 0 or si+2=255 OR e 2 ≠ 1 and e 1 ≠ 1
Proposed scheme Prediction error : 126 125 127 S=1 126 125 128
Proposed scheme Prediction error :
Proposed scheme Lmap(i)=1 S: 11
Proposed scheme Lmap(i)=2 S: 01 12
Proposed scheme--Data Extraction Lmap(i)=1 Original pixel values: 125, 126, 127 S=11 Restore the cover pixels 126 125 127 13
Proposed scheme--Data Extraction Lmap(i)=1 Original pixel values: 125, 126, 127 S=01 Restore the cover pixels 126 125 127 14
Experiments(1/2)
Experiments(2/2)
Conclusions • The embedding capability and picture quality are much better than Li et al. ’s method and Jung’s method. • Try to embed three secret bits into three values pixel blocks to improve embedding capability. 17
- Slides: 17