An efficient multiplebit reversible data hiding scheme without

An efficient multiple-bit reversible data hiding scheme without shifting Source: Multimedia Tools and Applications(2019), pp 1– 25 Authors: Weiqing Wang Speaker: Chi Hengxiao Date: 2019/12/05

Outline • Introduction • Proposed method • Experiment results • Conclusions

Introduction 227 227 86 76 77 1 10 0 1 227 226 76 76 75 1 226 0 0 76 -1 227 227 76 76 74 1 1 1 0 0 -2 226 235 225 67 71 66 0 9 -1 0 4 -1 219 226 57 67 65 -7 226 0 -10 67 -2 218 215 67 67 66 -8 -8 -11 0 0 -1

Proposed method(1/5)--embedding 173 179 185 189 192 183 12 7 -9 180 174 176 185 189 186 180 -4 13 -9 186 179 172 177 189 191 -14 5 4 178 179 178 175 169 175 190 0 -9 21 169 171 177 181 173 171 176 8 -4 3 175 183 170 172 177 183 175 -5 7 -2 174 176 175 173 175 179 178 1 0 3 178 177 180 181 179 166 176 2 -1 -3 →EP: embeddable pixel → NEP: non-embeddable pixel

Proposed method(2/5)--embedding. Secret data: 101 Q(i, 2 j)=100 F(i, 2 j)=10 173 179 185 189 192 183 180 174 176 185 189 186 180 186 179 172 177 189 191 178 179 178 175 169 175 190 169 171 177 181 173 171 176 175 183 170 172 177 183 175 174 176 175 173 175 179 178 177 180 181 179 166 176 1 0 1 185 189 192 EMAX(i, 2 j)=192 EMIN(i, 2 j)=185 OS(i, 2 j)=4 F(i, 2 j)=10 1 1 0 0 1 0 Q(i, 2 j)=-3=(100)2 185 178 192

Proposed method(3/5)--embedding 如 189 所 示 Q(i, 2 j)=100 Secret data: 101 F(i, 2 j)=11 177 181 173 EMAX(i, 2 j)=177 EMIN(i, 2 j)=173 OS(i, 2 j)=4<T=7 F(i, 2 j)=11 Q(i, 2 j)=4=(100)2 1 0 1 1 0 0 1 1 177 179 173 OR 175 183 170 Q 1(i, 2 j)=001 EMAX(i, 2 j)=175 EMIN(i, 2 j)=170 OS(i, 2 j)=8≥T=7 F(i, 2 j)=11 Q(i, 2 j)=T=(111)2 Q 1(i, 2 j)=OS-T=(001)2 Q(i, 2 j)=111 F(i, 2 j)=11 0 0 1 1 1 175 63 170

Proposed method(4/5)--embedding 如 189 所 示 Q(i, 2 j)=0011 Secret data: 10 F(i, 2 j)=00 179 166 176 EMAX(i, 2 j)=179 1 0 0 0 1 1 0 0 EMIN(i, 2 j)=176 OS(i, 2 j)=10 179 140 176 F(i, 2 j)=00 Q (i, 2 j)=OS-T=(0011)2 n+1位

Proposed method(5/5)--extraction 185 178 192 1 0 1 1 0 0 1 0 F(i, 2 j)=10 Secret data: 101 Q(i, 2 j)=100=4 原=EMIN+Q=189 185 EMAX(i, 2 j)=192 EMIN(i, 2 j)=185 177 179 173 1 0 1 1 0 0 1 1 F(i, 2 j)=11 EMAX(i, 2 j)=177 EMIN(i, 2 j)=173 175 63 170 0 0 1 1 1 EMAX(i, 2 j)=175 EMIN(i, 2 j)=170 179 140 176 EMAX(i, 2 j)=179 EMIN(i, 2 j)=176 1 0 0 0 1 1 0 0 F(i, 2 j)=11 Q(i, 2 j)=100=4<T Secret data: 101 189 原=EMAX+Q=181 177 181 173 Q(i, 2 j)=111=7=T OS(i, 2 j)=Q 1+Q=1+7=8 Q 1(i, 2 j)=001 F(i, 2 j)=00 Q(i, 2 j)=0011=3 Secret data: 10 192 OS(i, 2 j)=T+Q=7+3=10 原=EMAX+OS=183 175 183 170 原=EMIN-OS=166 179 166 176

Experiment results(1/2) [13] Jafar IF et al (2016) An efficient reversible data hiding algorithm using two steganographic images. Signal Process 128: 98– 109 [21] Pan Z et al (2015) Reversible data hiding based on local histogram shifting with multilayer embedding. J Vis Commun Image Represent 31(C): 64– 74 [1] Arham A, Nugroho HA, Adji TB (2017) Multiple layer data hiding scheme based on difference expansion of quad. Signal Process 137: 52– 62 [30] Wang J et al (2017) Rate and Distortion Optimization for Reversible Data Hiding Using. Multiple Histogram Shifting. IEEE Transactions on Cybernetics 47(2): 315– 326 [7] Chen H et al (2016) Reversible data hiding with contrast enhancement using adaptive histogram shifting and pixel value ordering. Signal Process Image Commun 46: 1– 16

Experiment results(2/2)

Conclusions • In this paper, an efficient multiple-bit embedding method is proposed for shifting-free reversible data hiding. By developing the relationship among the three neighbors, multiple-bit messages directly embedded in an EP with a close relationship with left and right neighbors, without shifting any NEP. • It avoids the difference histogram calculation and multiple layer data hiding to significantly simplify the data-hiding process. Meanwhile, it significantly improved the quality of stego image since it does not shift any NEP. Extensive simulations are carried out, which demonstrates the superior performance of the proposed scheme.