1 / 13

Reversible Data Hiding with Improved Histogram Alteration Method

Reversible Data Hiding with Improved Histogram Alteration Method. Source: International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP),2010 Sixth. Authors: Hsiang-Cheh Huang, Yueh-Hong Chen, and I-Hung Wang Speaker:Cheng Hsu Date:2011/05/05.

dean-jordan
Download Presentation

Reversible Data Hiding with Improved Histogram Alteration Method

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. Reversible Data Hiding with Improved Histogram Alteration Method Source:International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP),2010 Sixth. Authors:Hsiang-Cheh Huang, Yueh-Hong Chen, and I-Hung Wang Speaker:Cheng Hsu Date:2011/05/05

  2. Outline • Introduction • Related work • Proposed scheme • Experimental results • Conclusions

  3. 1. Introduction • Reversible data hiding: • Histogram-based scheme. • Difference expansion (DE) scheme. • They consider the easily implemented algorithm, called histogram-based scheme in reversible data hiding, and they modify the difference between adjacent pixels for making data hiding possible.

  4. 154 157 154 154 156 154 158 Peak point Zero point 153 156 157 153 155 152 156 154 152 155 154 Cover image Original image 8 7 0 6 152 153 154 155 156 157 158 5 4 3 2 1 2. Related work Embedding procedure shift Original histogram Cover image histogram

  5. 154 157 154 S = 1 1 0 155 157 154 158 153 156 P’= P + 1 158 153 156 152 156 154 P’= P 152 156 154 Cover image Stego image 8 If S=0 embedded in 154 7 0 If S=1 embedded in 155 152 6 153 154 155 156 157 158 5 4 3 2 1 155 154 Stego image histogram Cover image histogram

  6. 155 155 157 157 155 155 S = 1 1 0 S = 1 S = 1 S = 0 158 158 153 153 156 156 P = P’ - 1 P = P’ - 1 152 152 156 156 154 154 P = P’ Stego image Cover image 8 7 0 152 6 153 154 155 156 157 158 155 157 154 154 155 156 154 5 4 3 2 1 Extracted procedure Cover image histogram Original image

  7. 198 Difference： 199 200 202 200 201 204 203 Peak point 3 Zero point -2 -1 0 1 2 3 4 2 1 0 Original difference histogram 3. Proposed scheme Embedding procedure Original image

  8. If S = 1 If S = 0 198 199 d = 1 S = 1 0 202 200 d = 1 d’ = d d’ = d - 1 200 201 203 204 If S=0 embedded in 1 If S=1 embedded in 0 3 Inverse S-type scan -2 203 -1 204 0 1 2 3 4 2 200 201 1 202 200 0 198 198 Original difference histogram Stego image Original image 200

  9. 198 198 Inverse S-type scan d = d’ + 1 202 200 200 201 P = p’ + d = 198 + 1 = 199 203 204 S = 1 d =d’ S = 0 3 200 199 -2 -1 0 1 2 3 4 2 If d’ = 1 If d’ = 0 P = p’ + d = 200 + 0 = 200 1 Stego image difference histogram Extraction procedure Stego image Original image

  10. 4. Experimental results The image quality and the number of modified blocks under a fixed number of capacity.

  11. Comparisons between maximal capacity and that in [2].

  12. 5. Conclusions • In this paper, they proposed an improved reversible data hiding scheme by modifying the histogram of original image with its inherent characteristics. • In comparison with conventional scheme [2], more capacity with their scheme can be embedded.

  13. Thank You !

More Related