1. Data hiding method using image interpolation
Source: Computer Standards & Interfaces, Vol. 31,
Issue 2, Feb. 2009, pp
Author: Ki-Hyun Jung and Kee-Young Yoo
Speaker: Hong-Hang Chang
Date: 2010/ 07/ 13
2019/5/5

2. Outline Introduction Related Works Proposed Method Experiment Results
Conclusions
2019/5/5

3. Introduction Interpolation (Scaling- up) Scaling- Down Original Image
Cover Image
Input Image
Embedding
Secret Data
Cover Image
&
Extracting
Secret Data
Stego- Image
2019/5/5

4. Related Works The nearest neighbor method 72 45 83 94 78 45 45 ?
Interpolation
122 ? 72 45 83 94
122 37
2019/5/5

5. Related Works (Cont.) Bilinear interpolation 78 55 ? 45 60 ? 122 ? 6537
2019/5/5

6. Proposed Method Neighbor Mean Interpolation (NMI) Original Image46 25 82 53
Original
Image
Neighbor Mean Interpolation (NMI) 46 25 82 53
Scaling- Up
512
256
256
512
(46+25)/2
Original Image
Scaling- Down
Input Image
(46+82)/2
Interpolation
512 46 25 82 53
256 46 35 25 46 57 25 43 91 75 82 64 53 64 48 82 53
512
( )/3
2019/5/5
Original Image
Input Image
Cover Image

7. Proposed Method (Cont.)
Embedding
difference 46 25 82 53 35 64 48
Cover Image
Embedding Path 46 25 82 53 38 70 49
Stego-Image
Secret Bits …
Per 4 pixel, embedding
3 secret streams
2019/5/5

8. Proposed Method (Cont.)
Extracting 46 25 82 53 38 70 49
Stego-Image
Reconstructing 46 25 82 53 35 64 48
Cover Image
2019/5/5

9. Experiment Result
2019/5/5

10. Conclusions
The proposed scaling- up neighbor mean interpolation method
has a low-time complexity and high- calculating speed.
The proposed method can embed a large amount of secret data while
keeping a very high visual quality.
2019/5/5