1 / 15

Prediction-Based Reversible Data Hiding

Prediction-Based Reversible Data Hiding. Source: Information Sciences, vol. 179, no. 14, pp. 2460-2469, 2009. Authors: Hsien-Wen Tseng and Chi-Pin Hsieh Speaker: Chia-Chun Wu ( 吳佳駿 ) Data: 2010/01/08. Outline. Introduction The Proposed Scheme Experimental Results Conclusions.

edan-odonnell
Download Presentation

Prediction-Based Reversible Data Hiding

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Prediction-Based Reversible Data Hiding Source: Information Sciences, vol. 179, no. 14, pp. 2460-2469, 2009. Authors: Hsien-Wen Tseng and Chi-Pin Hsieh Speaker: Chia-Chun Wu (吳佳駿) Data: 2010/01/08

  2. Outline • Introduction • The Proposed Scheme • Experimental Results • Conclusions

  3. Cover image Introduction • Reversible data hiding Interceptor Sender Secret data: 0101… Secret data: 0101… Public channel (Ex: Internet) Receiver Stego-image Cover image

  4. 31 24 36 33 The Proposed Scheme (1/5) • Embedding Algorithm • Side-match prediction Predicted value Prediction error Pixel value Stego pixel value

  5. Embedding secret bits Pixel shifting Extracting secretbits &recovery Pixel shifting The Proposed Scheme (2/5) • Embedding Algorithm • Predefined threshold T Case 3 Case 1 Case 2

  6. 31 24 36 33 The Proposed Scheme (3/5) • Example of embedding procedure (Case 1) d'=7 d=3 [5,6] [3,4] [7,255]

  7. 31 28 36 38 The Proposed Scheme (4/5) • Example of shifting procedure (Case 2) d=6 d'=4 [5,6] [3,4] [7,255]

  8. 31 24 36 38 The Proposed Scheme (5/5) • Example of shifting procedure (Case 3) d=8 d'=11 [5,6] [3,4] [7,255]

  9. Overflow and Underflow 0+1=1 7-1=6 K=1 7 1 100 100

  10. The Experimental Results (1/5) • Three test images

  11. The Experimental Results (2/5)

  12. The Experimental Results (3/5) Table 6. Experimental results of predictors.

  13. The Experimental Results (4/5) • T=2 Table 7. Comparisons between the proposed method and Yip et al.’s scheme. [17] S. K. Yip, O. C. Au, H. M. Wong, C. W. Ho, “Generalized lossless data hiding by multiple predictors,” ISCAS 2006, pp. 21-24, May 2006.

  14. The Experimental Results (5/5) • Compare the proposed scheme with that of Tian [14] and Celik [2] using grayscale image Lena • The propsoed scheme • T=2 • Capacity 0.220 bpp • PSNR 47.31dB • Tian’s scheme • Capacity 0.151 bpp • PSNR 44.20dB • Celik et al’s scheme • Capacity 0.180 bpp • PSNR 40.5dB

  15. Conclusions • A high capacity and low distortion reversible data hiding technique using prediction error expansion is proposed. • The correlation between the pixel and its neighboring pixels is considered to perform the difference expansion and the secret bit is embedded in difference.

More Related