Data hiding method using image interpolation Source:Computer Standards & Interfaces 31 (2009) 465–470 Authors:Ki-Hyun Jung & Kee-Young Yoo Speaker:Jiun-Lwen Liang Date:2012/05/22

Outline Introduction Interpolation method Proposed scheme Experimental results Conclusions

Introduction This paper introduces a traditional scaling-up method and a new interpolation method is proposed; one that focuses on high speed and low complexity.

Interpolation method -Bilinear Interpolation 46 A 112 B C 210 90 46 79 112 128 115 101 210 150 90 46 112 210 90 A=(46+112)/2 B=(46+210)/2 C=(46+112+210+90)/4

Interpolation method -Nearest neighbor interpolation

Proposed scheme

Proposed scheme - neighbor mean interpolation

Proposed scheme - Embedding procedure 46 79 112 128 84 101 210 150 90 46 112 210 90 interpolation

Proposed scheme - Embedding procedure 46 79 112 128 84 101 210 150 90 46 98 112 150 89 101 210 90 46 79 112 128 84 101 210 150 90 Embed secret bit Cover image Stego image

Proposed scheme - Extraction and recovery procedure 46 98 112 150 89 101 210 90 46 79 112 128 84 101 210 150 90 Recover Stego image Cover image Extract

Experimental results A comparison of PSNR values for the three interpolation methods

Experimental results A comparison of other reversible methods on pure payload and PSNR

Experimental results A comparison of other irreversible methods on capacity

Conclusions The scheme neighbor mean interpolation method had a low- time complexity and high-calculation speed. This scheme have more capacity than other methods.

Thanks for your attention