An efficient reversible data hiding algorithm using two steganographic images Source : Signal Processing, vol. 126, pp. 98-109, November 2016 Authors : lyad F.Jafar , Khalid A.Darabkh , Read T.AI-Zubi and Ramzi R.Saifan Speaker : Chia-Shuo Shih Date : 2018/03/22 1
Outline Related work Proposed method Experimental results Conclusions 2
Related work-Histogram Shifting 2 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. 354-362 3
Related work-Histogram Shifting 2 3 5 6 1 4
Related work-Histogram Shifting 2 3 5 6 1 2 3 5 6 4 1 s = 010111001 5
Proposed method 6
Proposed method-First Phase 44 43 45 46 47 48 CI1(m,n) 44 43 45 46 47 48 7 CI2(m,n)
Proposed method-First Phase CI1(m,n) CI2(m,n) Bit pair to embed TI1(m,n) TI2(m,n) (00)2 CI1(m,n)+2 CI2(m,n)+0 (01)2 CI1(m,n)+0 CI2(m,n)+1 (10)2 (11)2 CI1(m,n)−1 8
Proposed method-First Phase Bit pair to embed TI1(m,n) TI2(m,n) (00)2 CI1(m,n)+2 CI2(m,n)+0 (01)2 CI1(m,n)+0 CI2(m,n)+1 (10)2 (11)2 CI1(m,n)−1 44 43 45 46 47 48 46 43 45 44 47 48 49 Secret Bit:00100111 CI1(m,n) TI1(m,n) 44 43 45 46 47 48 44 43 46 45 48 49 47 Secret Bit:00100111001011100000011011100100 9 CI2(m,n) TI2(m,n)
1. 2. 3. Proposed method-Second Phase PE1(m,n) = TI1(m,n) − TI2(m,n) SI1(m,n)=TI2(m,n)+MPE1(m,n) 10
Proposed method-Second Phase PE1(m,n) = TI1(m,n) − TI2(m,n) 46 43 45 44 47 48 49 44 43 46 45 48 49 47 2 -1 -2 TI1(m,n) TI2(m,n) PE1(m,n) 11
Proposed method-Second Phase 2 -1 -2 1 -1 -2 2 Secret Bit:10110 PE1(m,n) MPE1(m,n) 12
Proposed method-Second Phase SI1(m,n)=TI2(m,n)+MPE1(m,n) 44 43 46 45 48 49 47 1 -1 -2 2 45 43 46 44 47 48 49 TI2(m,n) MPE1(m,n) SI1(m,n) 13
1. 2. 3. Proposed method-Third Phase PE2(m,n)=TI2(m,n)−SI1(m,n) SI2(m,n)=SI1(m,n)+MPE2(m,n) 14
Proposed method-Third Phase PE2(m,n)=TI2(m,n)−SI1(m,n) 44 43 46 45 48 49 47 45 43 46 44 47 48 49 -1 1 -2 2 TI2(m,n) SI1(m,n) PE2(m,n) 15
Proposed method-Third Phase -1 1 -2 2 -2 1 -1 -3 2 Secret Bit:0110011 PE2(m,n) MPE2(m,n) 16
Proposed method-Third Phase SI2(m,n)=SI1(m,n)+MPE2(m,n) 45 43 46 44 47 48 49 -2 1 -1 -3 2 43 46 42 44 48 45 47 49 SI1(m,n) MPE2(m,n) SI2(m,n) 17
Proposed method-Third Phase 43 46 42 44 48 45 47 49 45 43 46 44 47 48 49 SI1(m,n) SI2(m,n) 18
Proposed method-extraction procedure MPE2(m,n)=SI2(m,n)−SI1(m,n) 43 46 42 44 48 45 47 49 45 43 46 44 47 48 49 -2 1 -1 -3 2 SI1(m,n) SI2(m,n) MPE2(m,n) 19
Proposed method-extraction procedure -2 1 -1 -3 2 -1 1 -2 2 Secret Bit:0110011 MPE2(m,n) PE2(m,n) 20
Proposed method-extraction procedure TI2(m,n)=SI1(m,n)+PE2(m,n) -1 1 -2 2 45 43 46 44 47 48 49 44 43 46 45 48 49 47 SI1(m,n) PE2(m,n) TI2(m,n) 21
Proposed method-extraction procedure MPE1(m,n)=SI1(m,n)−TI2(m,n) 45 43 46 44 47 48 49 44 43 46 45 48 49 47 1 -1 2 -2 SI1(m,n) MPE1(m,n) TI2(m,n) 22
Proposed method-extraction procedure 1 -1 2 -2 2 -1 -2 Secret Bit:10110 MPE1(m,n) PE1(m,n) 23
Proposed method-extraction procedure TI1(m,n)=TI2(m,n)+PE1(m,n) 44 43 46 45 48 49 47 2 -1 -2 47 43 45 46 44 48 PE1(m,n) TI2(m,n) TI1(m,n) 24
Proposed method-extraction procedure 47 43 45 46 44 48 44 43 46 45 48 49 47 TI1(m,n) TI2(m,n) 25
Experimental results 26 Lena Mandrill Pepper Barbara Boat Goldhill Zelda Washsat Chang et al. [26] PSNR1 39.89 39.91 39.94 39.9 39.88 PSNR2 Capacity 802,895 802,524 799,684 802,888 802,716 802,698 802,789 802,535 Qin et al. [27] 52.11 52.04 51.25 52.12 51.72 52.06 41.58 41.56 41.52 41.57 41.75 557,052 557,096 557,245 557,339 557,194 557,264 557,129 Lu et al. [28] 49.13 47.95 49.11 49.14 49.00 49.17 49.12 49.15 49.08 49.07 49.09 524,288 522,996 524,192 524,208 524,276 Proposed 48.70 48.71 48.72 48.73 650,369 650,799 627,637 650,781 651,093 650,726 650,054 650,481 26
Experimental results 27
Experimental results 28
Experimental results Algorithm Embedding Extraction Total Chang et al. [26] 2.16 3.67 5.83 Qin et al. [27] 1.03 0.43 1.46 Lu et al. [28] 1.65 0.47 2.12 Proposed 0.46 0.17 0.63 29
Conclusions PSNR Capacity Run Time 30
-END- 31