SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Adjustable prediction-based reversible data hiding

orpah avatar
orpah
41 diapositives · 588 Views · Aug 04, 2014

Adjustable prediction-based reversible data hiding. Outline. Introduction Related work Tseng and Hsiehs ’ scheme The proposed scheme Embedding phase Extraction and recovery phase Experimental results Conclusions. Introduction.

#adjustable prediction-based reversible data hiding #adjustable prediction-based reversible data hiding ppt #powerpoint #presentation
Adjustable prediction-based reversible data hiding - slide 1
01 / 41Adjustable prediction-based reversible data hiding
1 / 17

Télécharger la présentation

Adjustable prediction-based reversible data hiding
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Adjustable prediction-based reversible data hiding

  2. Outline • Introduction • Related work • Tseng and Hsiehs’ scheme • The proposed scheme • Embedding phase • Extraction and recovery phase • Experimental results • Conclusions

  3. Introduction • Data hiding is referred to as a process to hide some information data into cover media. • The data hiding schemes can be generally classified into two categories: - Irreversible data hiding - Reversible data hiding • Reversible data hiding schemes can be classified into two categories: - Difference expansion scheme (DE-based) - Histogram-based

  4. Introduction Secret message Embedding Extraction Cover image Stego-image Secret message Reversible data hiding

  5. Related work – Tseng and Hsiehs’ scheme (1/10) • Pre-processing: Overhead [27] H.W. Tseng, C.P. Hsieh, Prediction-based reversible data hiding, Information Sciences 179 (2009) 2460–2469

  6. Related work – Tseng and Hsiehs’ scheme (2/10) • Pixel value prediction: T=2 ------------------------------------------------------------------------- Embed Cover image

  7. Related work – Tseng and Hsiehs’ scheme (3/10) • Embedding - Case 1 : T=2 -------------------------------------------------------------------------- W=0 Cover image W=1

  8. Related work – Tseng and Hsiehs’ scheme (4/10) • Embedding - Case 2 : T=2 -------------------------------------------------------------------------- Cover image

  9. Related work – Tseng and Hsiehs’ scheme (5/10) • Embedding - Case 3 : T=2 -------------------------------------------------------------------------- Cover image

  10. Related work – Tseng and Hsiehs’ scheme (6/10) • Extracting: T=2 --------------------------------------------------------------------- Watermarked image

  11. Related work – Tseng and Hsiehs’ scheme (7/10) • Extracting - Case 1 : T=2 -------------------------------------------------------------------------- Watermarked image

  12. Related work – Tseng and Hsiehs’ scheme (8/10) • Extracting - Case 2 : T=2 -------------------------------------------------------------------------- Watermarked image

  13. Related work – Tseng and Hsiehs’ scheme (9/10) • Extracting - Case 3 : T=2 -------------------------------------------------------------------------- Watermarked image

  14. Related work – Tseng and Hsiehs’ scheme (10/10) • Post-processing : T=2 Watermarked image Cover image Overhead

  15. The proposed scheme(1/11) • Related work v.s Proposed scheme : -------------------------------------------------------------- Tseng and Hsieh’s scheme Proposed scheme Prediction value (P) = (102 + 99)/2 = 100

  16. The proposed scheme(2/11) • Pre-processing: Cover image Cover image

  17. The proposed scheme(3/11) • Embedding phase: • Rule 1: d ≦ T -------------------------------------------------------------------------- Cover image T=0 S=1

  18. The proposed scheme(4/11) • Embedding phase: • Rule 2: d > T -------------------------------------------------------------------------- Cover image T=0 S=1

  19. The proposed scheme(5/11) • Embedding phase: • Rule 2: d > T -------------------------------------------------------------------------- Cover image T=0 S=1

  20. The proposed scheme(6/11) • Embedding phase: • Rule 2: d > T -------------------------------------------------------------------------- 0 Cover image T=0 S=1

  21. The proposed scheme(7/11) • Extraction and recovery phase: • Rule 2: d’ > 2 x T + 1 -------------------------------------------------------------------------- Stego-image T=0

  22. The proposed scheme(8/11) • Extraction and recovery phase : • Rule 2: d’ > 2 x T + 1 -------------------------------------------------------------------------- Stego-image T=0

  23. The proposed scheme(9/11) • Extraction and recovery phase : • Rule 2: d’ > 2 x T + 1 -------------------------------------------------------------------------- Stego-image T=0

  24. The proposed scheme(10/11) • Extraction and recovery phase : • Rule 1: d’≦ 2 x T + 1 -------------------------------------------------------------------------- Stego-image T=0

  25. The proposed scheme(11/11) • Post-processing: Stego-image Cover image

  26. Experimental results (1/14) Amount of overhead information associated with different thresholds

  27. Experimental results (2/14) Embedding rate Embedding rate versus image quality of all tested images with various thresholds.

  28. Experimental results (3/14) Image quality Embedding rate versus image quality of all tested images with various thresholds.

  29. Experimental results (4/14) Histograms of prediction-errors for test images “Lena” and “Baboon” obtained using Tseng and Hsieh’s scheme (T = 5).

  30. Experimental results (5/14) Histograms of prediction-errors for test images “Lena” and “Baboon” obtained using the proposed scheme (T = 5).

  31. Experimental results (6/14) 48.6 dB and 0.2 bpp 37.15 dB and 0.99 bpp 47.9 dB and 0.06 bpp 30.78 dB and 0.71 bpp

  32. Experimental results (7/14) • Comparisons of embedding rates (bpp) of proposed scheme and that of Tseng and Hsieh.

  33. Experimental results (8/14) • Comparisons of image quality (dB) of Tseng and Hsieh’s and the proposed schemes with the same embedding capacity.

  34. Experimental results (9/14) Comparisons of embedding rates (bpp) of proposed scheme and that of Tseng and Hsieh at difference thresholds.

  35. Experimental results (10/14) Comparisons of image quality (dB) of Tseng and Hsieh’s and the proposed schemes with the same embedding capacity.

  36. Experimental results (11/14) • Capacity versus distortion performance of proposed and other schemes for test images: (a) Lena MR_liver_t1 MR_ped_chest MR_sag_head

  37. Experimental results (12/14) • Capacity versus distortion performance of proposed and other schemes for test images: (b) F16

  38. Experimental results (13/14) • Capacity versus distortion performance of proposed and other schemes for test images: (c) Baboon

  39. Experimental results (14/14) • Capacity versus distortion performance of proposed and other schemes for test images: (d) Boats

  40. Conclusions • Flexibility and scalability. • - A lower threshold yields a higher visual stego-image quality. • - A higher threshold yields a higher embedding rate. • To solve underflow and overflow. • To Increase the embedding rate and reduce image distortion.

  41. Thanks for your attention!