Presentation is loading. Please wait.

Presentation is loading. Please wait.

Multi-Tier and Multi-Bit Reversible Data Hiding with Contents Characteristics Source : Journal of Information Hiding and Multimedia Signal Processing, Volume.

Similar presentations


Presentation on theme: "Multi-Tier and Multi-Bit Reversible Data Hiding with Contents Characteristics Source : Journal of Information Hiding and Multimedia Signal Processing, Volume."— Presentation transcript:

1 Multi-Tier and Multi-Bit Reversible Data Hiding with Contents Characteristics
Source : Journal of Information Hiding and Multimedia Signal Processing, Volume 7, Jan 2016, Pages 11-20 Authors : Hsiang-Cheh Huang, Feng-Cheng Chang Speaker : Jyun-Yi Li Date : 2017/3/30 1

2 Outline Proposed scheme Experiment results Conclusion Preprocessing
Data embedding phase Data extracting phase Experiment results Conclusion 2

3 Proposed scheme (1/12) Preprocessing 𝑝 𝑖 3x3 block 𝑑 𝑖 60 68 64 70 66
63 𝑝 𝑖 60 64 63 70 68 66 3x3 block 𝑑 𝑖 60 -4 1 -1 -6 2 4 -2 3

4 Proposed scheme (2/12) Embedding Level(EL = 3) 𝑑 𝑖 𝑑 𝑖 ′ 60 -4 1 -1 -6
𝑑 𝑖 ′ = 𝑑 𝑖 , 𝑖𝑓 𝑖=1; 𝑑 𝑖 , 𝑖𝑓 𝑑 𝑖 =1 𝑜𝑟 0, 𝑖=2,3,…,𝑚x𝑛; 𝑑 𝑖 −1, 𝑖𝑓 𝑑 𝑖 ≤−1, 𝑖=2,3,…,𝑚x𝑛; 𝑑 𝑖 +1, 𝑖𝑓 𝑑 𝑖 >1, 𝑖=2,3,…,𝑚x𝑛; 𝑑 𝑖 60 -4 1 -1 -6 2 4 -2 𝑑 𝑖 ′ 60 -5 1 -2 -7 3 5 -3 4

5 Proposed scheme (3/12) Embedding Level(EL = 3) 𝑑 𝑖 ′ 𝑑 𝑖 ′′ 60 -5 1 -2
𝑑 𝑖 ′′ = 𝑑 𝑖 ′ , 𝑖𝑓 𝑖=1; 𝑑 𝑖 ′ , 𝑖𝑓 −𝐸𝐿≤ 𝑑 𝑖 ′ ≤𝐸𝐿, 𝑖=2,3,…,𝑚x𝑛; 𝑑 𝑖 ′ −𝐸𝐿−1, 𝑖𝑓 𝑑 𝑖 ′ <−𝐸𝐿, 𝑖=2,3,…,𝑚x𝑛; 𝑑 𝑖 ′ +𝐸𝐿, 𝑖𝑓 𝑑 𝑖 ′ >𝐸𝐿, 𝑖=2,3,…,𝑚x𝑛; 𝑑 𝑖 ′ 60 -5 1 -2 -7 3 5 -3 𝑑 𝑖 ′′ 60 -9 1 -2 -11 3 8 -3 5

6 Proposed scheme (4/12) Data embedding phase(EL = 3 single-bit) 𝑑 𝑖 ′′
𝑑 𝑖 ′′′ = 𝑑 𝑖 ′′ , 𝑖𝑓 𝑖=1; 𝑑 𝑖 ′′ , 𝑖𝑓 −𝐸𝐿< 𝑑 𝑖 ′′ <𝐸𝐿, 𝑖=2,3,…,𝑚x𝑛; −2∗𝐸𝐿− 𝑊 1 , 𝑖𝑓 𝑑 𝑖 ′′ =−𝐸𝐿, 𝐸𝐿≠0, 𝑖=2,3,…,𝑚x𝑛; 2∗𝐸𝐿+ 𝑊 1 −1, 𝑖𝑓 𝑑 𝑖 ′′ =𝐸𝐿, 𝐸𝐿≠0𝑜𝑟1, 𝑖=2,3,…,𝑚x𝑛; Secret data: 𝑑 𝑖 ′′ 60 -9 1 -2 -11 3 8 -3 1 𝑑 𝑖 ′′′ 60 -9 1 -2 -11 8 5 -7 6

