Presentation is loading. Please wait.

Presentation is loading. Please wait.

An efficient reversible data hiding method for AMBTC compressed images

Similar presentations


Presentation on theme: "An efficient reversible data hiding method for AMBTC compressed images"— Presentation transcript:

1 An efficient reversible data hiding method for AMBTC compressed images
Sourse: Multimedia Tools and Applications, Volume 76, Issue 4, February 2017, pp 5441–5460 Authors: Wien Hong, Yuan-Bo Ma, Hung-Che Wu, Tung-Shou Chen Speaker: Wang Xu Date: /11/01

2 Outline Introduction Related work Proposed method Experiment results
Conclusions

3 Introduction(1/2) Type I
Secret data: ··· Compressed image Stego image Secret data: ··· Stego image Compressed image

4 Introduction(2/2) Type II
Secret data: ······ Stego codes: ······ Compressed image Stego codes: ······ Secret data: ······ Compressed image

5 Related work – AMBTC Higher quantization Original block Bitmap
value: 111 Original block Bitmap Compressed block 55 117 116 47 73 97 94 69 64 110 92 68 99 162 108 55 117 116 47 73 97 94 69 64 110 92 68 99 162 108 1 64 111 Block mean: 90 Lower quantization value: 64

6 Related work – Sun et al.’s method
Higher quantization value map H1,1 H1,2 H1,3 H1,4 H1,5 H1,j H2,1 H2,2 H2,3 H2,4 H2,5 H2,j H3,1 H3,2 H3,3 H3,4 H3,5 H3,j H4,1 H4,2 H4,3 H4,4 H4,5 H4,j H5,1 H5,2 H5,3 H5,4 H5,5 H5,j Hi,1 Hi,2 Hi,3 Hi,4 Hi,5 Hi,j Division information 𝐶 𝑖 𝐻 = 𝑠 𝑖,1 ′ 𝑠 𝑖,2 ′ || 𝑑 𝑖,1 𝑑 𝑖,2 || (𝑒 𝑖 𝐻 )2 Xor-ed secret bits Prediction error B1,1 B1,2 B1,3 B1,4 B1,5 B1,j B2,1 B2,2 B2,3 B2,4 B2,5 B2,j B3,1 B3,2 B3,3 B3,4 B3,5 B3,j B4,1 B4,2 B4,3 B4,4 B4,5 B4,j B5,1 B5,2 B5,3 B5,4 B5,5 B5,j Bi,1 Bi,2 Bi,3 Bi,4 Bi,5 Bi,j H1,1 H1,2 H1,3 H1,4 H1,5 H1,j H2,1 H2,2 H2,3 H2,4 H2,5 H2,j H3,1 H3,2 H3,3 H3,4 H3,5 H3,j H4,1 H4,2 H4,3 H4,4 H4,5 H4,j H5,1 H5,2 H5,3 H5,4 H5,5 H5,j Hi,1 Hi,2 Hi,3 Hi,4 Hi,5 Hi,j 𝐶 𝑖 𝐿 = 𝑠 𝑖,1 ′ 𝑠 𝑖,2 ′ || 𝑑 𝑖,1 𝑑 𝑖,2 || (𝑒 𝑖 𝐿 )2 Stego code 𝐶 𝑖 = 𝐵 𝑖 || 𝐶 𝑖 𝐻 || 𝐶 𝑖 𝐿 Bitmap Lower quantization value map Sun W, Lu ZM, Wen YC, Yu FX, Shen RJ (2013) High performance reversible data hiding for block truncation coding compressed images. SIViP 7(2):297–306

7 Related work – Sun et al.’s method - encoding
Higher mean map 𝑝 𝑖 𝐻 H1,1 H1,2 H1,3 H1,4 H1,5 H1,j H2,1 H2,2 H2,3 H2,4 H2,5 H2,j H3,1 H3,2 H3,3 H3,4 H3,5 H3,j H4,1 H4,2 H4,3 H4,4 H4,5 H4,j H5,1 H5,2 H5,3 H5,4 H5,5 H5,j Hi,1 Hi,2 Hi,3 Hi,4 Hi,5 Hi,j 𝑒 𝑖 𝐻 = 𝑞 𝑖 𝐻 − 𝑝 𝑖 𝐻 =176−189=−13 𝑑 𝑖,1 𝑑 𝑖,2 =102 192 191 189 177 176 192 191 189 177 176 m = 4 𝑞 𝑖 𝐻 (𝑒 𝑖 𝐻 )2=11012 Secret bits (01)2 (10)2 (11)2 (00)2 (01)2 (10)2 (11)2 (00)2 102 112 𝐶 𝑖 𝐻 = 𝑠 𝑖,1 ′ 𝑠 𝑖,2 ′ || 𝑑 𝑖,1 𝑑 𝑖,2 || (𝑒 𝑖 𝐻 )2= 012 Key-generated random bits

