1. A high capacity reversible data hiding scheme based on right-left shift
Source : Signal Processing, vol. 150, pp ,  September 2018
Authors : Wang Weiqing , Ye Junyong , Wang Tongqing and Wang Weifu
Speaker : Chia-Shuo Shih
Date : 2018/08/30 1

2. Outline Related work Proposed method Experimental results Conclusions2

3. Related work-Histogram shifting2 3 4 5 1
Z. Ni, Y.Q. Shi, N. Ansari, W. Su
Reversible data hiding
IEEE Trans. Circuits Syst. Video Technol., 16 (3) (2006), pp.  3

4. Related work-Histogram shifting2 3 5 6 1 4

5. Related work-Histogram shifting2 3 5 6 1 2 3 5 6 4 1
s = 5

6. Proposed method 6

7. Proposed method 7 𝑍 𝑙𝑖 (i = 1,2…) 𝑍 𝑙1 = -78 , 𝑍 𝑙2 = -79,
𝑍 𝑙1 = -78 , 𝑍 𝑙2 = -79,
𝑍 𝑙3 = -80 , 𝑍 𝑙4 = -81,…
p(i,j)
p(i,j+1)
p(i+1,j)
p(i+1,j+1)
𝑍 𝑟𝑖 (i = 1,2…)
𝑍 𝑟1 = 83 , 𝑍 𝑟2 = 86,
𝑍 𝑟3 = 87 , 𝑍 𝑟4 = 88,… 7

8. Proposed method 8

9. Proposed method 𝑡 𝑛 =2 𝑝 𝑝 (1,1) = 203+111+152 3 = 155
151
203
173
194
160
187
149
120
111
152
155
162
185
170
142
135
138
113
154
150
148
117
171
174
200
161
166
156
145
186
176
177
169
165
184
159
127
196
181
178
183
137
141
146
151
p(1,1) =
𝑝 𝑝 (1,1) = = 155
151
203
111
152
d(1,1) = 151 – 155 = -4
𝑝 𝑝 (1,7) = = 144
149
120
170
142
149
d(1,7) = 149 – 144 = 5
p(1,7) =
𝑝 𝑝 (5,6) = = 176
177
169
181
178
177
d(5,6) = 177 – 176 = 1
p(5,6) = 9

10. Proposed method-right shift
𝑡 𝑛 =2
𝑡 𝑟𝑚 = 2* 𝑡 𝑛 + 1
= 5
d(1,1) = -4 , < -2
𝑝 𝑟𝑚 ( 1, 1 ) = p( 1 , 1 ) = 151
d(1,7) = > 2 , d(1,7) < 𝑍 𝑟1
𝑝 𝑟𝑚 ( 1, 7 ) = – 0 = 154
d(5,6) = < 1 < 2
𝑝 𝑟𝑚 ( 5, 6 ) = = 180 10

11. Proposed method-left shift
𝑡 𝑛 =2
𝑡 𝑟𝑚 = 2* 𝑡 𝑛 + 1
= 5
𝑡 𝑙𝑚 = 2 ∗𝑡 𝑟𝑚
=10
𝒅 𝒍 ( i , j ) = 𝒑 𝒓𝒎 ( i , j ) - 𝒑 𝒑 ( i , j )
𝑑 𝑙 ( 1 , 1 ) = = -4 , -4 < -2
𝑍 𝑙1 ≤𝑑 𝑙 , 𝑝 𝑙𝑚 = 151 – = 141
𝑑 𝑙 (1,7) = > 7
𝑝 𝑙𝑚 ( 1, 7 ) = 𝑝 𝑟𝑚 ( 1, 7 ) = 154
𝑑 𝑙 (5,6) = < 4 < 7
𝑝 𝑙𝑚 ( 5, 6 ) = – 2 – 5 – 1 = 176 11

12. Proposed method 12 overflow and underflow: 𝑝 𝑙𝑚 (1,1) = 141
𝑝 𝑙𝑚 (1,7) = 154
𝑝 𝑙𝑚 (5,6) = 176
151
203
173
194
160
187
149
120
111
152
155
162
185
170
142
135
138
113
154
150
148
117
171
174
200
161
166
156
145
186
176
177
169
165
184
159
127
196
181
178
183
137
141
146
141
208
178
199
150
192
154
120
101
157
160
167
190
175
142
125
128
103
144
140
153
117
161
164
205
151
156
152
146
145
191
166
176
159
165
189
201
186
179
183
127
131
155
169
162 12

13. Proposed method 𝒅 𝒍 (5,6)=4 𝒑 𝒓𝒎 (𝟓,𝟔)=180 𝒃 𝒍 =1 13
overflow and underflow: 
𝑝 𝑙𝑚 (5,6)=176 , 𝑝 𝑝 (5,6)=176 , 𝒅 𝒎 (5,6)=0
- 𝑡 𝑛 − 𝑡 𝑙𝑚 ≤ 𝑑 𝑚 (5,6) ≤ 𝑡 𝑛 + 𝑡 𝑟𝑚
≤ ≤ 7
𝒅 𝒍 (5,6)=4
𝒑 𝒓𝒎 (𝟓,𝟔)=180
𝒃 𝒍 =1 13

14. Proposed method 𝒅 𝒍 (5,6)=4 d(5,6)=1 p(5,6)=177 𝒃 𝒓 =0 14
- 𝑡 𝑛 ≤ 𝑑 𝑚 (5,6) ≤ 𝑡 𝑛 + 𝑡 𝑟𝑚
-4 ≤ ≤ 7
d(5,6)=1
p(5,6)=177
𝒃 𝒓 =0 14

15. Experimental results
[5]IoanCatalin Dragoi, D. Coltuc,Local-prediction-based difference expansion reversible watermarking,IEEE Trans. Image Process., 23 (4) (2014), pp. 
[14]B. Xue, X. Li, J. Wang, Z. Guo,Improved reversible data hiding based on two-dimensional difference-histogram modification,Multimed. Tools Appl. (2016), pp. 1-19
[15]Aulia Arham, H.A. Nugroho, T.B. Adji,Multiple layer data hiding scheme based on difference expansion of quad ☆Signal Process., 137 (2017), pp. 52-62
[29]J. Wang, J. Ni, X. Zhang, Y.Q. Shi,Rate and distortion optimization for reversible data hiding using multiple histogram shifting,IEEE Trans. Cybern., 47 (2) (2017), p. 315
[35]X. Zhang, Z. Qian, G. Feng, Y. Ren,Efficient reversible data hiding in encrypted images,J. Vis. Commun. Image Represent., 25 (2) (2014), pp.  15

16. Experimental results 16

17. Conclusions Right left shift
The proposed method is simple and easy to implement.
The proposed scheme has high EC on different images 17

18. -END- 18