7 Proposed scheme (5/12) EL = 2 (single-bit) 𝑑 𝑖 ′′ 𝑑 𝑖 ′′′
𝑑 𝑖 ′′′ = 𝑑 𝑖 ′′ , 𝑖𝑓 𝑖=1; 𝑑 𝑖 ′′ , 𝑖𝑓 −𝐸𝐿< 𝑑 𝑖 ′′ <𝐸𝐿, 𝑖=2,3,…,𝑚x𝑛; −2∗𝐸𝐿− 𝑊 1 , 𝑖𝑓 𝑑 𝑖 ′′ =−𝐸𝐿, 𝐸𝐿≠0, 𝑖=2,3,…,𝑚x𝑛; 2∗𝐸𝐿+ 𝑊 1 −1, 𝑖𝑓 𝑑 𝑖 ′′ =𝐸𝐿, 𝐸𝐿≠0𝑜𝑟1, 𝑖=2,3,…,𝑚x𝑛; Secret data: 𝑑 𝑖 ′′ 60 -9 1 -2 -11 5 8 -7 𝑑 𝑖 ′′′ 60 -9 1 -4 -11 5 8 -7 7

8 Proposed scheme (6/12) EL = 1 (double-bit) 𝑑 𝑖 ′′ 𝑑 𝑖 ′′′
𝑑 𝑖 ′′′ = 𝑑 𝑖 ′′ , 𝑖𝑓 𝑖=1; 𝑑 𝑖 ′′ , 𝑖𝑓 𝑑 𝑖 ′′ =𝐸𝐿, 𝐸𝐿>1𝑜𝑟𝐸𝐿<0, 𝑖=2,3,…,𝑚x𝑛; 4∗𝐸𝐿− 𝑊 2 , 𝑖𝑓 𝑑 𝑖 ′′ =𝐸𝐿, 𝐸𝐿=0𝑜𝑟1, 𝑖=2,3,…,𝑚x𝑛; Secret data: 𝑑 𝑖 ′′ 60 -9 1 -4 -11 5 8 -7 01 𝑑 𝑖 ′′′ 60 -9 3 -4 -11 5 8 -7 8

9 Proposed scheme (7/12) EL = 0 (double-bit) 𝑑 𝑖 ′′ 𝑑 𝑖 ′′′
𝑑 𝑖 ′′′ = 𝑑 𝑖 ′′ , 𝑖𝑓 𝑖=1; 𝑑 𝑖 ′′ , 𝑖𝑓 𝑑 𝑖 ′′ =𝐸𝐿, 𝐸𝐿>1𝑜𝑟𝐸𝐿<0, 𝑖=2,3,…,𝑚x𝑛; 4∗𝐸𝐿− 𝑊 2 , 𝑖𝑓 𝑑 𝑖 ′′ =𝐸𝐿, 𝐸𝐿=0𝑜𝑟1, 𝑖=2,3,…,𝑚x𝑛; Secret data: 𝑑 𝑖 ′′ 60 -9 3 -4 -11 5 8 -7 11 𝑑 𝑖 ′′′ 60 -9 3 -4 -11 5 8 -7 -3 9

10 Proposed scheme (8/12) Rearrange 𝑝 𝑖 𝑑 𝑖 ′′′ 𝑝 𝑖 ′ 60 64 63 70 68 66
𝑑 𝑖 ′′′ 60 -9 3 -4 -11 5 8 -7 -3 𝑝 𝑖 ′ 60 69 61 67 75 65 71 60 65 69 75 71 61 67 10

11 Proposed scheme (9/12) Data extracting phase Non embedded 𝐸𝐿 𝑝 𝑖 ′
𝑑 𝑖 = 𝑑 𝑖 ′′′ −𝐸𝐿−1, 𝑖𝑓 𝑑 𝑖 ′′′ >2∗𝐸𝐿; 𝑑 𝑖 ′′′ +𝐸𝐿+2, 𝑖𝑓 𝑑 𝑖 ′′′ <−2∗𝐸𝐿−1; 𝑟−1, 𝑖𝑓 𝑑 𝑖 ′′′ =2𝑟−1𝑜𝑟2𝑟, 𝑟=3,4…,𝐸𝐿; −𝑟+1, 𝑖𝑓 𝑑 𝑖 ′′′ =−2𝑟−1𝑜𝑟−2𝑟, 𝑟=2,3,…,𝐸𝐿; 60 65 69 75 71 61 67 𝐸𝐿 x 3 1 2 𝑝 𝑖 ′ 60 69 61 67 75 65 71 𝑑 𝑖 ′′′ 60 -9 𝑑 𝑖 60 -4 𝑝 𝑖 60 64 11

