1. Optimal PPVO-based reversible data hiding
Source : Journal of Visual Communication and Image Representation, vol. 48, pp , Oct 2018
Authors : Shaowei Weng, GuohaoZhang Jeng-Shyang Pan and ZhiliZhou
Speaker : Chia-Shuo Shih
Date : 2018/05/24 1

2. Outline Introduction Related work Proposed method Experimental results
Pixel Value Ordering(PVO)
Related work
PPVO
Histogram Pair Shifting (HPS)
Proposed method
Experimental results
Conclusions 2

3. Introduction --- Pixel Value Ordering (PVO)
PVO is a reversible data hiding method.
high visual quality
low embedding capacity
max 𝑥 ′ =𝑥 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥+𝑏 𝑖𝑓𝑑=1 𝑥 ′ =𝑥+1 𝑖𝑓𝑑>1
min 𝑥 ′ =𝑥 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥−𝑏 𝑖𝑓𝑑=1 𝑥 ′ =𝑥−1 𝑖𝑓𝑑>1
[43] X.L. Li, J. Li, B. Li, B. Yang, “High-fidelity reversible data hiding scheme based on pixel-value-ordering and prediction-error”, Signal Process, vol. 93, no. 1, pp: , 2013. 3

4. Introduction --- Pixel Value Ordering (PVO)
max 𝑥 ′ =𝑥 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥+𝑏 𝑖𝑓𝑑=1 𝑥 ′ =𝑥+1 𝑖𝑓𝑑>1
min 𝑥 ′ =𝑥 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥−𝑏 𝑖𝑓𝑑=1 𝑥 ′ =𝑥−1 𝑖𝑓𝑑>1
𝑋={15,26,25,17}
𝑋𝑠𝑜𝑟𝑡={15,17,25,26} 15 26 25 17 14 27 25 17
𝑠𝑏=1
𝑑𝑚𝑎𝑥=26−25=1
𝑥 ′ =26+1=27
𝑑𝑚𝑖𝑛=17−15=2
𝑥 ′ =15−1=14 4

5. 1 Related work- Pixel-based pixel value ordering
Pixel-based pixel value ordering(PPVO) 1
[48] X.C. Qu, H.J. Kim, “Pixel-based pixel value ordering predictor for high-fidelity reversible data”, Signal Process, vol. 111, pp: , 2015. 5

6. Related work- Pixel-based pixel value ordering2 6

7. 1 Related work- Pixel-based pixel value ordering 7 X’=min(9,10,11)
X’=max(9,10,11) 10 9 11
skip
254
X’=254
253
254
Skip 10
X’=10 11 10
Skip 7

8. 2 Related work- Pixel-based pixel value ordering 8 X’=9 X”=x-b X’=1110 11
X’=9
X”=x-b 11 9 10
X’=11
X”=x-b 10 9 11
skip
254
X’=254
X”=x+b
253
254
Skip 10
X’=10
X“=x-b 11 10
Skip 8

9. Related work- histogram pair shifting (HPS)
[50] X. Wang, J. Ding, Q.Q. Pei, “A novel reversible image data hiding scheme based on pixel value ordering and dynamic pixel block partition”, Inform. Sci, vol. 310, pp: 16-35, 2015. 9

10. Related work- histogram pair shifting (HPS)10

11. Related work- histogram pair shifting (HPS)
MSE=27
MSE=19 11

12. Proposed method 12

13. 𝑆 𝑝 𝐶 𝑝 P Proposed method C1 C9 C2 P C3 C7 C5 C4 C6 C12 C10 C8 C11 C13

14. Proposed method
𝑆 𝑝
 H1(k,vT1)  14

15. Proposed method
𝑃 𝑒,𝑜𝑝𝑡 1∗
 H1(k,vT1) 
𝑃 𝑒,𝑜𝑝𝑡 2∗ 15

16. Proposed method 𝑃 𝑒,𝑜𝑝𝑡 1∗ =0 16 162 161 162 161 163
𝐶 𝑚𝑎𝑥 =162, 𝐶 𝑚𝑖𝑛 =161
p= 𝐶 𝑚𝑎𝑥 ,b=1 16

17. Proposed method 𝑃 𝑒,𝑜𝑝𝑡 1∗ =0 17 129 130 118 103 122 133 125 102 106
124
111
112
128
129
130
118
103
122
134
125
102
106
124
111
112
128
133
𝐶 𝑚𝑎𝑥 =130, 𝐶 𝑚𝑖𝑛 =102
p> 𝐶 𝑚𝑎𝑥 17

18. Experimental results 18

19. Experimental results 19

20. Experimental results 20

21. Conclusions flexible prediction pattern
the optimal-embedding-bin search scheme 21

22. -END- 22