Information Protection and Recovery with Reversible Data Hiding

1
Information Protection and Recovery
withReversible Data Hiding
Hsiang-Cheh Huang, Yu-Hsiu Huang, Jeng-Shyang
Pan, Yuh-Yih Lu National University of Kaohsiung,
Kaohsiung, Taiwan, R.O.C. Intelligent Information
Hiding and Multimedia Signal Processing, 2007.
IIHMSP 2007. Third International Conference on
Volume 2, 26-28 Nov. 2007 Page(s)461 - 464
Reporter Chien-Ting Kuo
2
Outline

• 1. Introduction
• 2. Preliminaries
• 3. Proposed Algorithm
• 4. Experimental Results
• 5. Conclusions

3
1. Introduction

• For reversible data hiding, both the hidden data
  and the original multimedia content can be
  extracted
• we employ the reversible data hiding techniques
  to hide the information to be mosaicked in
  advance.

4
2. Preliminaries

• Histogram-based reversible data hiding

Step 1 generating the histogram
5
2. Preliminaries

• Histogram-based reversible data hiding

1. Find Max point a min Point b
2. Increase 1 with M-n range value

Step 2 modifying selected range
6
2. Preliminaries

• Histogram-based reversible data hiding

If Embed 1 Keep the value (a1) If
Embed 0 (a1) ? a
Step 3 embedding hidden data
7
3. Proposed Algorithm

• 1. Locating the area containing confidential
  information
• The width Wm, the height Hm, and the coordinate
  of the upper left corner of this region,(x0,y0)
• 2. Generation of the hidden data
• Every pixel in the region obtained in Sec. 3.1 is
  represented by an 8-bit string. Concatenating the
  binary form of every pixel in this region

8
3. Proposed Algorithm

• 3. Mosaicking the region containing confidential
  
• information
• 4. Embedding the hidden data
• The generated data in Sec. 3.2 is embedded into
  the original image except for the region to be
  mosaicked

9
Proposed Example
230 200 215 215 215 215 210 210
230 200 215 200 200 215 210 210
230 200 200 210 200 200 200 210
230 200 215 3 7 200 200 210
200 200 230 15 1 200 200 210
200 200 200 215 215 200 215 215
200 230 200 200 200 200 230 230
230 230 230 200 215 215 230 230
By Step 1 Find Max Point a 200
Min Point b 230
10
Proposed Example
231 201 216 216 216 216 211 211
231 201 216 201 201 216 211 211
231 201 201 211 201 201 201 211
231 201 216 3 7 201 201 211
201 201 231 15 1 201 201 211
201 201 201 216 216 201 216 216
201 231 201 201 201 201 231 231
231 231 231 201 216 216 231 231
Step 2 All value between a-b Increase 1
11
Proposed Example
3,7 ,15,1 change to Binary string 00000011
00000111 00001111 00000001
231 201 216 216 216 216 211 211
231 201 216 201 201 216 211 211
231 201 201 211 201 201 201 211
231 201 216 3 7 201 201 211
201 201 231 15 1 201 201 211
201 201 201 216 216 201 216 216
201 231 201 201 201 201 231 231
231 231 231 201 216 216 231 231
And record Wm 2 , Hm 2 (Xo,Yo) (3,3)
combine to a security key 00000010 00000010
00000011 00000011
12
Proposed Example
Embedding Binary string 00000011 00000111
00001111 00000001
231 201 216 216 216 216 211 211
231 201 216 201 201 216 211 211
231 201 201 211 201 201 201 211
231 201 216 3 7 201 201 211
201 201 231 15 1 201 201 211
201 201 201 216 216 201 216 216
201 231 201 201 201 201 231 231
231 231 231 201 216 216 231 231
If embed value