8 Related work – Sun et al.’s method - decoding
𝐶 𝑖 𝐻 = 𝑠 𝑖,1 ′ 𝑠 𝑖,2 ′ || 𝑑 𝑖,1 𝑑 𝑖,2 || (𝑒 𝑖 𝐻 )2= ····2 𝑑 𝑖,1 𝑑 𝑖,2 =102 Secret bits 112 Key-generated random bits 012 102 m = 4 𝑝 𝑖 𝐻 (𝑒 𝑖 𝐻 )2=−11012=−1310 (01)2 (10)2 (11)2 (00)2 (01)2 (10)2 (11)2 (00)2 192 191 189 177 𝑞 𝑖 𝐻 = 𝑒 𝑖 𝐻 + 𝑝 𝑖 𝐻 =189+ −13 =176

9 Related work – Median Edge Detection (MED) predictor
Hong W, Chen TS, Shiu CW (2009) Reversible data hiding for high quality images using modification of prediction errors. J Syst Software 82:1833–1842

10 Proposed method – Alternative Prediction (AP) technique
First: 𝑝 𝑖 𝐻 then: 𝑝 𝑖 𝐿 First: 𝑝 𝑖 𝐿 then: 𝑝 𝑖 𝐻

11 Proposed method – Centralized Error Division (CED) technique

12 Proposed method – encoding
𝑒 𝑖 𝐻 = 𝑞 𝑖 𝐻 − 𝑝 𝑖 𝐻 =176−176=0 192 191 176 𝑑 𝑖,1 𝑑 𝑖,2 =002 (𝑒 𝑖 𝐻 )2=empty 𝐶 𝑖 𝐻 = 𝑠 𝑖,1 ′ 𝑠 𝑖,2 ′ || 𝑑 𝑖,1 𝑑 𝑖,2 || (𝑒 𝑖 𝐻 )2 = 𝑝 𝑖 𝐻 =176 𝑝 𝑖 𝐻 =176 𝑞 𝑖 𝐻 102⊕012 =112 First: 𝑝 𝑖 𝐻 then: 𝑝 𝑖 𝐿 𝑠 𝑖,1 ′ 𝑠 𝑖,2 ′ Stego code 𝐶 𝑖 = 𝐵 𝑖 || 𝐶 𝑖 𝐻 || 𝐶 𝑖 𝐿 𝑠 𝑖,3 ′ 𝑠 𝑖,4 ′ 002⊕012 =012 75 182 70 172 𝐶 𝑖 𝐿 = 𝑠 𝑖,3 ′ 𝑠 𝑖,4 ′ || 𝑑 𝑖,3 𝑑 𝑖,4 || (𝑒 𝑖 𝐻 )2 = 𝑝 𝑖 𝐿 =177 𝑝 𝑖 𝐿 =176 𝑞 𝑖 𝐿 𝑒 𝑖 𝐿 = 𝑞 𝑖 𝐿 − 𝑝 𝑖 𝐿 =172−176=−4 𝑑 𝑖,3 𝑑 𝑖,4 =012 (𝑒 𝑖 𝐿 )2=01002 L

13 Proposed method – decoding
192 191 176 192 191 176 𝑑 𝑖,1 𝑑 𝑖,2 =002 𝐶 𝑖 𝐻 = 11 00···2 𝑝 𝑖 𝐻 =176 𝑝 𝑖 𝐻 =176 𝑞 𝑖 𝐻 = 𝑝 𝑖 𝐻 112⊕012 =102 𝑠 𝑖,1 𝑠 𝑖,2 012⊕012 =002 𝑠 𝑖,3 𝑠 𝑖,4 75 182 70 75 182 70 172 𝐶 𝑖 𝐿 = ···2 𝑝 𝑖 𝐿 =177 𝑝 𝑖 𝐿 =176 𝑑 𝑖,3 𝑑 𝑖,4 =012 𝑞 𝑖 𝐿 = 𝑝 𝑖 𝐿 − 𝑒 𝑖 𝐿 =176−01002=176−4=172 L

14 Experiment results(1/3)
Bit−rate= The codestream length pixels of image The bit-rate comparison for six test images

15 Experiment results(2/3)
Sun W, Lu ZM, Wen YC, Yu FX, Shen RJ (2013) High performance reversible data hiding for block truncation coding compressed images. SIViP 7(2):297–306

16 Experiment results(3/3)
Chen J, HongW, Chen TS, Shiu CW (2010) Steganography for BTC compressed images using no distortion technique. Imag Sci J 58(4):177–185 Zhang Y, Guo SZ, Lu ZM, Luo H (2013) Reversible data hiding for BTC-compressed images based on lossless coding of mean tables. IEICE Trans Commun E96.B(2):624–631 Sun W, Lu ZM, Wen YC, Yu FX, Shen RJ (2013) High performance reversible data hiding for block truncation coding compressed images. SIViP 7(2):297–306 12

17 Conclusions Proposed better prediction techniques(MED and AP) and more efficient error divisions(CED). Comparable embedding capacity Lower bit-rate Higher efficiency

18 Thanks


Download ppt "An efficient reversible data hiding method for AMBTC compressed images"

Similar presentations


Ads by Google