1. Pairwise IPVO-Based Reversible Data Hiding
Source: Multimedia Tools and Applications, vol. 77, no. 11,
pp , 2018
Authors: Shaowei Weng, Jeng-Shyang Pan, Deng Jiehang,
Zhili Zhou
Speaker: Yi Chen
Date: 04/04/2019

2. Outline Related Work Proposed Scheme Experimental Results Conclusions
Improved Pixel Value Ordering(IPVO)
Proposed Scheme
Experimental Results
Conclusions

3. Related Work(1/3) – IPVO
150
145
144
147
149
142
location relationship
sorting 6 3 2 4 5 1 → ↑ ↑ ↑ ↑ ↑ ↑
142,144,145,147,149,150
Original block
150,145,144,147,149,142
142, 144
dmin= =2
149,150
dmax= =1
Original prediction-error
Peng F, Li X, Yang B. Improved PVO-based reversible data hiding[J]. Digital Signal Processing, 2014, 25:

4. Related Work(2/3) – IPVO dmin=144-142=2 dmax=150-149=1
Original prediction-error
d'min=dmin+1=2+1=3
suppose b=1
d'max=dmax+b=1+b=2
Modified prediction-error

5. Modified prediction-error
Related Work(3/3) – IPVO
d'min=dmin+1=2+1=3
142,144,145,147,149,150 ↓ ↓
d'max=dmax+b=1+b=2
minimum
=144-d'min=141
maximum
=149+d'max=151
Modified prediction-error
151
145
144
147
149
141
Modified block

6. location relationship
Proposed Scheme(1/10)
150
145
144
147
149
142
143
146
150,145,144,147,149,142,149,143,146
location relationship
sorting 6 8 3 2 9 4 5 7 1 →
142,143,144,145,146,147,149,149,150 ②
149,149,150
dl1= =0 ①
dl2= =1 ①
142,143,144
ds1= =1; ②
ds2= =-1

7. Proposed Scheme(2/10)
150,150,150
150,152,152
150,150,153
150,152,155

8. location relationship
Proposed Scheme(3/10)
b==0
150+b1
150+b2 ↑ ↑ 1 2 3 →
location relationship
150,150,150
dl1= =0 ②
b==1
150,150,150
dl2= =0
150,150,151 ①
b==2
150,151,151
The reversibility cannot be guaranteed. ×
if(b1==1 and b2==0)

9. Proposed Scheme(4/10) if(b1==1 and b2==0) 150+b1 150+b2 1 2 3 1 3 2 ↑
sorting
150,150,150 →
dl1=0;dl2=0 →
150,151,150 →
150,150,151
Original pixels
Modified pixels ↑
Pixel value ordering is changed.
The reversibility cannot be guaranteed. × 9

10. Proposed Scheme(5/10) 150+b1 151+b2 2 3 1 ↑ ↑ ② 150,150,151A ①
dl1= =0
150,150,152
dl2= =1
150,151,152 2 3 1 B ②
150,150,154
dl1= =0
suppose b1=1
150,151,155 ①
dl2= =4

11. Proposed Scheme(6/10) A B

12. Proposed Scheme(7/10) 152+1 152+b1 4 2 3 ↑ ↑
Pixel value ordering is unchanged.
extraction
150,152,152
150,153,153 → √
Original pixels
b1=1
Modified pixels
dl1= =2
dl2= =0 4 3 2
Pixel value ordering is changed.
b1=0
sorting ×
150,153,152 →
150,152,153 →
Modified pixels

13. Proposed Scheme(8/10) A B C D

14. Proposed Scheme(9/10) We define the block complexity as
The corresponding block is classified into a smooth block. It is utilized for data hiding.
The corresponding block is located in rough regions. It is excluded from embedding.

15. Proposed Scheme(10/10)
Original block
150
145
144
143
147
149
142
151
148
152
Its neighborhood
IENP ={145,147,143,150,152,151,149,148,152}
the block complexity:

16. Experimental Results(1/2)
[28]
[30]
[23]
[31]
[11]

17. Experimental Results(2/2)

18. Conclusions
A mechanism to measure the block complexity more precisely
More smooth blocks can be used to introduce lower embedding distortion