-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
1/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
* + !1", IJAFRC All Rights Reserved #i-afrc#org
$urve. of Recent Reversi/le 0ata iding $chemes#Ankita Meenpal*, Shital S Mali
Department of Elex. & Telecommunication.
RAIT, Nerul, Navi Mumai, Mumai, !niver"it#, In$ia % ''(')
A 2 $ 3 R A C 3
$teganograph. is the science that involves communicating secret data in an appropriate
multimedia carrier, e#g#, image, audio, and video files# It comes under the assumption that if the
feature is visi/le, the point of attac4 is evident, thus the goal here is ala.s to conceal the ver.
e5istence of the em/edded data# 6atermar4ing is one of the promising solutions for tamper
detection and protection of digital content# oever, atermar4ing can cause damage to the
sensitive information present in the cover or4# 3herefore, at the receiving end, the e5act
recover. of cover or4 ma. not /e possi/le# Additionall., there e5ist certain applications that
ma. not tolerate even small distortions in cover or4 prior to the donstream processing# Insuch applications, reversi/le data hiding instead of conventional atermar4ing is emplo.ed#
Reversi/le data hiding of digital content allos full e5traction of the secret data along ith the
complete restoration of the cover or4# 0ue to the rapid evolution of reversi/le data hiding
techni7ues, a latest revie of recent research in this field is highl. desira/le#
Inde5 3erms Information hiding, istogram processing, Reversi/le data hiding, 9rror e5pansion,
:uanti;ation,
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
2/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8 * + !1", IJAFRC All Rights Reserved #i-afrc#org
la"t fe+ #ear" ecau"e of it" increa"in application" in militar# communication, healthcare, an$ la+;
enforcement. 8iure 1 "ho+" the lock $iaram of a a"ic rever"ile $ata hi$in "#"tem.
The exi"tin rever"ile $ata hi$in "cheme" are mo"tl# fraile in nature. The t+o important propertie" of
rever"ile $ata hi$in are imperceptiilit# an$ eme$$in capacit#. Rouhl# "peakin, imperceptiilit# i"
the mea"ure of "imilarit# et+een "teo an$ the cover imae. 6hile, eme$$in capacit# i" the mea"ureof the maximum numer of information it" that can e eme$$e$ in the cover imae. The performance
of a rever"ile $ata hi$in techni4ue i" thu" evaluate$ on the a"i" of the"e mea"ure".
ne of the fir"t rever"ile $ata hi$in metho$ +a" intro$uce$ # 5on"iner et al. -11/. The# utili=e$
mo$ulo a$$ition >) to achieve rever"iilit# in their $ata hi$in techni4ue. Mac4 -1?/ $evelope$ a
rever"ile $ata hi$in approach # mo$if#in the patch+ork alorithm an$ u"in mo$ulo a$$ition >).
Althouh, 5on"iner et al. -11/ an$ Mac4 -1?/ propo"e$ rever"ile techni4ue", the imperceptiilit# of
their approache" i" not impre""ive. The "teo imae" re"ultin from 5on"iner et al. -11/ an$ Mac4 -1?/ "
techni4ue" "uffer from "alt an$ pepper noi"e ecau"e of the u"e of mo$ulo a$$ition >). A rever"ile $ata
hi$in techni4ue +ithout u"in mo$ulo a$$ition >) +a" then intro$uce$ # 8ri$rich et al. -3/.
Figure 1# $tandard Reversi/le 0ata iding $cheme
8ri$rich et al. -3/ propo"e$ the concept of compre""in the lea"t "inificant it 9@S2: plane of cover imae
to make "pace for the "ecret $ata to e eme$$e$. 5o+ever, the eme$$in capacit# of thi" approach
+a" limite$. To improve the eme$$in capacit# an$ imperceptiilit# of the "teo imae, 8ri$rich et al.
-?/ then propo"e$ another approach. Evolution of rever"ile $ata hi$in "tarte$ aroun$ ''', an$ it i"
no+ 4uite $ifficult to keep up +ith the $evelopment that i" oin on in thi" fiel$. Man# rever"ile $ata
hi$in alorithm" have een $evelope$ in the pa"t $eca$e. A numer of ne+ techni4ue", exten"ion" orimprove$ ver"ion" of the earlier techni4ue", have een propo"e$ in recent #ear". The improvement i"
primaril# a"e$ upon makin a oo$ imperceptiilit# ver"u" capacit# tra$eoff.
In thi" "urve# paper, +e thu" revie+ in $etail 9throuh lock $iaram", taular;compari"on", an$ actual
performance compari"on": the ne+l# emerin rever"ile $ata hi$in techni4ue". Althouh $ifferent
cateorie" of rever"ile $ata hi$in techni4ue" are reporte$ in literature, it i" har$ to $ra+ a preci"e
oun$ar# amon the $ifferent cateorie" of rever"ile $ata hi$in techni4ue". 5o+ever, one thin
common in all of the"e approache" i" to create "ome "pace for hi$in information. Data hi$in techni4ue"
are characteri=e$ # the eme$$in an$ extraction techni4ue" emplo#e$. 6e revie+e$ ne+l# emerin
rever"ile $ata hi$in techni4ue" an$ cateori=e$ them into four roup", i.e. compre""ion a"e$,
hi"toram mo$ification a"e$, 4uanti=ation a"e$, an$ expan"ion a"e$ techni4ue". ur approach here i"
to explain each of the cateor# # pre"entin $etail" of one of the prominent re"earch +ork of the
corre"pon$in techni4ue. 6e riefl# anal#=e the fir"t three roup" +hile the expan"ion a"e$ rever"ile
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
3/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
= * + !1", IJAFRC All Rights Reserved #i-afrc#org
$ata hi$in i" $i"cu""e$ in $etail. The rea"on i" that error expan"ion a"e$ rever"ile $ata hi$in
techni4ue" are 4uite promi"in in achievin hih capacit# at a iven imae 4ualit# mea"ure, an$ are
computationall# efficient. To thi" en$, "everal expan"ion a"e$ $ata hi$in techni4ue" are $i"cu""e$ an$
compare$.
The orani=ation of thi" "urve# paper i" pre"ente$ throuh a lock $iaram in 8iure to provi$e a riefovervie+. Section II fir"t pre"ent" a "hort revie+ of compre""ion a"e$ rever"ile $ata hi$in techni4ue".
Section III then anal#=e" hi"toram mo$ification a"e$ rever"ile $ata hi$in techni4ue". Next,
4uanti=ation a"e$ rever"ile $ata hi$in techni4ue" are $i"cu""e$ in Section IB, +hile Section B
pre"ent" variou" t#pe" of expan"ion a"e$ rever"ile $ata hi$in. 8inall#, Section BI conclu$e" thi"
article.
II# Compression /ased R0
In or$er to recover the oriinal imae, +e nee$ to "tore the information e""ential for recover# of the
oriinal imae alon +ith the "ecret $ata. Thu", in ca"e of RD5, a$$itional $ata nee$" to e eme$$e$ an$
con"e4uentl#, nee$" more "pace compare$ to conventional $ata hi$in for $ata eme$$in. A "imple
approach +ill e to compre"" a part of cover imae for eme$$in $ata. Several rever"ile $ata hi$in
"cheme" are reporte$ u"in thi" approach.
Ar"alan et al. -1/ utili=e$ Cuan et al." -/ compan$in function in comination +ith enetic alorithm to
$evelop a hih capacit# rever"ile $ata hi$in techni4ue. In their approach, imae i" fir"t tran"forme$
into fre4uenc# $omain # takin inteer +avelet tran"form an$ then $ivi$e$ into lock".
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
4/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8! * + !1", IJAFRC All Rights Reserved #i-afrc#org
III#istogram modification /ased R0
In thi" t#pe of RD5 hi"toram of the imae in pixel7tran"form $omain i" calculate$. Then a"e$ on the
hi"toram plot the "cheme" tr# to eme$ $ata # effectivel# chanin the plot of oriinal hi"toram. 8or
example one of the approach coul$ e, imae i" $ivi$e$ into "everal lock" of neihourin pixel". Then,
each lock i" "plit into t+o =one", an$ corre"pon$in hi"toram" are calculate$. A in i" "hifte$ in
accor$ance +ith the value of corre"pon$in "ecret it. If the it i" 1, "hift the lo+e"t in to the hihe"t
one, an$ $o+nra$e other in". An$ if the it i" ', then upra$e each in an$ "hift the hihe"t in to the
lo+e"t in. 8iure an$ > are "ome of the po""ile approache" hi"toram mo$ification a"e$ RD5
"cheme.
Figure Compression 2ased R0 Approach
Figure "# istogram >odification 2ased R0 Approach
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
5/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
81 * + !1", IJAFRC All Rights Reserved #i-afrc#org
Figure # Another istogram >odification 2ased R0 Approach
amran et al. -1/ improve$ the +ork reporte$ # ao et al. -1'/ 9"ho+n in 8iure : # propo"in the
eme$$in of correct me""ae it onl#. Due to thi" improvement, 2
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
6/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8 * + !1", IJAFRC All Rights Reserved #i-afrc#org
$ata hi$in alorithm for me$ical imae $ata hi$in "#"tem", +hich en"ure" the recover# of cover imae.
Eme$$in proce$ure of ne"te$ FIM a"e$ rever"ile $ata hi$in techni4ue -1>/ i" "ho+n in 8iure ).
Ne"te$ 4uanti=ation in$ex mo$ulation 9FIM: $ata hi$in alorithm for me$ical imain "#"tem" en"ure"
the recover# of cover imae.
Figure ?# :I> 2ased Reversi/le 0ata iding 3echni7ue
V# 95pansion /ased R0
The a"ic i$ea here i" to enerate "ome kin$ of $ifference amon the pixel" or tran"forme$ coefficient" or
pre$icte$ "ample". Then # follo+in a rever"ile $ifference expan"ion "trate# variou" t#pe" of
rever"ile $ata hi$in techni4ue" are $evi"e$. Some of the main "trate# +hich follo+" the aove
mentione$ approach areG
A.
Contrast mapping /ased R0
In ''(, / pre"ente$ their +ork on contra"t mappin a"e$ rever"ile $ata hi$in. In their
techni4ue, the# performe$ tran"formation of pair of pixel". The tran"formation i" invertile for "ome
pair of pixel", even if @S2" of tran"forme$ pair" are lo"t. The computational co"t i" lo+ a" the metho$ i"
"imple in nature. 5o+ever, 4ualit# of the marke$ imae "uffer" at oth lo+ an$ hih pa#loa$ ecau"e the
variation" pre"ent in the cover imae are not taken into con"i$eration $urin eme$$in. The
eme$$in proce$ure for
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
7/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8& * + !1", IJAFRC All Rights Reserved #i-afrc#org
eme$$e$, an$ the auxiliar# $ata compri"in the @Mc an$ @S2" of the corre"pon$in pixel". After
eme$$in, the eme$$e$ pixel inten"it# H i" otaine$ u"in the follo+in mathematical expre""ionG
wepP += ~ 91:
5ere, the eme$$e$ pre$iction error i" a$$e$ in the pre$icte$ pixel inten"it#. Thi" i" ecau"e alteration
in pre$icte$ inten"it# pro$uce" le"" $i"tortion compare$ to oriinal pixel inten"it#.
Figure # Contrast >apping 2ased R0
At the $eco$in "i$e, fir"t the @Mci" extracte$ an$ $ecompre""e$. Then, the eme$$e$ it" are extracte$
alon +ith the recover# of the cover imae u"in 9: an$ 90:, re"pectivel#. a"ic i$ea here i" to enerate
"ome kin$ of $ifference amon the pixel" or tran"forme$ coefficient" or pre$icte$ "ample". Then #
follo+in a rever"ile $ifference expan"ion "trate# variou" t#pe" of rever"ile $ata hi$in
=
22
ww
eeb 9:
bePp = 90:
The eme$$in rate of the propo"e$ approach attain" approximatel# one it per pixel 9pp:. Al"o,
multiple eme$$in can e applie$, +here a hiher eme$$in rate i" re4uire$. Thi" techni4ue ive"
etter re"ult" for mo$erate to hih eme$$in rate" compare$ to DE "cheme.
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
8/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8" * + !1", IJAFRC All Rights Reserved #i-afrc#org
Secon$l#, it expan$" the error # a$$ition rather than it "hiftin. It al"o exploit" the correlation et+een
neihourin pixel" more exten"ivel# than HE "cheme".
@uo et al. -1(/ reporte$ a rever"ile $ata hi$in metho$ u"in interpolation techni4ue. The "ecret $ata
it" are fir"t eme$$e$ in the non;"ample pixel" until no non;"ample pixel i" left. Then, the re"t of the
"ecret it" are in"erte$ into the "ample pixel", +hich are interpolate$ u"in neihourin eme$$e$pixel". Thi" "cheme provi$e" le"" eme$$in $i"tortion an$ lo+ computational co"t, +hich re"ult in
etter imae 4ualit# an$ efficient alorithm, re"pectivel#. 8iure ? "ho+" the a"ic lock $iaram of the
eme$$in proce$ure of the "ecret $ata for @uo et al." techni4ue -1(/.
Figure 8#
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
9/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8 * + !1", IJAFRC All Rights Reserved #i-afrc#org
have even $evelope$ h#ri$ approache" # cominin $ifferent techni4ue". 6e have o"erve$ that
almo"t all of the rever"ile $ata hi$in approache", one +a# or the other, create "pace for it eme$$in
# effectivel# performin le"" 5BS 9human vi"ual "#"tem:;o"ervale manipulation" in the contra"t of an
imae. Thi" happen" $irectl# in ca"e of contra"t a"e$, +hile in$irectl# in ca"e of hi"toram proce""in,
Figure =# Interpolation 2ased R0
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
10/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8? * + !1", IJAFRC All Rights Reserved #i-afrc#org
-)/ I.L. .
-3/ L. 8ri$rich, M. olan, R. Du, JInvertile authenticationK, inG Hrocee$in" of the SHIE Securit# an$
6atermarkin of Multime$ia 0')>.
-11/ / @.T. o, L.E. 00>0).
-'/ L.;S. Han, 5.;
-
8/11/2019 Survey of Recent Reversible Data Hiding Schemes
11/11
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 8, August!1"#I$$% &"8 ' "8&
8 * + !1", IJAFRC All Rights Reserved #i-afrc#org
-/ . Cuan,