Reversible data hiding based on
an adaptive pixel-embedding
strategy and two-layer
embedding
Source : Information Sciences
Volume 369, 10 November 2016, Pages 144–159
Author : Shaowei Weng, Jengshyang Pan, Leida Li
Speaker : JunYong Chen
Date : 3/16
1
Outline
• Proposed Scheme
• Embedding phase
• Extraction phase
• Experimental Results
• Conclusions
2
Proposed Scheme – Embedding phase
160 158 159 157
160 159 159 156
158 159 159 157
158 156 157 155
Original image
𝑚𝑒𝑎𝑙 𝑣𝑎𝑙𝑢𝑒 ∶
𝜎=
157+156+157+155+157+156+158+160+158+159+158+159+159
13
(157−158)2 +(156−158)2 + ⋯+(159−158)2 +(159−158)2
10
= 158
𝑖𝑓 𝜎 ≤
𝑇ℎ
4
= G1, ℎ𝑖𝑑𝑖𝑛𝑔 6𝑏𝑖𝑡s
𝑇ℎ
𝑇ℎ
𝑖𝑓
<𝜎≤
= G2, ℎ𝑖𝑑𝑖𝑛𝑔 4𝑏𝑖𝑡𝑠
4
2
=1.207
𝑖𝑓
𝑇ℎ
< 𝜎 = 𝐺3, ℎ𝑖𝑑𝑖𝑛𝑔 2𝑏𝑖𝑡𝑠
2
𝑇ℎ = 4
3
Proposed Scheme – Embedding phase
𝑝1
𝑇ℎ
𝑇ℎ
<𝜎≤
= G2
4
2
4
4
< 1.207 ≤ = G2
4
2
160
𝑝2
𝑝3
𝑝4
𝑝5
𝑝6
𝑝7
𝑝8
𝑝9
158
159
160
159
159
158
159
159
Sort value
𝑝2
158
𝑝7
𝑝3
𝑝5
𝑝6
𝑝8
𝑝9
𝑝1
𝑝4
158
159
159
159
159
159
160
160
𝑑1𝑚𝑖𝑛 = 𝑝2 − 𝑝3 = −1
𝑑1𝑚𝑎𝑥 = 𝑝4 − 𝑝9 = 1
𝑑2𝑚𝑖𝑛 = 𝑝3 − 𝑝7 = 1
𝑑2𝑚𝑎𝑥 = 𝑝1 − 𝑝9 = 1
4
Proposed Scheme – Embedding phase
S:0101001
𝑝2
𝑝7
𝑝3
𝑝5
𝑝6
𝑝8
𝑝9
𝑝1
𝑝4
158
158
159
159
159
159
159
160
160
p4’ = p4 + b = 160
p1’ = p1 + b = 161
p2’ = p2 – 1 = 157
p7’ = p7 – b = 157
𝑝2′
157
𝑝7′
158
𝑝3′
159
𝑝5′
159
𝑝6′
159
𝑝8′
159
𝑝1′
𝑝9′
159
161
𝑑1𝑚𝑖𝑛 = 𝑝2 − 𝑝3 = −1
𝑑1𝑚𝑎𝑥 = 𝑝4 − 𝑝9 = 1
𝑑2𝑚𝑖𝑛 = 𝑝3 − 𝑝7 = 1
𝑑2𝑚𝑎𝑥 = 𝑝4 − 𝑝9 = 1
𝑝4′
160
5
Proposed Scheme – Embedding phase
𝑝2′
157
𝑝7′
158
𝑝3′
159
𝑝5′
159
𝑝6′
159
𝑝8′
159
𝑝9′
159
𝑝1′
𝑝4′
161
160
Sort position
Stego image
𝑝1′
161
𝑝2′
157
𝑝3′
𝑝4′
𝑝5′
𝑝6′
𝑝7′
𝑝8′
𝑝9′
159
160
159
159
158
159
159
6
Proposed Scheme – Extraction phase
Stego image
𝑝1′
161
𝑝2′
157
𝑝3′
𝑝4′
𝑝5′
𝑝6′
𝑝7′
𝑝8′
𝑝9′
159
160
159
159
158
159
159
7
Proposed Scheme – Extraction phase
𝑝1′
161
𝑝2′
157
𝑝3′
𝑝4′
𝑝5′
𝑝6′
𝑝7′
𝑝8′
𝑝9′
159
160
159
159
158
159
159
𝑖𝑓 𝑑′𝑚𝑎𝑥 > 0, 𝑑′𝑚𝑎𝑥 ∈ 1,2 , 𝑏 = 𝑑 ′1𝑚𝑎𝑥 − 1, 𝑝′ − 𝑏
𝑖𝑓 𝑑′𝑚𝑎𝑥
𝑑′𝑚𝑎𝑥 > 2, no hidden data, p′ − 1
≤ 0, 𝑑 ′ 𝑚𝑎𝑥 ∈ 0, −1 , 𝑏 = −𝑑 ′1𝑚𝑎𝑥 , 𝑝′ − 𝑏
𝑑′𝑚𝑎𝑥 < −1, no hidden data, p′ − 1
𝑝2′
157
𝑝7′
158
𝑝3′
𝑝5
𝑝6
𝑝8
𝑝9
𝑝1
𝑝4
159
159
159
159
159
160
160
𝑑′1𝑚𝑎𝑥 − 1 = 0
𝑑′2𝑚𝑎𝑥 − 1 = 1
𝑑′1𝑚𝑎𝑥 = 𝑝4′ − 𝑝9′ = 1
S:01
𝑑′2𝑚𝑎𝑥 = 𝑝1′ − 𝑝9′ = 2
8
Proposed Scheme – Extraction phase
𝑝1′
161
𝑝2′
157
𝑝3′
𝑝4′
𝑝5′
𝑝6′
𝑝7′
𝑝8′
𝑝9′
159
160
159
159
158
159
159
𝑖𝑓 𝑑′𝑚𝑖𝑛 > 0, 𝑑′𝑚𝑖𝑛 ∈ 1,2 , 𝑏 = 𝑑 ′1𝑚𝑖𝑛 − 1, 𝑝 + 𝑏
𝑖𝑓 𝑑′𝑚𝑖𝑛
𝑑′𝑚𝑖𝑛 > 2, no hidden data, p + 1
≤ 0, 𝑑 ′ 𝑚𝑖𝑛 ∈ 0, −1 , 𝑏 = −𝑑 ′1𝑚𝑖𝑛 , 𝑝 + 𝑏
𝑑′𝑚𝑖𝑛 < −1, no hidden data, p + 1
𝑝2
𝑝7
𝑝3
𝑝5
𝑝6
𝑝8
𝑝9
𝑝1
𝑝4
158
158
159
159
159
159
159
160
160
𝑑′1𝑚𝑖𝑛 = 𝑝2 − 𝑝3 = −2
𝑑′2𝑚𝑖𝑛 = 𝑝3 − 𝑝7 = 1
𝑑′1𝑚𝑖𝑛 𝑛𝑜 ℎ𝑖𝑑𝑑𝑒𝑛 𝑑𝑎𝑡𝑎
𝑑′2𝑚𝑖𝑛 − 1 = 0
S:010…
9
Proposed Scheme – Extraction phase
𝑝2
𝑝7
𝑝3
𝑝5
𝑝6
𝑝8
𝑝9
𝑝1
𝑝4
158
158
159
159
159
159
159
160
160
Original image
Sort position
𝑝1
160
𝑝2
𝑝3
𝑝4
𝑝5
𝑝6
𝑝7
𝑝8
𝑝9
158
159
160
159
159
158
159
159
10
Proposed Scheme
𝐵𝑖𝑡𝑠𝑡𝑟𝑒𝑎𝑚 𝐿
𝑇ℎ
𝑟
𝑐
𝑀𝑇
𝐸𝐶
#𝐸𝑂𝑆
1 𝑙𝑎𝑦𝑒𝑟
𝐵𝑖𝑡𝑠𝑡𝑟𝑒𝑎𝑚 𝐿 = 𝐿𝑆 𝑏𝑖𝑡𝑠
2 𝑙𝑎𝑦𝑒𝑟
𝐶𝑜𝑚𝑝𝑟𝑒𝑠𝑠𝑒𝑑 𝑙𝑜𝑐𝑎𝑡𝑖𝑜𝑛 𝑚𝑎𝑝
1 𝑙𝑎𝑦𝑒𝑟
𝑇ℎ = 8𝑏𝑖𝑡𝑠
2 𝑙𝑎𝑦𝑒𝑟
𝑇ℎ𝑟𝑒𝑠ℎ𝑜𝑙𝑑
𝑟 = 3𝑏𝑖𝑡𝑠
𝑐 = 3𝑏𝑖𝑡𝑠
𝑀𝑇 = 5𝑏𝑖𝑡𝑠
𝑆𝑖𝑧𝑒 𝑜𝑓 𝑏𝑙𝑜𝑐𝑘
2 𝑙𝑎𝑦𝑒𝑟
1 𝑙𝑎𝑦𝑒𝑟
𝐸𝐶 = 19𝑏𝑖𝑡𝑠
#𝐸𝑂𝑆 = 8𝑏𝑖𝑡𝑠
2 𝑙𝑎𝑦𝑒𝑟
𝐶𝑎𝑝𝑎𝑐𝑖𝑡𝑦(1𝑏𝑖𝑡 + 512 × 512)
11
Experimental Results
12
Experimental Results
13
Experimental Results
Fig. 7.
Performance comparisons between the proposed method and
the following five methods: Ou et al. [28], Peng et al. [30], Li et
al. [23], Sachnev et al. [32], and Hong et al. [11].
14
Experimental Results
•[11]
•W. Hong
•Adaptive reversible data hiding method based on
error energy control and histogram shifting
•Opt. Commun., 285 (2) (2012), pp. 101–108
•[23]
•X.L. Li, W.M. Zhang, X.L. Gui, B. Yang
•A novel reversible data hiding scheme based on twodimensional difference-histogram modification
•IEEE Trans. Inf. Forensic Secur., 8 (7) (2013), pp. 1091–
1100
•[28]
•B. Ou, X.L. Li, Y. Zhao, R.R. Ni
•Reversible data hiding using invariant pixel-valueordering and prediction-error expansion
•Signal Process. Image Commun., 29 (7) (2014), pp. 198–
205
15
Experimental Results
•[30]
•F. Peng, X.L. Li, B. Yang
•Improved PVO-based reversible data hiding
•Digit. Signal Process., 25 (2014), pp. 255–265
•[32]
•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. 989–999
16
Conclusions
• The author’s method can carry 2 data bits, 4 data bits or 6 data bits
adaptively according to the local complexity level by smooth block.
• Better image quality.
17