Presentation is loading. Please wait.

Presentation is loading. Please wait.

Reversible Data Hiding Based on Two- Dimensional Prediction Errors 1 Source : IET Image Processing, Vol. 7, No. 9, pp. 805-816, 2013 Authors : Shyh-Yih.

Similar presentations


Presentation on theme: "Reversible Data Hiding Based on Two- Dimensional Prediction Errors 1 Source : IET Image Processing, Vol. 7, No. 9, pp. 805-816, 2013 Authors : Shyh-Yih."— Presentation transcript:

1 Reversible Data Hiding Based on Two- Dimensional Prediction Errors 1 Source : IET Image Processing, Vol. 7, No. 9, pp , 2013 Authors : Shyh-Yih Wang, Chun-Yi Li and Wen-Chung Kuo Speaker : Min-Hao Wu Date : 2014/03/17

2 Outline  Related work – Yang et al.’s scheme  Proposed scheme  Experimental results  Conclusions 2

3 3 Yang’s Proposed scheme (1/6)

4 4 Yang’s Proposed scheme Proposed scheme (2/6) P1P1 P2P2 Z2Z2 Z1Z1 Embedding Process of odd columns H

5 5 Yang’s Proposed scheme Proposed scheme(3/6) Rule: Embed bit 0, keep unchanged Embed bit 1, P 2 -1 or P 1 +1, respectively B 1 = Embedding Process of odd columns D’

6 6 Yang’s Proposed scheme Proposed scheme(6/6)

7 Embedding process  Step 1:  scan the cover image and apply the two prediction methods to predict the pixel values in the image.  For each scanned pixel, let (e1, e2) denote the prediction errors. 7

8 Embedding process  Step 2:  generate the 2D histogram, H(e1, e2).  Step 3:  split the e1 − e2 plane into channels and partition the histogram H(e1, e2) correspondingly.  Step 4:  select ‘embedding channels (ECs)’, which are the channels for embedding messages.  Step 5:  for each EC, use a 1D embedding technique to embed the message. 8

9 Proposed scheme(chessboard, C-2D) 9 Cover image X Prediction error e 1 Prediction error e 2 (2,2) For example : x 1 ’ (2, 2) = ( )/4 = 150 x 2 ’ (2, 2) = ( )/2 = 150

10 Proposed scheme(chessboard, C-2D) 10 Result after histogram H(e 1, e 2 ) Result after shifting channel 0 prpr plpl e’ 1 e’ 2 e1e1 e2e2 Result after shifting Cover image X c = 0

11 Proposed scheme(chessboard, C-2D) 11 p r = (0, 0) p l = (-2, -2) Secret bit : (2) e’ 1 e’ 2 Result after shiftingStego image Y e” 1 e” 2

12 Proposed scheme(chessboard, C-2D) 12 Stego image Y p r = (0, 0) p l = (-2, -2) Secret bit : (2) e” 1 Cover image X

13 Proposed scheme(framework) 13 (e 1, e 2 ) : denote the two prediction errors for a pixel c ∈ [−c b, c b ] Part of a practical histogram H(e 1, e 2 ) generated from Lena Channel 0

14 14

15 15

16 16

17 17

18 Experimental results 18

19 Conclusions  This scheme can be used to design 2D reversible data- hiding schemes is presented.  This framework can be applied to any architecture, and it can easily be extended into a multi-dimensional framework. 19


Download ppt "Reversible Data Hiding Based on Two- Dimensional Prediction Errors 1 Source : IET Image Processing, Vol. 7, No. 9, pp. 805-816, 2013 Authors : Shyh-Yih."

Similar presentations


Ads by Google