12 Proposed scheme (10/12) Double-bit embedded(EL < 2) 𝐸𝐿 𝑝 𝑖 ′
𝑑 𝑖 = 𝑑 𝑖 ′′′ 𝑊 2 ′ = 𝑑 𝑖 ′′′ −4∗ 𝑑 𝑖 𝐸𝐿 x 3 1 2 𝑝 𝑖 ′ 60 69 61 67 75 65 71 𝑑 𝑖 ′′′ 60 -9 3 𝑑 𝑖 60 -4 1 𝑝 𝑖 60 64 63 𝑊 2 ′ = 3−4∗1 =1= (01) 2 12

13 Proposed scheme (11/12) Single-bit embedded(EL ≥ 2) 𝐸𝐿 𝑝 𝑖 ′ 𝑑 𝑖 ′′′
𝑑 𝑖 = 𝑑 𝑖 ′′′ −𝐸𝐿−1, 𝑖𝑓 𝑑 𝑖 ′′′ >2∗𝐸𝐿; 𝑑 𝑖 ′′′ +𝐸𝐿+2, 𝑖𝑓 𝑑 𝑖 ′′′ <−2∗𝐸𝐿−1; 𝑟−1, 𝑖𝑓 𝑑 𝑖 ′′′ =2𝑟−1𝑜𝑟2𝑟, 𝑟=3,4…,𝐸𝐿; −𝑟+1, 𝑖𝑓 𝑑 𝑖 ′′′ =−2𝑟−1𝑜𝑟−2𝑟, 𝑟=2,3,…,𝐸𝐿; 𝑊 1 ′ = 0, 𝑖𝑓 𝑑 𝑖 ′′′ = 2∗𝐸𝐿+1 𝑜𝑟(−2∗𝐸𝐿) 1, 𝑖𝑓 𝑑 𝑖 ′′′ = 2∗𝐸𝐿 𝑜𝑟(−2∗𝐸𝐿−1) 𝐸𝐿 x 3 1 2 𝑝 𝑖 ′ 60 69 61 67 75 65 71 𝑑 𝑖 ′′′ 60 -9 3 -4 𝑑 𝑖 60 -4 1 -1 𝑝 𝑖 60 64 63 64 𝑊 2 ′ = (01) 2 𝑊 1 ′ =0 13

14 Proposed scheme (12/12) Final result 𝐸𝐿 𝑝 𝑖 ′ 𝑑 𝑖 ′′′ -9 3 -4 𝑑 𝑖 -4 1
x 3 1 2 𝑝 𝑖 ′ 60 69 61 67 75 65 71 𝑑 𝑖 ′′′ 60 -11 5 8 -7 -3 -9 3 -4 60 68 64 70 66 63 𝑑 𝑖 60 -6 2 4 -2 -4 1 -1 𝑝 𝑖 60 70 68 64 66 64 63 64 𝑊 2 ′ = (01) 2 𝑊 2 ′ = (11) 2 𝑊 1 ′ =0 𝑊 1 ′ =0 𝑊 1 ′ =1 Secret data: 14

15 Comparison with other schemes
Experiment results Comparison with other schemes Image Our Scheme Related Scheme Capacity (bpp) PSNR (dB) Barbara 0.800 31.25 0.662 31.05 F16 1.266 28.30 0.974 29.57 Gold hill 0.770 32.57 0.749 31.72 Jet 1.333 34.40 0.963 37.68 Lena 1.135 31.68 0.916 31.58 Tank 0.805 32.71 0.789 30.96 [13] Z. Zhao, H. Luo, Z. M. Lu, and J. S. Pan, \Reversible data hiding based on multilevel histogram modification and sequential recovery," AEU | Int'l J. Electron. Commun., vol. 65, pp , Oct 15

16 Conclusion Our scheme focuses on the characteristics of original image, and proposes multi-tier and multi-bit reversible data hiding algorithm with the capability for embedding high capacity. 16


Download ppt "Multi-Tier and Multi-Bit Reversible Data Hiding with Contents Characteristics Source : Journal of Information Hiding and Multimedia Signal Processing, Volume."

Similar presentations


Ads by Google