1. Dynamic improved pixel value ordering reversible data hiding
Source : Information Sciences, vol. 489, pp ,  July 2019
Authors : Shaowei Weng, YunQing Shi, Wien Hong and Ye Yao
Speaker : Chia-Shou Shih
Date : 2019/07/25 1

2. Outline Introduction Related work Proposed method Experimental results
Conclusions 2

3. Introduction Smooth area IPVO: The proposed method: 3 50 50
8 secret bits
The proposed method: 50
> 8 secret bits 3

4. Introduction Complex area IPVO: The proposed method: 4 45 49 53 67 5558 63 72 61 66 68 74 70 77 82 44 49 52 67 55 59 63 73 60 66 74 70 75 77 83
The proposed method: 45 49 53 67 55 58 63 72 61 66 68 74 70 77 82 44 49 53 67 55 58 63 72 61 66 68 74 70 77 83 4

5. Related work-Improved Pixel Value Ordering(IPVO)
PVO: d = 1
IPVO: d = 0 or 1
max 𝑥 ′ =𝑥 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥+𝑏 𝑖𝑓𝑑=1 𝑥 ′ =𝑥+1 𝑖𝑓𝑑>1
min 𝑥 ′ =𝑥 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥−𝑏 𝑖𝑓𝑑=1 𝑥 ′ =𝑥−1 𝑖𝑓𝑑>1
max 𝑥 ′ =𝑥+𝑏 𝑖𝑓 𝑑=1 𝑥 ′ =𝑥+1 𝑖𝑓 𝑑>1 𝑥 ′ =𝑥+𝑏 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥+1 𝑖𝑓 𝑑<0
min 𝑥 ′ =𝑥−𝑏 𝑖𝑓 𝑑=1 𝑥 ′ =𝑥−1 𝑖𝑓 𝑑>1 𝑥 ′ =𝑥−𝑏 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥−1 𝑖𝑓 𝑑<0 5

6. Related work-Improved Pixel Value Ordering(IPVO)
max 𝑥 ′ =𝑥+𝑏 𝑖𝑓 𝑑=1 𝑥 ′ =𝑥+1 𝑖𝑓 𝑑>1 𝑥 ′ =𝑥+𝑏 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥+1 𝑖𝑓 𝑑<0
min 𝑥 ′ =𝑥−𝑏 𝑖𝑓 𝑑=1 𝑥 ′ =𝑥−1 𝑖𝑓 𝑑>1 𝑥 ′ =𝑥−𝑏 𝑖𝑓 𝑑=0 𝑥 ′ =𝑥−1 𝑖𝑓 𝑑<0 6

7. Proposed method 7 Classification of smoothness by pixel neighborhood
Data embedding with IPVO
Original image
Stego image 7

8. Proposed method 1≤𝑡≤𝑚 c r 8 𝑛=𝑟∗𝑐 𝑡=𝑡𝑎𝑟𝑔𝑒𝑡 𝑏𝑙𝑜𝑐 𝑘 ′ 𝑠 𝑠𝑚𝑜𝑜𝑡ℎ 𝑙𝑒𝑣𝑒𝑙
𝑚= (𝑛−1)/2 c r
1≤𝑡≤𝑚
Original image
Target block 8

9. Proposed method 𝑡=1 𝑡+1 & (𝑛−𝑡) n=3*3 9 82 81 89 93 96 95 94 98 99 82
𝑡+1 & (𝑛−𝑡) 82 81 89 93 96 95 94 98 99 82 81 89 95 96 93 94 98 99 81 82 89 93 94 95 96 98 99
82-81
d=1
98-99
d=-1 81 82 89 93 94 95 96 98 99
Secret bit = 0 82 81 89 93 96 95 94 98
100 81 82 89 93 94 95 96 98
100 9

10. Proposed method 𝑡=2 𝑡+1 & (𝑛−𝑡) n=3*3 10 82 81 93 98 95 94 97 99 82 81
𝑡+1 & (𝑛−𝑡) 82 81 93 98 95 94 97 99 82 81 95 98 93 94 97 99 81 82 93 94 95 97 98 99 -1 1 -2 81 82 93 94 95 97 98 99
Secret bit = 0 81 80 82 93 98 95 94 97
100
Secret bit = 1 80 81 82 93 94 95 97 98
100 10

11. Proposed method 𝑡=4 𝑡+1 & (𝑛−𝑡) n=3*3 11 79 77 76 78 73 79 77 76 78 73
𝑡+1 & (𝑛−𝑡) 79 77 76 78 73 79 77 76 78 73 73 76 77 78 79 4 1 1 -1 2 -2 73 76 77 78 79
Secret bit = 010
Secret bit = 1 80 77 76 78 79 75 72 72 76 75 77 78 79 80 11

12. Proposed method-extract and recover
𝑡=4
n=3*3
𝑡+1 & (𝑛−𝑡) 80 77 76 78 79 75 72 80 77 78 76 79 75 72 72 75 76 77 78 79 80
𝑑=−1 →𝑏=1 𝑑=0 → 𝑏=0 𝑑=1 → 𝑏=0 𝑑=2 → 𝑏=1 5 2 1 -1 -2 3 -3
Secret bit = 0101 72 75 76 77 78 79 80
b=1
b=0
b=0 79 77 76 78 73
b=1 73 76 77 78 79 12

13. Experimental results
Weng et al.’s Alg: S.W. Weng, J.-S. Pan, L.D. Li “Reversible data hiding based on an adaptive pixel-embedding strategy and two-layer embedding” Inf. Sci., 369 (2016), pp. 
Ou et al’s Alg: B. Ou, X.L. Li, Y. Zhao, R.R. Ni “Reversible data hiding using invariant pixel-value-ordering and prediction-error expansion” Signal Process. Image Commun., 29 (7) (2014), pp. 
Peng et al.’s Alg: F. Peng, X.L. Li, B. Yang “Improved pvo-based reversible data hiding” Digit. Signal Process., 25 (2014), pp. 
Sachnev et al.’s Alg: V. Sachnev, H.J. Kim, J. Nam, S. Suresh, Y.Q. Shi “Reversible watermarking algorithm using sorting and prediction” IEEE Trans. Circuits Syst. Video Technol., 19 (7)(2009), pp.  13

14. Experimental results 14

15. Conclusions Dynamic IPVO RDH method
Partition the local complexity into m+1 levels 15

16. -END- 16