reversible date hiding based on histogram modification of pixel differences ieee transactions on...
TRANSCRIPT
Reversible Date Hiding Based on Histogram Modification of pixel Differences
IEEE Transactions on circuits and systems for video technology, VOL. 19, NO. 6,JUNE 2009
Wei-Liang Tai, Chia-Ming Yeh, Chin-Chen Chang
報告者 :許睿中日期 :6.20
OutlineIntroductions ProposedExperimental resultsConclusions
IntroductionsNi et al. proposed ”Reversible data
hiding”◦While multiple pairs of peak and minimum
points can be used for embedding , the pure payload is still a little low.
◦Multiple pairs of peak and minimum point must be transmitted to the recipient.
Proposed
2 2 3 3 2 2
xi-1 : predictive pixelxi : original pixel
otherise
0,i if
1ii
ii xx
xd
2 0 1 0 -1 0
-5 -4 -3 -2 -1 0 1 2 3 4 50
2
4
6
8
10
12
1 i
1 i
andd if 1
andd if 1
or0 if
iii
iii
ii
i
xxpx
xxpx
p d ix
y
x
d
peak
2 3y
2 0 1 0 -1 0
1 i
1 i
andd if
andd if
iii
iiii xxpbx
xxpbxy
Secret=101Secret=101
yi=xi+b
=2+1
=3
Proposed
2 2 3 3 2 2
xi-1 : predictive pixelxi : original pixel
otherise
0,i if
1ii
ii xx
xd
2 0 1 0 0-1
-5 -4 -3 -2 -1 0 1 2 3 4 50
2
4
6
8
10
12
1 i
1 i
andd if 1
andd if 1
or0 if
iii
iii
ii
i
xxpx
xxpx
p d ix
y
x
d
peak
2 3
2 0 1 0 0-1
1 i
1 i
andd if
andd if
iii
iiii xxpbx
xxpbxy
Secret=101
yi=xi-1
=2-1
=1
2 1 3y 2 3 1 32 4 3 1 32 3 4 3 1 3
Proposed
6 -5 -4 -3 -2 -1 0 1 2 3 4 5 60
1
2
3
4
5
6
7peak
peak
Proposed
2 3 4 3 1 3
-5 -4 -3 -2 -1 0 1 2 3 4 50
2
4
6
8
10
12
1x-y if , 1
x-y if , 0
1-ii
1-ii
p
pb
y
peak
otherwise ,
and if , 1
and if , 1
11
11
i
i-iiii
i-iiii
i
y
xypxyy
xypxyy
x
2x
di=yi-xi-1
=3-2
=1
xi=yi-1
=3-1
=2
2
b=1
Proposed
2 3 4 3 1 3
-5 -4 -3 -2 -1 0 1 2 3 4 50
2
4
6
8
10
12
1x-y if , 1
x-y if , 0
1-ii
1-ii
p
pb
y
peak
otherwise ,
and if , 1
and if , 1
11
11
i
i-iiii
i-iiii
i
y
xypxyy
xypxyy
x
2x
di=yi-xi-1
=4-2
=2
xi=yi-1
=4-1
=3
2 3 3 2 2
Proposed-Binary Tree Structure
Binary Tree Structure
number of peak point=2L
Proposed-Prevent Overflow or Underflow
Proposed-Embedding
1
1
and2 if 2
and2if 2
0 if
iiL
iL
i
ii L
iL
i
i
i
xxdx
xx d x
ix
yx
d
1
1
and2 if
and2 if
iiL
iii
iiL
iiii xxdb)(dx
xxdb)(dxy
Secret=101
yi=xi-2L
=133-
4
=129
150
132
130
129
136
139
133
150
-18
-2 -1 7 3 -6
-255+2L+
1
255-2L+1
0 2L
-2L
Embedding level L=2
y 150
129
-6
Proposed-Embedding
1
1
and2 if 2
and2if 2
0 if
iiL
iL
i
ii L
iL
i
i
i
xxdx
xx d x
ix
yx
d
1
1
and2 if
and2 if
iiL
iii
iiL
iiii xxdb)(dx
xxdb)(dxy
Secret=101
yi=xi+(di+b)
=139+(3+1)
=143
150
132
130
129
136
139
133
150
-18
-2 -1 7 3
-255+2L+
1
255-2L+1
0 2L
-2L
Embedding level L=2
y 150
129
-6
Secret=101
143
Proposed-Embedding
1
1
and2 if 2
and2if 2
0 if
iiL
iL
i
ii L
iL
i
i
i
xxdx
xx d x
ix
yx
d
1
1
and2 if
and2 if
iiL
iii
iiL
iiii xxdb)(dx
xxdb)(dxy
Secret=101
yi=xi+2L
=136+4
=140
150
132
130
129
136
139
133
150
-18
-2 -1 7 3
-255+2L+
1
255-2L+1
0 2L
-2L
Embedding level L=2
y 150
137
-6
143
140
128
127
128
Proposed-Embedding
-255+2L+
1
255-2L+10 2L-2L 2L+1-2L+1
Proposed-Extraction
111
111
2and odd is if , 1
2andeven is if , 0L
i-iii
Li-iii
-xy xy
-xy xyby
otherwise ,
and2 if , 2
and2 if , 2
and2if ,
and2if ,
11
1
11
1
11
12
11
12
1
1
i
i-iL
i-iL
i
i-iL
i-iL
i
i-iL
i-ixy
i-iL
i-ixy
i
y
xy -xyy
xy -xyy
xy -xy yi
xy -xy yi
x
ii
ii
xi=yi+2L
=128+4
=132
150
128
127
128
140
143
129
-255+2L+
1
255-2L+1
0 2L+
1
-2L+1
Embedding level L=2
x 150
di=yi-xi-1
=128-150
=-22
132
Proposed-Extraction
111
111
2and odd is if , 1
2andeven is if , 0L
i-iii
Li-iii
-xy xy
-xy xyby
otherwise ,
and2 if , 2
and2 if , 2
and2if ,
and2if ,
11
1
11
1
11
12
11
12
1
1
i
i-iL
i-iL
i
i-iL
i-iL
i
i-iL
i-ixy
i-iL
i-ixy
i
y
xy -xyy
xy -xyy
xy -xy yi
xy -xy yi
x
ii
ii
150
128
127
128
140
143
129
-255+2L+
1
255-2L+1
0 2L+
1
-2L+1
Embedding level L=2
x 150
di=yi-xi-1
=127-132
=-5
132
b=1
1303127
127 2
5-
21
ii xyii yx
130
129
136
139
133
Experimental results
Conclusion In this letter, we have presented an efficient extension of
the histogram modification technique by considering the differences between adjacent pixels rather than simple pixel value.
One common drawback of virtually all histogram modification techniques is that they must provide a side communication channel for pairs of peak and minimum points.
To solve this problem, we introduced a binary tree that predetermines the multiple peak points used to embed messages; thus, the only information the sender and recipient must share is the tree level L.