Nghin cu mt s k thut pht hin nh giu tin

H Th Hng Thm
Trng i hc Cng ngh
Lun n TS ngnh: H thng thng tin; M s: 62 48 05 01
Ngi hng dn: TS. H Vn Canh, PGS. TS. Trnh Nht Tin
Nm bo v: 2012

Abstract: Chng 1: Gii thiu tng quan v giu tin trong nh, pht hin nh c
giu tin v cc nghin cu lin quan. Ngoi ra, chng ny cn nu ra phng
php nh gi cc k thut pht hin nh c giu tin theo chun nh gi chnh
xc (Precision), bao ph (Recall), trung bnh iu ha (F-measure) v ngun
d liu nh s dng th nghim. Chng 2: Trnh by mt s k thut pht
hin m cho nh c giu tin trn LSB gm cc k thut pht hin: lch
chun, 12, t l xm v pht hin bng phng php c lng thng tin giu
trong s dng l thuyt trng khp. T a ra kt qu so snh gia cc k
thut xut v mt s phng php pht hin m khc: 2 vi n bc t do ca A.
Westfeld , LLRT (Logarithm Likelihood Ratio Test) ca K. Sullivan v k thut
c lng: RS (Regular /Singular) ca Jessica Fridrich v cng s , DI ca T.
Zhang v X. Ping cho thy kt qu tng ng v hiu qu hn mt s trng
hp. Chng 3: xut bn k thut pht hin c rng buc cho nh c giu tin
s dng mt s k thut giu tin bit: DIH (Difference Image Histogram), HKC
(K thut giu tin ca ba tc gi J. Hwang, J. Kim v J.Choi), IWH v RVH
(Reversible Vertical Horizontal Technique).
Keywords: H thng thng tin; K thut giu tin; Giu tin trong nh

Content
1. Tnh cp thit ca lun n
Giu thng tin (Steganography) l k thut giu thng tin quan trng vo i tng
khc. N c lch s pht trin t hng nghn nm v tri qua nhiu thi k bin ng
ca x hi loi ngi, ngy nay khi k thut s bng n, con ngi cng s ho lnh
vc phc v cho cuc sng hin i.
V nguyn l, giu tin trong d liu a phng tin hay trong d liu nh s khng
khc g nhiu, nhng do giu tin trong nh d thc hin hn, giu c nhiu thng tin
hn, v cng l i tng s c s dng kh ph bin trn Internet hin nay, nn k
thut giu tin trong nh chim t l nhiu nht trong cc loi d liu a phng tin [32].
Thng tin c th c giu trn min khng gian hoc trn min bin i nh bin i
tn s (cosine, wavelet, fourier ri rc) hay bin i sai phn (difference image).
K thut giu tin trong nh a s l phng php giu trn bit c t ngha nht LSB
(Least Significant Bit) ca im nh hoc ca cc h s bin i (bin i cosine ri rc,
wavelet ri rc, sai phn image difference,). Ngoi ra cn c mt s phng php
giu khc theo cch thc c s thay i nh trn nh theo hnh thc chn nhiu SS
(Spread Spectrum), iu chnh h s lng t QIM (Quantization index modulation)...
Ging nh trong Mt m, Thm m (Cryptanalysis) l k thut i lp nhng song
song tn ti v pht trin cng vi s pht trin ca k thut mt m, nhm gii m cc
bn m thu c hiu r ni dung ban u ca bn m, th pht hin nh c giu tin
(Image Steganalysis) l k thut i lp vi Image Steganography nhm d tm nh s
no c giu thng tin hay khng.
Vic nghin cu Steganalysis ngoi ngha khoa hc cn c hai ngha thc tin,
l: Th nht, nhm phc v c lc cho lnh vc an ton thng tin; Th hai, nhm nng
cp v thc y s pht trin ca k thut giu tin trong nh. Vi hai mc ch nu trn
dn n hai hng nghin cu khc nhau. Hng th nht, c gng xy dng thut ton
pht hin m (blind steganalysis) cho nh c giu tin s dng k thut giu bt k.
Hng th hai, da vo k thut giu tin no bit, c th xy dng c thut ton
pht hin ph hp (pht hin c rng buc constraint steganalysis).
c nhiu cng trnh nghin cu cng b trn th gii thnh cng theo hai hng
ny. Tuy nhin, cc k thut giu tin ra i sau ngy cng tinh xo hn i hi cc nh
pht hin nh giu tin khng ngng tm ra phng php pht hin ph hp bt kp vi xu
hng pht trin ca k thut giu. c bit vi tc pht trin nhanh chng ca
Internet th nhu cu trao i thng tin bng nh ngy cng ln mnh, do m bo
an ton an ninh, quc phng hay nhm h tr nng cp, ci tin k thut giu no an
ton hn ang l bi ton cp thit t ra cho cc nh nghin cu trong lnh vc an ton
thng tin hin nay.
2. Mc tiu v phm vi nghin cu
T cc vn nu trn, lun n ny tp trung nghin cu ci tin v xut mt s k
thut pht hin nh c giu tin theo hai hng chnh:
- Th nht, a ra k thut pht hin m cho nh c giu tin trn LSB ca min khng
gian v min tn s.
- Th hai, a ra mt s k thut pht hin c rng buc cho nh c giu tin vi k thut
giu bit trc.
i tng nh nghin cu l cc nh dng BITMAP nh cc nh dng: JPG, GIF,
PNG, TIF, BMP.
3. Nhng ng gp ca lun n
Nhng ng gp chnh ca lun n l a ra k thut pht hin nh c giu tin theo hai
bi ton:
Bi ton 1: K thut pht hin m cho nh c giu tin trn LSB :
- Ca min khng gian vi bn phng php xut sau: phng php phn tch
lch chun, phng php thng k _
2
mt bc t do (_
1
2
), phng php phn tch t l
xm, phng php c lng s bit thng tin giu trn LSB ca min khng gian bng
l thuyt trng khp.
- Ca min tn s bng phng php phn tch t l xm.
Bi ton 2: K thut pht hin c rng buc cho nh giu tin s dng k thut giu
bit gm k thut: IWH trn h s wavelet, DIH trn h s sai phn, HKC trn min
khng gian, RVH trn min khng gian vi hai pha ngang dc.
Tin hnh th nghim trn nhng tp d liu c s lng nh ln so snh k thut
xut vi cc k thut pht hin khc.
4.T chc lun n
Lun n gm ba chng trong :
Chng 1 gii thiu tng quan v giu tin trong nh, pht hin nh c giu tin v cc
nghin cu lin quan.
Chng 2 trnh by k thut pht hin m cho nh c giu tin trn LSB.
Chng 3 trnh by k thut pht hin c rng buc.
Phn cui cng l phn kt lun chung v ph lc:
Ph lc gii thiu chng trnh m vi hai m un chnh: M un giu tin v m
un pht hin nh giu tin phc v cc th nghim trong lun n.

Chng 1. GIU TIN TRONG NH, PHT HIN NH C GIU TIN V CC
NGHIN CU LIN QUAN
1.1. GIU TIN TRONG NH V NGHIN CU LIN QUAN
1.1.1. Khi nim
1.1.2. Phng php giu tin v nghin cu lin quan
Phng php giu trn LSB l phng php thay th cc bit thng tin vo cc bit LSB
ca im nh [16, 17, 19, 50, 51, 53 - 55, 65, 67, 69, 75, 77, 91, 100]. Trong mt im
nh ca nh 8-bit mu th bit cui cng (bit th 8) gi l bit LSB. Do vy khi thay i gi
tr ca bit ny (t 0 sang 1 hay t 1 sang 0) khng lm nh hng nhiu n cht
lng trc quan ca nh. Thng tin c th giu trn LSB ca cc h s bin i cosine,
wavelet, ...
Ngoi phng php giu trn LSB cn c mt s phng php giu tin khc theo hnh
thc chn nhiu SS [3, 4, 26, 27, 32, 60], iu chnh h s lng t ha QIM [5, 23, 42,
65, 79], k thut giu thun nghch (i hi yu cu sau khi tch thng tin chng ta cn
c th khi phc li nh gc ban u) m ra mt hng mi trong lnh vc giu tin vi
mt lot cc k thut giu tin thun nghch c cng b [21, 24, 25, 35, 41, 45, 48, 49,
52, 53, 58, 90, 91, 93, 98, 99].
1.1.3. Phng php nh gi an ton ca mt lc giu tin
Chng ta a ra mt vi k hiu s c s dng xuyn sut lun n ny. K hiu l
tp tt c cc nh gc C, l tp cc thng tin mt M, l tp cc kha K giu tin, l
tp tt c cc nh stego S (nh c giu tin). Mt lc giu tin (thut ton) l mt cp
(S
E
, S
X
), vi S
E
: l hm nhng thng tin, S
X
: l hm tch
thng tin. Hm nhng S
E
to ra mt i tng S e t mi Ce , M e v K e ,
hm tch S
X
tch tin M t S bng kha K.
Gi s P
C
hm phn b xc xut ca C e . Nu kha K e v M e c chn
ngu nhin th lc giu tin (S
E
, S
X
) cng vi hm phn b xc sut P
C
s c hm
phn b xc sut P
S
tng ng ca S e . Khi theo khi nim v giu tin an ton ca
Cachin [15] ta c nh ngha sau:
nh ngha 1.1 [15] Mt lc (thut ton) giu tin c gi l an ton nu sai
phn Kullback Leibler gia hm mt xc sut ca P
C
v P
S
theo (1.1) bng 0:
D
KL
(P
C
|| P
S
) =

()

()

(1.1)
Khi D
KL
(P
C
|| P
S
) < th lc giu tin c an ton ( - secure), trong l
mt s thc dng nh ty cho trc.
y l khi nim ng t quan im l thuyt, rt kh thc hin trong thc t v khng
gian nh l qu ln (v hn). Mt khc, mt lc giu tin m bo D
KL
(P
C
|| P
S
) =
0 l khng th v iu ny c ngha khng thay i g trn nh gc, tc l P
C
= P
S
(theo
b c bn trong L thuyt thng tin). V vy, ngi ta thng giu sao cho t an
ton - secure m bo thay i trn nh nh nht m mt ngi kh c th cm nhn.
1.2. PHT HIN NH GIU TIN V CC NGHIN CU LIN QUAN
1.2.1. Khi nim
Pht hin nh giu tin (image steganalysis) l k thut pht hin s tn ti ca thng
tin c giu trong nh s no [27].
1.2.2. Phng php pht hin nh c giu tin
Pht hin nh giu tin c th nh ngha nh mt bi ton phn loi da trn kim nh
gi thuyt thng k. iu ny ph thuc vo hiu bit ca chng ta v lc giu tin,
do pht hin nh giu tin c pht biu: hoc nh bi ton kim nh gi thuyt n
(simple hypothesis); hoc nh bi ton kim gi thuyt phc hp (composite hypothesis).
Nu chng ta khng c thng tin g v lc giu tin th phng php pht hin gi
l pht hin m (blind steganalysis), bi ton phn loi c th pht biu da trn kim
nh gi thuyt phc hp sau:
H
0
: X c rt ra t hm phn b xc sut l P
S

H
1
: X khng c rt ra t hm phn b xc sut P
S

Vi X l mu d liu nh c xt.
Trong trng hp bit trc thng tin v lc giu tin th phng php pht hin
gi l pht hin c rng buc (constraint steganalysis). Gi s chng ta bit c phn b
xc sut ca P
C
, lc giu tin (S
E
, S
X
) v phn b ca thng tin M, chng ta c th
tnh c P
S
. T chng ta c th a ra phng php pht hin theo bi ton phn loi
da trn kim nh gi thuyt n sau:
H
0
: X c phn b xc sut l P
S

H
1
: X c phn b xc sut l P
C

gii quyt bi ton kim nh gi thuyt thng k ny, chng ta cn tm ra c
min iu kin hoc c trng no c th phn loi sao cho t l li xy ra l nh
nht.
R rng c nhiu cch chia nh vy. Nhng vn l bng cch chia bt k u dn
n hai sai s theo thng k gi l sai s loi I (type I error) vi xc sut o (0 < o < 1)
(khng nh sai) v sai s loi II (type II error) (ph nh sai) vi xc sut | (0 < | < 1).
1.2.3. Nghin cu lin quan v hng pht trin ca lun n
Cc phng php nghin cu ca Steganalysis tp trung vo hai hng chnh nh
nu trn:
- Hng th nht c gng xy dng pht hin m cho k thut giu bt k.
- Hng th hai tm cch pht hin nh stego khi bit k thut giu tin
Trong lun n ny i su vo nghin cu k thut pht hin m cho nh c giu tin
trn LSB v pht hin c rng buc cho mt s k thut giu bit trc.

1.3. PHNG PHP THC NGHIM V NH GI
1.3.1. Tiu chun nh gi
Pht hin nh c giu tin thc cht l bi ton phn lp tp nh bt k vo hai tp con
l tp nh gc v tp nh c giu tin. Vi phn lp ny, nh phn tch thng s dng cc
o nh gi: chnh xc P (precision), bao ph R (recall) v trung bnh iu
ha F (f-measure) p dng cho k thut pht hin xut c th nh gi khch quan,
hiu qu v tin cy ca k thut.
1.3.2. Ngun d liu nh th nghim
Mt vn quan trng trong lun n chnh l vic chun b cc tp d liu nh thc
hin cc thc nghim lin quan. Ngun d liu c chn phi m bo cc yu cu sau:
C tin cy nht nh, c cng b bi cc t chc c uy tn, c s lng nh tng
i ln, ni dung nh a dng.
Tp nh gc th nghim: Tp nh gc s dng chung cho cc thut ton giu v pht
hin trong lun n gm 2088 nh vi cc kch c khc nhau trong : 1014 nh c ti
v t hai th vin trc tuyn [103, 107] v 1074 nh c to ra t my nh k thut s
v my nh trn in thoi di ng. Ni dung nh a dng gm: nh phong cnh, chn
dung, hot ha, v tinh, cc s kin a s l nh 24 - bit mu c chuyn sang nh
cp xm bng trnh x l nh Adobe Photoshop CS 8.0 c tp nh th nghim gm
2088 nh cp xm. Gi tp nh ny l
0
s c s dng trong hu ht cc th nghim
ca lun n.
1.3.3. Cng c h tr v mi trng thc nghim
Cc k thut a ra ca lun n c ci t trn mi trng Matlab phin bn
R2008b (7.7.0), chy trn my tnh cu hnh Intel (R) Core (TM) 2 Duo T.7200 2.00GHz,
b nh trong 1Gb, b nh ngoi dung lng trng kh dng 15GB.
KT LUN CHNG 1
Chng ny a ra bc tranh tng quan v giu tin trong nh v pht hin nh giu tin.
Vi mi phng php giu s hnh thnh nn cc k thut pht hin ph hp thc y s
pht trin ca phng php giu. Vic i su vo tm hiu cc k thut pht hin s
gip chng ta nh hng pht trin v ci tin k thut giu hin ti hoc chnh l nn
tng m rng cho cc k thut pht hin khc.


Chng 2. K THUT PHT HIN M CHO NH GIU TIN TRN LSB
2.1. K THUT PHT HIN M TRN LSB CA MIN KHNG GIAN
2.1.1. Pht hin bng phn tch lch chun
2.1.1.1. Phn tch k thut giu LSB
Kho st c trng khc bit gia nh gc C v nh S c giu tin trn LSB. Thng k
d liu ca nh C v S c vector C
26x10
v S
26x10
vi c
ij
, s
ij
(0 i 25, 0 j 9) l tn
s ca im nh C v S c gi tr bng i*10+j. So snh hai vector C
26x10
v S
26x10
pht
hin mt vn quan trng l tng gi tr trn tng hng ca C
26x10
v S
26x10
tng
ng l khng thay i. Ch c gi tr ca cc phn t trong hng l thay i. Trong nh
C trn tng hng ca vector C
26x10
xut hin nhiu im t bin, tc gi tr ca n rt
khc nhau. Cn vi nh S th cc gi tr bin thin rt gn nhau.
2.1.1.2. Phng php pht hin
phn loi nh c giu tin v khng c giu tin trn LSB trong trng hp ny ta s
dng nh l sau:
nh l 2.1 [108]: Cho X l i lng ngu nhin c phn b chun N(a,o
2
). Khi
i lng ngu nhin Y= (X - a)/o c phn b chun N
n
(0,1)
nh l 2.2 - Cho X
1
, X
2 ,
... X
n
l i lng ngu nhin, c lp cng phn b chun
N(a, o
2
). Khi i lng ngu nhin X
1
+ X
2
+...+ X
n
s c phn b chun N(na, no
2
).
(chng minh xem trong ph lc A).
Trong thc t a v o
2
cha bit cho nn ta phi c lng a, o
2
. C nhiu phng php
c lng cc i lng ny nhng mt phng php thng dng v n gin nht l
phng php hp l cc i. Bng phng php ny ta thay a bi c lng
=
=
n
1 i
i
x
n
1
x v o
2
bi c lng
2
=
2
n
1 i
i
) x x (
n
1

=
, (o = ). K hiu: x
max
= max{x
1
, x
2
, , x
n
} v x
min
= min{x
1
,
x
2
, , x
n
}. Khi cc i lng ngu nhin: V
1
=
x
max
x
S

, V
2
=
xx
min
S

, s phn b chun
N
n
(0,1) khng ph thuc a v o
2
m ch ph thuc vo n.
t V=V
1
+V
2
, do i lng ngu nhin V
1
, V
2
c phn b chun N
n
(0,1) nn V c
phn b chun N
n
(0,2). p dng nh l gii hn trung tm [108], ta c
T =
V
2
(2.1)
s c phn b chun N
n
(0,1) c lp thnh bng XII trong [108] vi n=1,2,3,... v
mc ngha o=0.1, 0.05,...
i lng ngu nhin T t (2.1) c phn b chun N
n
(0,1) tc l ta c xc xut
P{T>x
0
} =
}

0
x
dt ) t (
n
p
trong P
n
(t) l hm mt xc sut chun N
n
(0,1) nu cho trc n v
gi tr xc sut sai s loi I vi o = o
0
, ta tm c gi tr ngng x
0
bi phng trnh sau
y:
} }
o = =

0
0
x
x
1 dt ) t (
n
p 1 dt ) t (
n
P
0

l nhng vn c bn, lm c s xy dng thut ton pht hin nh c giu
thng tin.
Do T=
2
V V
2 1
+
m (T > x
0
) (V
1
+V
2
> 2 x
0
) nn sau khi xc nh c x
0
ta c th
tm c ngng theo t
0
= 2 x
0
(2.2)

p dng gii quyt bi ton
Sau khi tm c ngng ca bi ton ta p dng phn loi nh nh sau: kim tra V
=
x
max
x
min
S

- Nu V > t
0
kt lun C nh khng giu thng tin
- Nu V < t
0
kt lun C nh c giu thng tin
Gi tr ngng t
0
c tnh ton theo (2.2) da trn x
0
tra cu theo bng phn b chun
[108] vi n=10 v tin cy o=0.1, 0.05, 0.025, 0.01 c gi tr tng ng t
0
=3.0349,
3.244, 3.414, 3.592.
2.1.2. Pht hin bng thng k _
2
mt bc t do
2.1.2.1. Phn tch k thut lch chun
Hn ch ca k thut trnh by 2.1.1 l ph thuc vo d liu nh v di ca
thng tin em giu trong nh. Nu d liu ca nh c nhiu cao th rt kh pht hin
v d liu ca nh phn b rt u. Mt khc, nu lng thng tin em giu thp s khng
lm thay i d liu ban u ca nh, iu ny nh hng n s phn b u d liu ca
nh trong cng thc pht hin.V vy sau y l mt phng php khc pht hin nh c
giu tin trn LSB.
2.1.2.2. Phng php pht hin
S dng nh l 2.3 trong [108] chng ta xy dng b 2.1.
nh l 2.3 [108]: Gi m l s ln xut hin mt bin c A trong dy n php th
Becnouli vi xc sut xut hin bin c A l P(A) = p > 0.
Khi , i lng ngu nhin Y=

c xp x phn b chun N(0, 1), vi q = 1 - p.

B 2.1: Gi s cho trc mt dy nh phn c ly t mt ngun ngu nhin, c
lp s=s
o
, s
1
, ..., s
n-1
. K hiu n
0
v n
1
ln lt l tn sut s 0 v 1 xut hin trong
dy (tc n
0
+ n
1
= n)
t z

=
(
0

1
)
2

(2.3)
Khi , nu s l ngu nhin, c lp th z c phn b _ bnh phng (chi-square)
1 bc t do (vi n >= 10)
p dng b 2.1 vo vic phn loi nh c giu thng tin trn LSB bng cch tnh
tn sut cc im nh ca mt nh cn kim tra c vector C
26x10
(b qua hng cui
cng ca C v hng ny c cha cc gi tr bng 0) ta c C
25x10
. Thc hin tip mt s
bc:
1. Tm gi tr ln nht ca C
25x10
k hiu l x
max
= max{c
ij
, i=0,24

, j=0,9

}. Gi s gi tr
max l x
max
= c
i
0
j
0
((i
0
,j
0
) c gi tr ln nht ti hng i
0
ca C
25x10
).
2. Tnh n
i
0
[0]=
=
4
0 j
j 2 , i
0
X , n
i
0
[1]=
=
+
4
0 j
1 j 2 , i
0
X ,

n
i
0
= n
i
0
[0]+ n
i
0
[1].
p dng b 2.1 ta c
0
0 0
i
2
i i
n
]) 1 [ n ] 0 [ n (
c phn b _
2
mt bc t do.
3. Kt lun, nu
) (
n
]) 1 [ n ] 0 [ n (
2
1
i
2
i i
0
0 0
o _ >

th nh kim tra l nh khng cha thng tin mt, ngc li

nu
) (
n
]) 1 [ n ] 0 [ n (
2
1
i
2
i i
0
0 0
o _ <

th nh kim tra c cha thng tin mt vi xc sut sai s l o.

Thc hin th nghim trn cng tp nh (gm 500 nh) vi cc gi tr o = 0.1, 0.05,
0.025, 0.01, 0.005 tra bng khi bnh phng [108] vi n=1 c cc gi tr tng ng
_
1
2

=2.71, 3.84, 5.02, 6.63, 7.88. Thy rng kt qu phn loi hiu qu khi _
1
2

=2.71.
2.1.3. Pht hin da trn phn tch t l xm
2.1.3.1. Pht biu bi ton
lm gim thiu sai s xy ra khi phn loi nh c giu tin trn min LSB chng ta
p dng b Neyman Pearson vi xc sut o (sai s loi I) cho trc cc tiu ha xc
sut | (sai s loi II).
2.1.3.2. Gii quyt bi ton
Trong phn ny s dng mt s b trong thng k, t c th m rng cc b
ny c th phn loi nh c giu tin trn LSB.
B 2.2 (Neyman Pearson) [108]: Cho trc f
0
, f
1
, f
2
, l nhng hm kh tch i
vi o v (o - hu hn) trn khng gian S. Gi s:
Cho tp con wcS v cc hng s c
1
, c
2
, c
3
,... tha mn:

}
= u
w
i i
c ) x ( d ) x ( f

Tp con w
0
c S v cc hng s k
1
, k
2
, tho mn:

e <
e >

>
>
0
1 i
i i 0
0
1 i
i i 0
w x , ) x ( f k ) x ( f
w x , ) x ( f k ) x ( f

v

}
= u
0
w
i i
c ) x ( d ) x ( f

Khi :
} }
u > u
0 w w
0 0
) x ( d ) x ( f ) x ( d ) x ( f


B 2.3 [109]: Nu P{x|H
0
} c phn b a thc (phn b m) v gi thuyt H
0

ng th i lng ngu nhin:
- 2 ln
(|
1
)
(|
0
)
c phn b _
2
. (2.5)
B 2.4 [109, 110]: Gi s f
1
, f
2
, ..., f
k
l k hm kh tch i vi o no (o -
hu hn) trn khng gian S, cn A
1
*
, A
2
*
, ..., A
k
*
l mt phn hoch ca S tho mn iu
kin:
Nu xeA
i
*
v f
i
(x) > f
j
(x) vi j = i, i, j =1,2,.., k.
Khi :

()

()

=1

=1
(2.6)
iu ny suy ra phn hoch A
1
*
, A
2
*
, ..., A
k
*
l mt phn hoch ti u, theo ngha hm
lc lng ln nht [108].
t f
0
(x) = P(w | H
1
), f
1
(x)=P(w | H
0
), khi w
0
l min ti u nu:
w
0
={x e S :
) ( t
) x ( f
) x ( f
1
0
o >
} (2.7)
Hay ni cch khc: w
0
={x e S : 1
0
P(x | H )
t( )
P(x | H )
o >
} (2.7)
y, theo b 2.2 nu ly c
i
= c = o, ta c P{w
0
|H
0
}=o, th w
0
c chn nh
(2.7) hoc (2.7) l min lm cho xc sut | l b nht khi xc sut o c nh. Cn t(o)
c xc nh bng b 2.3.
p dng cho vic tm nh c cha thng tin n, trc ht ta gi s P{x|H
0
} v
P{x|H
1
} l mt xc sut i vi o (o - hu hn) no khi ln lt gi thuyt
H
0
, H
1
ng. Theo b 2.2, chng ta phi xc nh min w sao cho:
}
o =
w
0
) x ( d ) H | x ( p (0 < o <1 cho trc)
v
1
w
p(x | H )d (x) 1 = |
}
t gi tr ln nht (2.8)
ng dng b 2.2, min ti u: w
0
= {x: p(x | H
1
) > t(o).p(x | H
0
)} hay:
w
0
= {x:
) ( t
) H | x ( p
) H | x ( p
0
1
o >
} (2.9)
t(o) c chn sao cho p(w | H
0
)= o
Tip theo chng ta s gii bi ton trong thng k ton hc sau:
Mnh 2.1: Gi s cho trc mt i lng ngu nhin k chiu X=(X
1
, X
2
, ..., X
k
)
c phn b a thc:
P(X
1
=r
1
,X
2
=r
2
,..,X
k
=r
k
)= k 2 1
r
k
r
2
r
1
k 2 1
P .. P P
! r !.. r ! r
! n
(r
i
> 0), i =1,..., k,
trong n = r
i
k
i=1
cho trc.
Kim nh gi thuyt H
0
: P
1
= P
1
0
, P
2
= P
2
0
, ..., P
k
= P
k
0
, (P
1
0
, P
2
0
, ..., P
k
0
cho
trc). i thuyt H
1
: tn ti i P
i
= P
i
0
.
Khi i lng ngu nhin:
0
i
i
k
1 i
i
i
0
i
k
1 i
i
i
0
i
k
1 i
i H
nP
m
ln m 2
m
nP
ln
n
m
n 2
P
P
ln P n 2 ln 2
0

= = =
= = =

(2.10)
c phn b _
2
vi k-1 bc t do (gi thuyt H
0
ng), vi
n
P
k
0
k
P
2
0
2
P
1
0
1
H
k 2 1
0
P
P
...
P
P
P
P
(
(
(

|
|
.
|

\
|
|
|
.
|

\
|
|
|
.
|

\
|
=
(theo b 2.2, 2.3 v c lng hp l nht [108]) trong P
i

=
m
i
n

(i =1,, k) vi m
i
l tn sut xut hin bin c i no trong dy n php th c lp.
Ch : Trong thc nghim, t(o) trong (2.9) thng c chn l 1, v P
i
0
nu khng
cho trc thng c c lng bng phng php hp l nht, bng cch thay P
i
0

bng P
i
0
vi i =1,..., k. Do vy cng thc (2.10) c th n gin thnh:
0
i
i
k
1 i
i
0
i
i
k
1 i
i H
P
P
ln 2 m
P
P
ln m 2 ln 2
0

= =
= ~
(2. 11)
Lc i lng ngu nhin
0
i
i
k
1 i
i
P
P
ln 2 m

=
c phn b _
2
vi k-1 bc t do. Nhng nu chn
k=1 th ng nhin

= = > 0 1 ln k ln
P
P
ln 2 m
0
i
i
i
vi H
0
ng.
Hay:

=
>
k
1 i
0
i
i
i
0
P
P
ln m
nu H
0
ng

=
<
k
1 i
0
i
i
i
0
P
P
ln m
nu H
1
ng (2.12)

=
=
k
1 i
0
i
i
i
0
P
P
ln m
th cha c kt lun
y l bi ton ti u theo ngha xc sut o cho trc, cc tiu ho xc sut |.
p dng vo bi ton pht hin nh c giu tin trn LSB ta c hai phng php pht
hin sau y:
1/. Phng php 1
p dng b 2.2 cho phn loi tp nh c giu tin trn LSB, trong trng hp khng
bit trc nh gc ca mi nh, chng ta phi xy dng mt nh lm mc bng cch
tm mt nh c kch thc xp x ( rng hng v ct, nu tng ng biu tn sut
cng tt) nh cn phn loi.
S dng h thc (2.12) lm c s cho vic pht hin nh c hay khng cha thng tin
n. Trong ng dng thc t, nu P
i

P
i
0
th vic kim nh gi thit mi c ngha. Mc
d vy c th P
i

P
i
0
vi i, (nu -i:P
i

= P
i
0
th loi ra khi cng thc), nhng s khc
bit khng ln lm. Trng hp nh vy, h thc (2.12) kim nh gi thuyt H
0
cho
chnh xc khng cao. Do , khi p dng vo vic pht hin nh c hay khng cha
thng tin n, lun n ci tin nh sau:
Chng ta bit rng do tnh cht ca logarit vi t, ta u c:
P
i

P
i
0
= ln
P
i

P
i
0

t
. Do
nu chn t > 2 th
P
i

P
i
0

t
s c tng hoc gim ln t ln ty theo
P
i

P
i
0
> 1 hay
P
i

P
i
0
< 1. Vi
t cng ln th s khuych i cng ln nu
P
i

P
i
0
> 1 v ngc li.
Thc t gi tr ca t ph thuc vo kch thc ca nh, kch thc nh cng ln, t cng
ln sao cho n c kh nng phn loi tt.
Cch pht hin khi khng c nh gc
Gi s c mt nh bt k Z, kim tra xem nh Z c giu tin trn LSB hay khng.
Khi khng c nh gc kim tra chng ta phi chn mt nh lm mc nh sau:
chn mt nh gc U c kch thc n = p * q xp x nh Z, tnh tn sut cc im nh
c vector X={x
i
, i = 0, ..., 255}. t P
i
0
=
x
i
n
.
Nhng thng tin vo LSB ca nh U theo thut ton giu LSB ngu nhin vi giu c
t l 100% trn LSB c nh stego S c cha tin mt.
K hiu P
i

=
y
i
n

(y
i
l tn sut xut hin im nh i trong nh stego S).
Tip theo lp vector C={c
i
, c
i
=tln
P
i

P
i
0
, i = 0, ..., 255} (2.13)
(x l php ton ly gi tr nguyn ca x).
Gi tr t c chn sao cho: max{c
i
} min{c
i
} > 400, i = 0, , 255. Vic la chn
ny da trn nh gi trn cng mt tp nh (gm 500 nh) vi cc gi tr t khc nhau,
c c gi tr t ph hp vic la chn nh _
1
2
(o) (tng t trong 2.1.2.2).
Tnh tn sut im nh ca nh Z (nh cn kim tra) c vector F={f
1
, f
2
, ..., f
255
}.
Lp tch v hng: c_f =
i
255
0 i
i
f c

=
, (vi c
i
tnh theo (2.13))
Nu c_f > 0, kt lun Z l nh c giu tin trn LSB.
Nu c_f < 0, kt lun Z l nh khng giu tin trn LSB.
Nu c_f = 0, th cha c kt lun.
2. Phng php 2
Phng php th 2 phn loi nh theo cng thc (2.11) nh sau:
0
0 0
0
i
i
k
1 i
i
i
i
k
1 i
i
i
i
k
1 i
i H
nP
m
ln m 2
m
nP
ln
n
m
n 2
P
P
ln P n 2 ln 2 = = =
= = =

t T=
0
i
i
k
1 i
i
nP
m
ln m 2
=
c phn b _
2
k-1 bc t do khi gi thuyt H
0
ng, tc l c xc xut:
P (T > t
0
) =
}

0
t
n
dt ) t ( p

Trong p
n
(t) l hm mt xc sut. Ta c th xc nh c t
0
qua phng trnh
sau:
} } o = =

0
0
t
t
0 n n
1 dt ) t ( p 1 dt ) t ( p
Nu bit c n v o= o
0
, ta c th xc nh c t
0
bng cch tra bng _
2
vi k - 1
bc t do trong vi k =256, tin cy o = 0.1, ta c t
0
= 284.33.
Chn mt nh gc C bt k c kch thc n = p * q, thng k tn s ca cc im nh
lu vo vector mt chiu X = {x
i
| i= 0,..., 255}. t P
i
0
=
x
i
n
.
S dng thut ton giu tin LSB bng phng php giu ngu nhin to ra 11 nh
c giu tin (k hiu S_0, .., S_10) c t l tin giu trn min LSB t 0 % n 100 % (mi
ln tng ln 10%). Sau mi nh ta thng k tn sut im nh c vc t Y = {y
i
| i =
0,..., 255}.
K hiu P
i

=
x
i
n
vi i = 0,..., 255. p dng cng thc (2.11) c: T= 2x
i
ln
P
i

P
i
0
255
i=0

cho mi cp nh (C, S_i) i = 0,...,10 ta c kt qu trong bng 2.1.
Bng 2.1: Kt qu th nghim nh gi T
Lng
tin
giu
(%)
0 10 20 30 40 50 60 70 80 90 100
(C,
S_i)
0
159.
4
454.3
0
80
7
924.
6
1064.
8
1020.2
0
1167.4
0
127
9
1352.2
0
1660.8
0
Vn ch chng ta khng bit trc nh gc, lm th no pht hin mt nh bt
k c giu thng tin hay khng. Nghin cu thc nghim trn cc nh giu tin thy rng
cc cp gi tr (x
2i
, x
2i+1
) cng gn nhau khi lng thng tin giu tng ln, iu lm
cho S cng tng ln. Khi khng c nh gc so snh, chng ta c th coi mc so snh
l nh c giu 100% trn min LSB, khi cc cp POV c gi tr rt gn nhau, tc l
x
2i
~ x
2i+1
=
x
2i
+x
2i+1
2
. Khi gi tr S s thay i nh bng 2.2. Da vo bng ny chng
ta c th chn t=500 lm ngng phn loi mt cch tin cy vi t l giu xp x t
30% tr ln.
Bng 2.2: Kt qu th nghim nh gi T
Lng
tin
giu
(%)
0 10 20 30 40 50 60 70 80 90 100
(C,
S_i)
1477.2
0
1537.
9
749.
9
587.
7
496.
8
48
5
427.9
0
357.1
0
228.8
0
172.
4
133.8
0



2.1.4. Pht hin bng phng php c lng thng tin giu trn min LSB
2.1.4.1. Phng php c lng khi c nh gc
c lng thng tin giu trn LSB da trn l thuyt trng khp sau:
nh l 2.4: Cho X
0
, X
1
l hai i lng ngu nhin c lp nhau, c phn b ln lt
l p0(t), p1(t) khi
P{X
0,i
=X
1,i
} =
s s 1 m t 0
1 0
) t ( p ). t ( p
Sau y l ni dung c th ca phng php.
ng dng nh l 2.4 vo bi ton c lng thng tin nhng trong nh s. Ta cn
xc nh c P
0
(t), P
1
(t). Trong trng hp m=2, tc l t ch nhn mt trong hai gi tr 0
hoc 1. n gin y ta xt ngn ng ca thng tin c nhng l ting Anh. T
[37] thng k trn 10000 k t cc vn bn ting Anh chnh thng, tn s n cc k t
trong vn bn ting Anh t nhin xut hin khng u. Trong k t e xut hin nhiu
nht (chim 12.9%) so vi tng s cc k t xut hin trong vn bn. Cn ch z xut hin
rt t (chim 0.05%). Chuyn cc k t trong mt bn r bt k sang chui nh phn vi
mi k t thnh chui 8 bit, ta thy gi tr trung bnh ch s 0 xut hin trong vn bn
xp x bng E[X=0]=2.4912, em chia cho 8 ( di bit ca mt k t ch ci) ta c
1/8*E[X=0]=0.3114, y chnh l xc sut ch s 0 xut hin trong vn bn ting anh
di dng nh phn tc l P
0
(t=0)=0.3114 v do P
0
(t=1)=1-0.3114 =0.6886. Cn
P
1
(t=0) v P
1
(t=1) trn LSB ca nh gc c c lng bng phng php hp l cc
i cho ta kt qu nh sau: P
1
(t=0)~0.505, P
1
(t=1)~0.495.
Vy xc sut xut hin trng khp vi bit thng tin v bit LSB ca gc l: P
0
(t=0) .
P
1
(t=0) + P
0
(t=1) . P
1
(t=1) = 0.3114 * 0.505 + 0.6886 * 0.495 = 0.498114 ~ 0.5.
Gi s ta c X = x
1
x
2
x
3
.....x
n
l mt chui thng tin bt k vi x
i
e{0,1} i=1,2,...,n v Y
= y
1
y
2
y
3
...y
m
l dy cc bit LSB ca cc im nh ca mt nh gc no (nh 24 bit
mu hoc nh cp xm 8-bit) tc y
i
e{0,1}. Theo c lng trn ta c P{x
i
=y
i
} ~ 0.5, v
di bn thng tin tnh ra bit l n, nn s cc im nh khng b o bit (bitwise) LSB
s xp x l

2
. Nh vy nu ta c lng c s im nh b o bit l bao nhiu th ta
c th c lng xp x c di bn thng tin c giu trong nh.
c lng di thng tin giu trong LSB nh ta thc hin cc kho st sau:
C 2 nh C
1
, C
2
, hai nh ny sau c giu tin vi t l thng tin ln lt bng 12%
v 9 % kch thc hai nh S
1
v S
2
. Thng k tn s cc im nh ca tng cp nh
(C
i
,S
i
) lu vo cc cp vector (C
i
256
, S
i
256
) v tnh hiu |C
i
256
S
i
256
| ta thy rng nu
S
i
j
=C
i
j
tc l khng nhng thng tin, ngha l |S
i
j
- C
i
j
| =0. Ngc li, |S
i
j
-C
i
j
| >0 l do
lng tin uc nhng vo trong C
i
lm cho cc im nh c s thay i. Mi im nh
cng lm ch nhng c 1 bit thng tin do tng cc hiu

=
255
0 j
j
i
j
i
| S C |
chnh l s cc bit
thng tin c nhng. Nu gi n
i
l di s bit ca thng tin c nhng trong
nh gc C
i
th theo nh l 2.4, ta c c lng:
|
j
i
255
0 j
j
i
i
i
S C |
2
n
n ~
=
= ~
=
255
0 j
j
i
j
i i
N | S C | 2
i
n (2.14)
Nu cho trc mt cp nh gc v nh c giu thng tin tng ng, chng ta c th
c lng c di (tnh theo bit) ca bn thng tin c nhng trong nh .
Xt li v d, p dng (2.14) vi cp nh (C
1
, S
1
) trn ta c
=
255
0 j
| S C | 2
j
1
j
1
= 30440. Vy
di thng tin nhng trong S
1
l n
1
~ 30440 chim t l (so vi kch thc ca nh) l
% 74 . 7
393216
30440
~ .

Xt cp nh (C
2
, S
2
) ta c
=
255
0 j
j
2
j
2
| S C | 2 =22348, chim t l nhng l . % 68 . 5
393216
22348
~
Vn t ra y l mt s trng hp trong thc t chng ta khng bit trc nh
gc m ch bit nh quan st no , chng ta phi tm cch xy dng mt nh lm mc
t nh quan st.
2.1.4.2. Phng php c lng khi khng c nh gc
Khi khng c nh gc chng ta cn phi xy dng mt nh lm mc t mt nh
c xt. Theo [95] sau khi giu chui bit thng tin vi t l 100% trn min LSB ca
nh C (xp x 12.5% kch c ca nh), th gi tr tn sut ca cc cp PoV (x
2i
, x
2i+1
) xp
x bng nhau. T a ra tng mt nh bt k vi vector tn s im nh X={x
0
, x
2
,
x
3
, , x
255
}, ta c th c lng vector tn s im nh Y={y
0
, y
1
, , y
255
} vi:
y
2i
= y
2i+1
=
2
x x
1 i 2 i 2 +
+
, i=0,127 (2.15)
Sau ta c th c lng xp x t l thng tin giu trong nh theo cng thc sau:
L=
pq
8pq
100 - ] )
i
y
i
x ( abs
pq
1
[
255
0 i

=
.100 (2.16)
Nu nh c giu tin th gi tr ca |x
i
-y
i
| tin ti 0 v L tin ti 12.5. Trng hp nh l
nh gc th ] )
i
y
i
x ( abs
pxq
1
[
255
0 i

=
*100 tin ti 12.5 v L tin ti 0.
Thc t, nh khi giu thng tin vi t l giu trn 100% LSB ca nh (ng vi 12.5%
kch c nh) khng hon ton lm cho y
2i
=y
2i+1
=(x
2i
+x
2i+1
)/2 theo (2.15), v vy cng thc
(2.16) c thay i vi sai s Ax nh sau:
L=
pq
8pq
100

- ] )
i
y
i
x ( abs
pq
1
[
255
0 i

=
.100-Ax (2.17)
Da vo thc nghim trn mt tp nh ln tc gi thy Ax=3.5 cho kt qu tin cy.
a ra c lng xp x vi t l giu trn min LSB ng vi t l 0%, 10%, 20%,
, 100%. Chng ti thc hin kho st trn mt tp 10 nh chun cng kch c 512512
ti v t [107]. Sau chng ta thc hin giu tin bng k thut giu LSB phng php
ngu nhin trn tp nh ny vi t l giu 0%, 10%, ... 100%. Thc hin c lng cho
tng tp nh ta c gi tr c lng cho trong bng 2.4.
Bng 2.4. c lng xp x thng tin giu trn LSB vi tp 10 nh chun
Lng tin
giu (%)
0 10 20 30 40 50 60 70 80 90 100
T l c
lng xp
x
0 0.07 0.23 0.47 0.8 1.49 1.9 2.69 4.03 5.73 6.68
T chng ti xy dng c phng trnh bc hai c lng xp x t bng d liu
trn nh sau: -3.54x
2
+ 38.64x=y (2.18)
Do , ng vi mi gi tr L tm c t (2.17) ca nh ta thay x=L vo phng trnh
(2.18) ta s nhn c y tng ng chnh l lng thng tin xp x giu vo nh.
Vy p dng (2.18) cho bng 2.4 ta c gi tr xp x mi theo bng 2.5. nh gi
gi tr c lng xp x i vi mi nh ng vi t l nhng p chng ta tnh tr trung bnh
(p) v lch chun s(p) cho mi p trn 10 nh
Bng 2.5. Kt qu c lng xp x theo (2.18) trn tp 10 nh chun
Lng
tin giu
(%)
0 10 20 30 40 50 60 70 80 90 100
T l
c
lng
xp
x
(p) 0
2.6
8
8.9
4
17.5
9
28.8
4
49.9
3
60.6
4
78.3
3
98.2
6
100.0
2
100.0
7
s(p) 0
0.0
7
0.2
4
0.48 0.81 1.49 1.90 2.69 4.03 5.73 6.68
2.2. K THUT PHT HIN M TRN LSB CA MIN TN S
2.2.1. Phn tch k thut giu LSB trn min tn s
Giu tin trn min tn s cosine hay wavelet l hnh thc giu tin trn LSB ca cc h
s cosine trn min tn s gia nh cc k thut [23, 69, 70, 94, 104] hay trn cc bng
tn cao LH, HL, HH nh cc k thut [42, 73, 91]. Theo nhn nh ca cc nh giu tin
phng php giu trn cc h s ny khng lm nh hng n cht lng nh.
Theo Provos v cc cng s, k thut giu thng tin trn LSB ca cc h s cosine
cng gy ra cn bng cc cp PoV ca h s cosine [71]. Do nhm tc gi p dng
phng php thng k _
2
vi n bc t do cho cc cp PoV ca h s cosine , (-8, -7), (-
6,-5), (-4, -3), (-2, -1), (2, 3), (4, 5), (6, 7) khng kim tra trn cp (0, 1) v cp ny t
s dng trong giu tin [104].
Lun n thy rng phng php thng k ny cng c th p dng tng t cho pht
hin nh c giu tin trn min tn s wavelet, v n cng lm cn bng cc cp PoV trn
cc h s wavelet.
Ngoi ra lun n a ra mt phng php khc pht hin m cho nh c giu tin trn
LSB ca cc h s cosine cho kt qu tt hn trnh by trong mc sau.

2.2.2. Phng php pht hin
p dng biu thc (2.11) c xy dng t m rng b Neyman Pearson trong
2.1.3 cho min tn s cosine ta c thut ton di y. Trong trng hp khng c nh
gc so snh chng ta phi xy dng mt nh lm mc bng cch coi nh nh c
giu tin vi t l giu 100% tng s cc h s cosine c th giu ca nh.
Thut ton p dng cho nh giu tin trn LSB ca min tn s DCT
u vo: Cho mt tp nh JPEG bt k (gm c giu tin trn h s cosine v nh gc)
u ra: Phn loi tp thnh hai tp: nh c giu trn tin v nh khng giu tin trn
LSB ca h s cosine.
Cc bc thc hin
Bc 1: Chn nh I trong tp nh u vo, thc hin cc bc 2 v 3 cho n khi xt ht
cc nh u vo.
Bc 2: Thng k tn s cc h s DCT ca nh I (b qua cc h s 0 v 1) vo ma trn
X
n
= {x
i
, i=1, 2, ..., n} (gi tr n c xc nh t s cc h s (tr h s 0 v 1)
c tn s ln hn 0) vi x
i
l tn s ca h s cosine c gi tr i. Thc hin tnh P
j
0

vi P
2j
0
= P
2j+1
0
=
x
2j
+x
2j +1
2
(0<j<
n
2
).
p dng cng thc (2.11) ta c: T = 2x
i
ln
x
i
(pq)P
i
0
n
i=0
.

Bc 3: Chn t
0
= 500 (theo tp mu th nghim trn 1200 nh). Nu T > t
0
th I lu
vo tp nh gc, ngc li I lu vo tp nh c giu tin trn LSB ca h s cosine.
2.3. KT QU TH NGHIM
2.3.1. Cc kt qu th nghim trn min khng gian
Th nghim trn tp 2088 nh so snh nh gi cc k thut xut ca lun n
vi k thut pht hin khc: _
n
2
[95], LLRT [80], RS [31], DI[102].
2.3.2. Cc kt qu th nghim trn min tn s
KT LUN CHNG 2
Chng ny a ra bn phng php ci tin pht hin m cho nh c giu tin trn
LSB ca min khng gian v mt phng pht pht hin m trn LSB ca min tn s.
Da trn tp th nghim gm 2088 nh so snh k thut ci tin ca lun n vi mt
s k thut pht hin m khc.
Cc kt qu th nghim cho thy cc k thut pht hin do lun n a ra trong
chng ny l tng ng hoc tt hn k thut pht hin khc trong mt s trng
hp.


Chng 3. MT S K THUT PHT HIN C RNG BUC
Chng ny a ra bn k thut pht hin c rng buc cho nh c giu tin s dng k
thut giu tin DIH, IWH, HKC, RVH. Chng u l trng hp ring ca k thut giu
LSB, tuy nhin t l thay i trn LSB ca nh thng thp so vi lng thng tin em
giu (hoc kch c nh), v vy pht hin bng cc k thut pht hin m trn LSB ca
nh thng cho kt qu khng cao. Trong phn ny lun n a ra cc phng php pht
hin ti u hn so vi pht hin m trn LSB cho cc k thut giu DIH, IWH, HKC,
RVH v phng php c lng xp x lng bit thng tin giu trong nh s dng cc k
thut ny.
3.1. PHT HIN NH C GIU TIN S DNG K THUT GIU HKC
3.1.1. Tm lc k thut giu HKC
K thut HKC do J. H. Hwang v cc cng s xut nm 2006 [41], da trn phng
php dch chuyn biu tn sut nh sau: chn im Peak l im c ct tn sut ln
nht trong biu tn sut, sau chn hai im Zero1 v Zero2 (cc im c ct tn
sut c gi tr bng 0) bn tri v bn phi im Peak. Sau thc hin lm rng hai
ct tn sut ti v tr Peak+1 v Peak -1. Thc hin giu thng tin vo nh theo nguyn
tc: gi s cn giu bit b, qut nh theo th t raster nu im nh c gi tr bng Peak - 2
hoc Peak + 2, th kim tra bit b cn nhng: nu bit thng tin l 1 th im nh c gi tr
l Peak - 2 s tng ln 1, hoc im nh c gi tr l Peak + 2 s gim i 1, cn nu bit
thng tin l 0 th vn duy tr nh c (ngm hiu giu vo Peak -2 hoc Peak +2).
Qu trnh giu kt thc khi giu ht cc bit thng tin.
3.1.2. Phng php pht hin v c lng thng tin giu trong nh
3.1.2.1. K thun pht hin ca Kuo v Lin
Nm 2008, W. C. Kuo v Y. H. Lin xut k thut pht hin nh c giu tin s dng
k thut giu HKC [46]. H quan st biu tn s da vo nh Peak trc v sau khi
giu thy hai gi tr ln cn hai bn ca nh peak b tt xung do giu tin nh m t
trong hnh 3.1 (a) v (b), v vy h a ra nh l 3.1 xy dng k thut pht hin di
y.

Hnh 3.1. im Peak: (a) cha giu tin, (b) giu y , (c) giu khng y
nh l 3.1: C nm cp gi tr lin tip (x
1
, y
1
), (x
2
, y
2
), (x
3
, y
3
), (x
4
, y
4
), (x
5
, y
5
) vi (x
3
,
y
3
) l cp gi tr im Peak. T l thay i ca 5 im lin tc v mi quan h lng ging
c nh ngha ln lt nh biu thc (3.1) v (3.2):

3

1
, 0.4
1
0.6 (3.1)

4

2
(3.2)
t
2
l gi tr ngng.
p dng nh l ny, Kuo v Lin a ra thut ton pht hin nh c giu tin s dng
k thut HKC theo cc bc sau:
1. Tm cp gi tr im peak (x
max
, y
max
)
2. Tnh t l thay i v mi quan h lng ging s dng nh l 3.1.
3. Nu nm cp gi tr lin tip ln cn (x
max
, y
max
) tho mn (3.1) v (3.2), th kt lun
nh c giu tin trong vng ny, ngc li nh khng giu tin.
3.1.2.2. Phng php pht hin ci tin t phng php ca Kuo v Lin
Vi k thut pht hin ca Kuo (da trn nh l 3.1) trong mt s trng hp giu tin
ca HKC nghin cu sinh thy khng ph hp khi thng tin khng c giu ht vo v
tr ct tn s ln cn Peak. V d nh hnh 3.1 (a) im peak l 146, sau khi giu tin hai
ct gi tr ln cn peak l 145 v 147 b tt xung, nhng lng bit giu t hn ln ca
2 ct ny cho ln gi tr ca 144 khng bng 145 v gi tr 147 khng bng 148 (xem
hnh 3.1 (c)), theo v d ta c y
1
=1520, y
2
=600, y
3
=3300, y
4
=580, y
5
=1600, kim tra li
biu thc (3.1) v (3.2) ta thy (y
3
-y
2
)/y
3
=0.8182 v (y
3
-y
4
)/y
3
=0.8242 v

2
=1.5333 v

5
4
= 1.7586 khng tha mn (3.1) v (3.2)
c th pht hin mt cch tng qut hn vi k thut ca Kuo v Lin chng ti a
ra nh l 3.2 chnh sa ca Kuo v Lin nh sau:
nh l 3.2: C nm cp gi tr lin tip (x
1
, y
1
), (x
2
, y
2
), (x
3
, y
3
), (x
4
, y
4
), (x
5
, y
5
) trong
(x
3
, y
3
) l cp gi tr im Peak. Khi nh c giu tin s dng k thut giu HKC
nu mi quan h ca nm cp gi tr ny tha mn biu thc (3.1) v (3.2):

3

1
, 0.4
1
< 1 (3.1)

5
<=1 (3.2)
p dng nh l ny vo bi ton pht hin nh giu s dng HKC.
3.1.2.3. Phng php pht hin HKC khc v c lng thng tin
Mt khc chng ta thy c th a ra biu thc n gin hn pht hin nh c giu tin
s dng k thut giu HKC. Da vo phn tch v d: nh gc ban u c biu tn s
nh hnh 3.1 (a) tng hai ct gi tr ln cn (h
144
, h
145
) bn tri v hai ct gi tr ln cn
bn phi (h
147
, h
148
) ca im Peak (h
146
) lun ln hn Peak (tc h
144
+h
145
> h
146
,
h
147
+h
148
> h
146
), trong khi vi biu tn s ca nh c giu tin hnh 3.1 (c) th h
144
+h
145

< h
146
, h
147
+h
148
< h
146
.
Cng da vo mi quan h b thay i ny gia cc vng ln cn h
Peak
chng ta c th
c lng c s bit thng tin giu trong nh da vo h
Peak-1
v h
Peak+1
. Ban u giu
tin chng ta phi dch chuyn h
Peak-1
sang h
Peak-2
, h
Peak+1
sang h
Peak+2
, ngha l lm cho
h
Peak-1
= 0, h
Peak+1
= 0. Sau khi giu tin cc bit 1 ca chui thng tin lm dch chuyn
mt phn h
Peak-2
, h
Peak+2
sang h
Peak-1
, h
Peak+1
(theo thut ton giu HKC) cn cc bit 0
ngm nh c giu vo cc im nh Peak-2 v Peak+2.
Gi L
0
, L
1
l s bit 0 v bit 1 ca chui thng tin M cn giu khi : L
1
= h
Peak-1
+
h
Peak+1
, cn L
0
~ L
1
v chui thng tin M l i lng ngu nhin c phn b i.i.d [61] nn
xc sut bit 0 v xc sut bit 1 xp x bng nhau v bng 0.5 (P(0)~ P(1) =0.5). Vy
di bit thng tin M c giu trong nh s dng HKC c tnh theo biu thc sau: L
= 2L
1
= 2(h
Peak-1
+ h
Peak+1
).
T cc vn phn tch trn chng ta c c nh l 3.3 cho pht hin nh c giu
tin s dng k thut giu HKC.
nh l 3.3 - C nm cp gi tr lin tip (x
1
, y
1
), (x
2
, y
2
), (x
3
, y
3
), (x
4
, y
4
), (x
5
, y
5
) vi
im Peak (im max) l x
3
v y
3
= h
Peak
. Khi nh c giu tin bng HKC nu tha
mn mi quan h sau:
y
1
+ y
2
< y
3
(3. 3)
y
4
+ y
5
< y
3
(3. 4)
v lng bit thng tin giu c tnh bng biu thc:
L =2(y
2
+y
4
) (3.5)
p dng nh l 3.3 chng ta c th pht hin v c lng s bit thng tin cho nh c
giu tin bng k thut HKC.
3.1.3. Cc kt qu th nghim
3.1.3.1. Th nghim: th nghim v nh gi trn tp 2088 nh, so snh pht hin gia
cc k thut ca Kuo v Lin, ca Kuo v Lin c ci tin, k thut xut.
3.1.3.2. Nhn xt
3.2. PHT HIN NH C GIU TIN S DNG K THUT GIU DIH
3.2.1. Tm lc k thut giu tin DIH
K thut giu thun nghch da trn biu gi tr sai phn DIH (Difference Image
Histogram) do nhm tc gi Lee v cc cng s xut nm 2004 [82]. Ban u nhm
tc gi tnh cc gi tr sai phn ca cc im nh theo cng thc d(i,j)=I(i+1,j)-I(i,j) v
tnh biu tn s cho cc gi tr sai phn ny. H thy rng cc gi tr tn s tp trung
phn ln vo cc h s sai phn c gi tr -2, -1, 0, 1, 2 do c th giu thng tin da
vo cc gi tr ny. giu c th khi phc nh gc, h s phi dch chuyn cc ct tn
s c gi tr sai phn ln hn 1 v nh hn -1 lm rng cc ct tn s c gi tr bng 2
v -2. Sau chui bit thng tin s c giu vo cc im nh m gi tr sai phn ca n
c gi tr l 1 hoc -1, nu bit thng tin giu l 1 th h s sai phn nu l 1 chuyn thnh
2, nu l -1 chuyn thnh -2, ngc li gi nguyn.
3.2.2. Phng php pht hin nh c giu tin s dng k thut giu DIH
3.2.2.1. Phn tch k thut giu DI H
Theo qu trnh giu tin trong phn 3.2.1 chng ta thy rng k thut giu DIH ch giu
c mt lng tin rt thp, kh nng giu ph thuc vo tn sut ca h s sai phn
bng 1 v -1. V d ta c Lena.bmp kch c 512512 im nh th kh nng giu s bit
ln nht ca nh l L = h
-1
+ h
1
= 19877 (tng ng vi t l giu ln nht R
max
=7.58).
T l giu ny ch lm thay i rt nh ni dung nh gc.
Chng ta s dng mt s phng php pht hin m trn LSB trong chng 2 pht
hin nh c giu tin bng k thut giu DIH nh sau: s dng tp nh
0_1
gm 600 nh
(ly ra t tp nh gc
0
) cng giu thng tin l d liu nh nh phn kch c 12856
im nh (tng ng vi chui 7168 bit) c tp nh
DIH_7168
. Sau s dng mt s
k thut pht hin m trn LSB cho tp nh
DIH_7168
c kt qu pht hin trong bng
3.1.
Bng 3.1. Phn loi nh trn tp
DIH_7168
s dng k thut pht hin m trn LSB


lch
chun

_
1
2
T
l
xm

_
n
2

[95]
LLR
T
[80]
nh
gc
462 5
8
2
406 595 297
nh
c
giu
tin
138 1
8
194 5 303
kim tra bng phng php c lng thng tin giu trn LSB ca nh, lun n s
dng nh Lena.bmp giu mt lng thng tin l d liu nh nh phn kch c 12856
pixel (tng ng vi chui 7168 bit) c t l 2.73 % min LSB ca nh c nh
giu tin Lena_stego.bmp. S dng k thut c lng RS, DI, Trng khp ta c kt
qu c lng trong bng 3.2.
Bng 3.2. c lng thng tin giu cho nh Lena.bmp v nh Lena_stego.bmp

RS [31]
DI
[102]
trng
khp
Lena.bmp R =
0.15137
%
R =
12 %
R =
0.037 %
Lena_Stego.bmp R =
6.359 %
R = 9
%
R = 3 %
T hai bng kim tra 3.1 v 3.2 c th thy rng a s k thut pht hin m trn LSB
ch pht hin tt vi t l giu cao cn trong trng hp ny t l giu so vi kch c ca
nh l qu nh (7168 bit ch bng t 2 n 3% min LSB ca nh). V vy da vo phn
tch c trng ca tp nh gc v nh sau khi giu tin s dng k thut giu DIH lun n
ny a ra phng php pht hin ti u hn v c th c lng thng tin giu trong
nh trong mc tip theo.
3.2.2.2. Phng php pht hin v c lng thng tin
Bng phng php phn tch biu tn s sai phn ca nh trc v sau khi giu tin
chng ta c th pht hin v c lng c xp x nh c giu tin s dng DIH nh sau:
khi nhng mt thng tin ging nhau vo mt tp nh gc s dng k thut DIH nhn
c mt tp nh stego c giu tin. Thc hin tnh ton li biu tn s sai phn trn
tng cp nh (gc, c giu tin) chng ta d dng nhn thy DIH thay i tnh cht t
nhin ca cc gi tr sai phn.
Hay mi quan h ca cc h
i
nh sau trong nh gc: h
1
+ h
1
> h
2
+ h
2
>

h
3
+ h
3
>
> h
10
+ h
10
>
Cn i vi nh c giu tin, th: h
1
+ h
1
> h
2
+ h
2
, h
2
+ h
2
h
3
+ h
3.

S thay i ny l do DIH to ra, n thay i tn s h
2
ca nh giu thng tin. y
chnh l vn mu cht pht hin nh stego, chng ta a ra biu thc pht hin sau:
SO =
nh O c giu tin nu (h
2
+ h
2
)/(h
3
+ h
3
)
nh O khng giu tin nu ngc li



Vi T l ngng phn loi.
Ngoi ra chng ta c th c lng xp x thng tin giu da vo h
2
. V thng tin
em giu l mt chui bit c phn b c lp nn xc sut s bit 0 xut hin trong chui
thng tin xp x bng xc xut s bit 1 trong chui v bng 0.5 (p(0) = p(1) = 0.5). V vy
chui thng tin s c giu trong h
1
v phn cn li c giu trong h
2
, do
di xp x ca thng tin c tnh nh sau: L= 2*(h
-2
+ h
2
)
3.2.3. Cc kt qu th nghim
3.2.3.1. Th nghim: th nghim v nh gi trn tp 2088 nh
3.2.3.2. Nhn xt



3.3. PHT HIN NH C GIU TIN S DNG K THUT GIU IWH
3.3.1. Tm lc k thut giu tin IWH
Cng xut pht t yu cu khi phc xp x nh gc sau khi tch thng tin, vo nm
2006 Xuan v cc cng s xut k thut giu IWH (Integer Wavelet Histogram) [99].
K thut ny c tng gn ging k thut giu tin DIH, tuy nhin khc ch thay v
dch chuyn cc ct tn s gi tr sai phn th h s dng phng php dch chuyn tn s
ca cc h s bin i wavelet nguyn. Ban u h thc hin php bin i Wavelet cho
min d liu nh theo chun bin i trong k thut nn JPEG2000 c bn bng tn
(LL, LH, HL, HH). H thc hin nhng thng tin vo ba bng tn cao LH, HL, HH ni
c cho l t nh hng n nh gc. Tnh tn s ca cc h s IWT, cc ct tn s c
gi tr ln hn Z (Z l mt s nguyn chn ty ) s b dch chuyn sang phi, mc ch
lm rng ct tn s c gi tr Z, thng tin c giu vo h s c gi tr Z-1 v Z. Nu
trong trng hp s bit cn giu ln hn s h s wavelet c gi tr Z-1, th thc hin tip
giu thng tin sang h s c gi tr -(Z+1) gi tr i xng qua h s 0, vic thc hin giu
tng t, ban u chng ta phi lm rng ct tn s -Z, sau giu thng tin vo cc h
s c gi tr l -(Z-1) v Z. Nu vn cn bit thng tin tip tc giu vo h s Z-2, cho n
khi giu xong thng tin. Gi s vic giu dng li h s c gi tr bng S v h s bt
u giu tin l T.
3.3.2. Phng php pht hin nh c giu tin s dng k thut giu IWH
3.3.2.1. Phn tch k thut giu I WH
Vi k thut giu IWH chng ta thy kh pht hin tin cy bng cc phng php pht
hin hay c lng bng k thut trng khp nh nu trong 3.2. V vy chng ta phi
da vo phn tch biu tn s cc h s wavelet ca nh trc v sau khi giu tin.
3.3.2.2. Phng php pht hin v c lng thng tin
tn cng v c lng thng tin giu s dng k thut IWH, u tin tc gi a ra
mt s phn tch trong qu trnh giu tin da trn 3 th nghim:
Trong th nghim th nht, chng ti s dng nh Lena (kch thc 512 x 512 im
nh) v thng tin giu l mt nh Logo nh phn (128x56 pixel) (ng vi 7168 bit). Tnh
tn s ca cc gi tr wavelet trong 3 min bng tn cao (LH, HL,HH). Nhng thng tin
bng phng php IWH vi Peak chn khi im l T=2, nhn c im dng S=-2.
Th nghim th hai, cng chn nh Lena v thng tin nh Logo nh th nghim th
nht, nhng nhng thng tin chn T=4, nhn c im dng S=3.
Th nghim th ba, s dng u vo tng t nh th nghim th nht nhng chn
T=6 v nhn c S=-5.
So snh s khc bit gia biu tn s cc h s wavelet ca nh gc v nh c giu
tin, thy rng trong mt nh in hnh th h
0
>h
1
> h
2
> h
3
> v h
0
>h
-1
> h
-2
> h
-3
> vi
h
i
l s h s IW c gi tr bng i. Trong khi vi nh stego trong th nghim 1 ta thy
h
4
>h
3
, h
3
~ h
2
, h
-4
> h
-3
, h
-3
< h
-2
., trong th nghim th hai c h
5
~ h
6
, h
-5
~ h
-4
, h
4
< h
3
, h
4

<h
5
, trong th nghim th ba h
7
~ h
8
, h
5
~ h
6
, h
-7
~ h
-8
, h
-5
~ h
-6
.
Phn tch chi tit cc vn trn trnh by trong ton vn.
T cc vn phn tch trn, lun n a ra thut ton tng qut c lng di
thng tin nh sau:
1. Khi to di thng tin L=0, qut ton b tn s vi tng gi tr i (i>0, is max (cc
h s wavelet nguyn ca cc bng tn cao)), nu gp gi tr u tin (h
i
+h
i+1
)/2 < h
i+2
,
dng qut, t Peak =i l v tr u tin c lng.
2. Nu h
Peak
~ h
Peak+1
, L=L+h
Peak
+h
peak+1
; t Peak =-Peak v thc hin tip bc 3.
Ngc li thc hin bc 4.
3. Nu h
Peak
~ h
Peak+1
, L=L+h
Peak
+h
peak+1
; t Peak = -Peak 1 v quay li bc 2.
Ngc li quay li bc 4.
4. Nu h
Peak+1
< h
Peak+2
v h
Peak+1
< h
Peak
th L= L + 2 * h
Peak+1
. Qu trnh giu kt thc
y.
3.3.3. Cc kt qu th nghim
3.3.3.1. Th nghim: th nghim v nh gi trn tp 2088 nh
3.3.3.2. Nhn xt
3.4. PHT HIN NH C GIU TIN S DNG K THUT GIU RVH
3.4.1. Tm lc k thut giu tin RVH
Giu tin ngang dc hay cn gi l k thut RVH (Reversible Vertical Horizontal
Technique) do P.Mohan Kumar v K.L.Shunmuganathan xut vo thng 3 nm 2010
[45]. K thut giu ny s dng chin lc giu nhiu ln nhm nng cao cht lng nh
v dung lng giu.
Qu trnh giu tin s chia ra lm 2 giai on: Giai on mt gi l giu theo chiu
ngang HEm (horizontal embedding proceduce) v giai on hai gi l giu theo chiu dc
VEm (Vertical embedding procedure). Chui bit thng tin M vi di l L
M
c chia
lm 2 chui con M
1
v M
2
di ln lt l L
M1
v L
M2
. To ra chui thng tin B
1
bng
cch ghp hai chui l chui bit S
1
v chui bit ph A
1
, ngha l l B
1
=S
1
||A
1
. Tng t,
B
2
=S
2
||A
2
. Chui A
1
v A
2
s c gii thiu pha sau. u tin, cc bit thng tin B
1
s
nhng theo chiu ngang vo O bng th tc HEm, cho nh ra T. Tip theo bn nh v
cc cp im nh c s dng giu tin c nn nh phn thnh CM
1
c chiu di l
LC
1
, CM
1
c nhng bng k thut thay th LSB tun t vo LC
1
bit LSB u tin ca
nh T to ra nh U, LC
1
bit LSB ca nh T trc khi nhng CM
1
c lu vo A
1
khi
phc sau ny. Tip theo chui bit thng tin B
2
c nhng theo chiu dc vo U bng
cch s dng th tc VEm cho ra nh kt qu V. Bn nh v v tr cc cp im
nh c th s dng giu tin c nn li thnh CM
2
c chiu di LC
2
, CM
2
c nhng
bng k thut thay th LSB tun t vo LC
2
bit LSB u tin ca V to ra nh stego X.
LC
1
bit LSB ca nh V trc khi nhng CM
2
s c lu vo A
2
.
3.4.2. Phng php pht hin v c lng thng tin
3.4.2.1. Phn tch vn giu tin RVH
Sau khi nhng mt chui thng tin M vi dung lng ln (t l khong 90% kh nng
nhng ln nht ca nh) vo nh cp xm cover_Baboon.bmp kch c 512x512 s dng
k thut giu RVH ta c nh stego_Baboon.bmp. Tnh tn s im nh ca hai nh
(cover_Baboon.bmp v stego_Baboon.bmp) chng ta khng nhn thy du hiu khc
bit g, tuy nhin khi tnh tn s ring bit trn cc ct chn, cc ct l s thy s khc
bit r rt trn biu tn s ca chng, gi tr ca ct tn s chn s chnh lch rt ln
so vi ct tn s l.
3.4.2.2. Phng php pht hin v c lng thng tin
Theo th tc nhng ngang HEm, t nh gc O, cc pixel ca nh O c nhm theo
hng ngang thnh cc cp (x, y), cc cp ny c phn hoch vo hai tp E
1
v E
1

, tp
E
1
bao gm cc cp pixel (x,y) c th nhng ngang, ngha l y c gi tr l, trong khi E
1

l
tp cha cc cp (x,y) khng th nhng ngang, y c gi tr chn. Sau khi giu B
1
th ta
thy tn s ca s bit 0 v bit 1 ca cc LSB trn cc ct pixel y c s chnh lch kh r,
trong khi vi nh cha giu tin th tn s ca hai bit ny xp x nhau.
i vi th tc nhng dc VEm, qut nh U theo chiu dc vi th t qut t trn
xung di, t tri sang phi nhm cc cp im nh (u,v), chng ta phn loi nh vo
hai tp E
2
v E
2

, tp E
2
gm cc cp im nh c th s dng nhng dc, ngha l v c
gi tr chn, tp E
2

gm cc cp im nh khng th s dng nhng dc. Sau khi giu B

2

th tn s ca s bit 0 v bit 1 ca cc LSB trn cc hng v khc nhau rt r khi lng
thng tin giu ln.
T vn chng ta xy dng c biu thc tnh xc sut ca bit 0 v bit 1 trn cc
ct (3.6) hoc trn cc hng (3.7) ca ma trn im nh c xt:
P
LSB_H
(b) =
P
RH
(0.5 P

E1
+ P

E1
) + P
RH
0.5 nu b = 0
P
RH
(0.5 P

E1
) + P
RH
0.5 nu b = 1

(3.6)
P
LSB_V
(b) =
P
RV
(0.5 P

E2
) + P
RV
0.5 nu b = 0
P
RV
(0.5 P

E2
+P

E2
) + P
RV
0.5 nu b = 1

(3.7)
Vi nh gc th P
LSB_even_H
(0) v P
LSB_even_H
(1) trn cc ct chn l xp x nhau, nhng
vi nh c giu tin bng RVH th chng chnh lch nhau.
Da vo vn khc bit tm ra trn, lun n a ra biu thc (3.8) c th s dng
phn bit nh c giu tin s dng k thut giu RVH vi mt nh t nhin.
WX =
ng nu P
LSB
0 P
LSB
1 > T
Sai nu ngc li

(3.8)
T biu thc (3.8), mt nh bt k b nghi ng l nh c giu tin s dng k thut giu
s dng k thut giu RVH nu gi tr ca P
LSB
0 P
LSB
1 > , (0 T 1) trn cc
ct l (hoc ct chn) hoc cc hng chn (hoc hng l). Ngng T c s dng
iu khin ngng quyt nh nh ang xt l nh c giu tin s dng k thut RVH hay
khng. Gi tr ca T ty thuc vo tng ng dng c th. Trong phn thc nghim cho
thy vi T=0.035 cho kt qu phn loi rt tt.
Da vo s thay i chnh lch gia xc xut ca bit 0 v bit 1 theo cc hng chn
trong ma trn d liu nh ta c th c lng sp x thng tin giu trong nh: L=2*L
H
=
4* |P
LSB_H
(0) P
LSB_H
(1)| * m/2 *n
3.4.3. Cc kt qu th nghim
3.4.3.1. Th nghim: th nghim v nh gi trn tp 2088 nh
3.4.3.2. Nhn xt
KT LUN CHNG 3
Cc phng php giu tin HKC, DIH, IWH, RVH l cc trng hp ring ca k thut
giu LSB, n lm thay i rt t trn LSB ca min khng gian hay min bin i. Do
vy nu s dng mt s phng php pht hin m trong chng 2 cho kt qu phn loi
khng cao, cn nu dng k thut pht hin m bng phng php c lng c th pht
hin ra nh nhng khng th c lng chnh xc bit thng tin giu m n ch c
lng c s bit tng ng thay i trn LSB ca nh.
Chng ny a ra phng php pht hin ti u cho tng k thut giu bit
(HKC, DIH, IWH, RVH) v c th c lng xp x thng tin giu trong nh s dng cc
k thut giu ny.

KT LUN CHUNG
Pht hin nh c giu tin ang l bi ton cp thit hin nay trong lnh vc an ton bo
mt thng tin ni chung, lnh vc an ninh, chnh tr v quc phng ni ring. Pht hin
nh c giu tin i hi phi c nghin cu mt cch ton din t cc vn ca bi
ton giu tin trong nh.
Cc phng php tin hnh nghin cu, l thuyt v cc kt qu thc nghim c
trnh by trong hai chng chnh l chng 2 v 3. Cc kt qu chnh ca lun n bm
st vo mc tiu ra bao gm:
1/. xut bn k thut pht hin m cho nh c giu tin trn LSB ca min khng
gian bng: phng php phn tch lch chun (cng b trn cng trnh s 1), thng k
_
2
mt bc t do (cng b trn cng trnh s 3), phn tch t l xm (cng b trn cng
trnh s 2), phng php c lng thng tin giu trn LSB ca min khng gian nh s
dng l thuyt trng khp (cng b trn cng trnh s 4).
2/. xut mt k thut pht hin m cho nh c giu tin trn LSB ca min tn s
wavelet hoc cosine bng phn tch t l xm gia nh bt k v nh c dng ln lm
mc (cng b trn cng trnh s 2).
3/. xut bn k thut pht hin c rng buc cho nh c giu tin s dng k thut
giu bit trc nh:
- K thut giu HKC, trong ci tin k thut pht hin HKC ca Wen Chung
Kuo (giu da trn dch chuyn biu tn sut). ng thi xut mt phng
php hin khc v c th c lng thng tin giu, k thut ny n gin v hiu
qu hn k thut pht hin ca Wen Chung Kuo (cng b trn cng trnh s 7).
- K thut giu DIH (k thut giu thng tin da trn dch chuyn biu tn sut
cc h s sai phn ca cc im nh) (cng b trn cng trnh s 5)
- K thut giu IWH (k thut giu thng tin da trn cc h s wavelet nguyn)
(cng b trn cng trnh s 5)
- K thut giu RVH (giu hai pha ngang dc) (cng b trn cng trnh s 6).
Vi mt s phng php pht hin m trn LSB ca min khng gian nh, chng ta
khng cn bit r phng php giu l phng php no, m ch bit n lm thay i
tnh t nhin trn LSB ca min khng gian (hoc min tn s) khi cha giu tin. Cn vi
cc k thut pht hin c rng buc cho nh c giu tin s dng k thut giu bit trc,
lun n a phng php pht hin ti u hn (so vi pht hin m) v c th c
lng xp x thng tin giu trong nh.

References
Ting Vit
[1]. Phan nh Diu (2002), L thuyt mt m v an ton thng tin, NXB i hc Quc
gia H Ni.
[2]. Dng Anh c, Dng Minh c (2004), Nng cao hiu qu k thut n thng
tin trong nh s, K yu hi tho Quc gia - Mt s vn chn lc ca Cng
ngh thng tin v Truyn thng ln th VII, Nng, tr. 100 - 107.
[3]. Nguyn Xun Huy, Trn Quc Dng (2003), Mt thut ton thy vn s trn min
bin i Cosine ri rc, K yu hi tho Quc gia - Mt s vn chn lc ca
Cng ngh thng tin v Truyn thn ln th VI, i hc Thi Nguyn.
[4]. Nguyn Xun Huy, Bi Th Hng, Trn Quc Dng (2004), K thut thy vn s
trong ng dng pht hin xuyn tc nh, K yu hi tho Quc gia - Mt s vn
chn lc ca Cng ngh thng tin v Truyn thng ln th VII, i hc Nng, tr.
183 187.
[5]. Bi Th Hng, Nguyn Vn To (2006), K thut thu vn s dng php bin i
sng nh ri rc v ma trn s gi ngu nhin, Hi ngh Khoa hc k nim 30 nm
Vin Cng ngh thng tin.
[6]. Trn Hng Ngc, Trng Th M Trang (2004), Cc k thut giu tin da trn
php bin i wavelet v ng dng, K yu hi tho Quc gia - Mt s vn
chn lc ca Cng ngh thng tin v Truyn thng ln th VII, i hc Nng, tr.
183 187.
[7]. Nguyn Vn To, Bi Th Hng (2006), Nng cao cht lng nh trong k thut
thu vn s dng min tn s gia ca php bin i DCT, Tp ch Tin hc v
iu khin hc, tp 4.
[8]. H Th Hng Thm, H Vn Canh, Trnh Nht Tin (2009), Pht hin nh c
giu tin bng phng php phn tch lch chun, K yu hi tho Quc gia -
Mt s vn chn lc ca Cng ngh thng tin v Truyn thng, ln th XI, Hu,
tr. 284 - 291.
[9]. H Th Hng Thm, H Vn Canh, Trnh Nht Tin (2010), c lng xp x
thng ip giu trn min LSB ca nh, K yu hi tho Quc gia - Mt s vn
chn lc ca Cng ngh thng tin v Truyn thng, ln th XII, ng Nai, tr.
488 495.
[10]. H Th Hng Thm, H Vn Canh, Trnh Nht Tin (2010), Pht hin nh giu
tin s dng k thut giu thun nghch da trn dch chuyn histogram, Tp ch
Khoa hc HQGHN, Khoa hc T nhin & Cng ngh, tp 26 (4), tr. 261-267.
[11]. Nguyn Quc Trung (2001), X l tn hiu v lc s, Nh xut bn Khoa hc v
k thut.
Ting Anh
[12]. I. Avcibas, N.Memon, and B. Sankur (2002), Image steganalysis with binary
similarity measures, In Processing of ICIP 2002.
[13]. Mohammad Awrangjeb (2003), An Overview of Reversible Data Hiding, ICCIT
2003, 19-21 Dec, Jahangirnagar University, Bangladesh, pp. 75-79.
[14]. L. Bin, F. Yanmei, H. Jiwu, (2008), Steganalysis of Multiple-Base Notational
System Steganography, IEEE Signal Processing Letters, vol. 15, pp. 493 - 496.
[15]. C. Cachin (1998), An information theoretic model for steganography, In D.
Aucsmith, editor, Information Hiding, 2
nd
International Workshop, volume 1525 of
LNCS, Springer Verlag, New York, pp. 306 318.
[16]. C.K. Chan, L.M. Cheng (2001), Improved hiding data in images by optimal
moderately-significant-bit replacement, IEEE Electronics Letters, Vol. 37 (16),
pp. 10171018.
[17]. C.K. Chan, L.M. Cheng (2004), Hiding data in images by simple LSB
substitution, Pattern Recognition 37, pp. 469474.
[18]. R. Chandramouli, M. Kharrazi and N. Memon (2004), Image Steganography and
Steganalysis: Concepts and Practice, international workshop on digital
watermarking, No. 2, COREE, REPUBLIQUE DE , vol. 2939, pp. 35-49.
[19]. C.C. Chang, J.Y. Hsiao, C.S. Chan (2003), Finding optimal least-significant-bit
substitution in image hiding by dynamic programming strategy, Pattern
Recognition 36, pp. 15831595.
[20]. Carpenter, B. (2002), Compression via Arithmetic Coding,
http://www.colloquial.com/ArithmeticCoding/
[21]. M.U. Celik, G. Sharma, A.M. Tekalp., and E. Saber (2002), Reversible Data
Hiding, In Proc. of International Conference on Image Processing, Rochester, NY,
USA, Vol. 2, pp. 157-160.
[22]. Abbas Cheddad (2009), Steganoflage: A New Image Steganography Algorithm,
Ph. D Thesis, University of Ulster,
(http://www.infm.ulst.ac.uk/~abbasc/Research.php).
[23]. B. Chen and G. Wornell (2001), Quantization index modulation: A class of
provably good methods for digital watermarking and information embedding,
IEEE Trans. Info. Theary, Vol. 47 (4), pp. 1423-1443.
[24]. Yeh-Shun Chen, Ran-Zan Wang, Yeuan-Kuen Lee, Shih-Yu Huang (2008),
Steganalysis of reversible contrast mapping water marking, Proceedings of the
world congress on Engineering 2008, Vol I, WCE2008, London, U.K., pp. 555-
557.
[25]. D. Coltuc and J. M. Chassery (2007), Very fast watermarking by reversible
contrast mapping, IEEE Signal Processing Lett., vol. 14 (4), pp. 255 258.
[26]. J. K I. Cox, J. Kilian, T. Leighton, and T. Shamoon (1997), Secure spread
spectrum watermarking for multimedia, IEEE Trans. on Image Processing,
6(12):16731687.
[27]. Ingemar Cox, Jeffrey Bloom, Matthew Miller, Ton Kalker, Jessica Fridrich
(2008), Digital Watermarking and Steganography, Second Edition, Morgan
Kaufmann Press, USA.
[28]. O. Dabeer, K. Sullivan, U. Madow, S. Chandrasekaran and B. S. Manjunath
(2003), Detection of hiding in the least signicant bit, In Proc. Conference on
Information Sciences and Systems (CISS).
[29]. O. Dabeer, K. Sullivan, U. Madhow, S. Chandrasekaran and B.S. Manjunath
(2004), Detection of Hiding in the Least Signicant Bit, In IEEE Transactions
on Signal Processing, Supplement on Secure Media I, vol. 52, no. 10, pp. 3046
3058.
[30]. S. Dumitrescu, X. Wu, and Z. Wang (2003), Detection of LSB steganography via
sample pair analysis, IEEE Trans. On Signal Processing 2003, 51(7), pp. 1995-
2007.
[31]. Fridrich, J., Goljan, M., and Du, R. (2001), Reliable Detection of LSB
Steganography in Grayscale and Color Images, Proc. of ACM: Special Session on
Multimedia Security and Watermarking, Ottawa, Canada, pp. 2730.
[32]. Jessica Fridrich (2009), Steganography in digital media: principles, algorithms,
and applications, Cambridge University Press.
[33]. Jessica Fridrich, Miroslav Goljan, Dorin Hogea (2006), Steganalysis of JPEG
Images: Breaking the F5 Algorithm, Pattern Recognition, ICPR 2006 18
th

International Conference, Volume 2, pp. 267 270.
[34]. J. Fridrich, M. Goljan, and D. Soukal (2003), Higher-order statistical steganalysis
of palette images, in Security and Watermarking of Multimedia Contents, Proc.
SPIE 5020, pp. 178190.
[35]. J. Fridrich, M. Goljan, and D. Rui (2002), Lossless Data Embedding for all
Image Formats, In Proc. SPIE Photonics West, Electronic Imaging, Security and
Watermarking of Multimedia Contents, San Jose, California, USA, Vol. 4675, pp.
572-583.
[36]. J. Fridrich, M. Goljan and D. Hogea (2002), Attacking the OutGuess, Proc. of
the ACM Workshop on Multimedia and Security 2002, Juan-les-Pins, France.

[37]. Caxton Foster (1982), Cryptanalysis for Microcomputers, Rochelle Park, NJ,
Hayden Book Co.
[38]. S. P. Hivrale, S. D. Sawarkar, Vijay Bhosale, and Seema Koregaonkar (2008),
Statistical Method for Hiding Detection in LSB of Digital Images: An
Overview, Proceedings of World Academy of Science, Engineering and
Technology, Volume 32, ISSN 2070 3740, pp. 658 661.
[39]. C. W. Honsinger, P. Jones, M. Rabbani, and J. C. Stoffel (1999), Lossless
recovery of an original image containing embedded data, US Patent application,
Docket no: 77102/E-D.
[40]. P.G. Howard, F. Kossentini, B. Martins, S. Forchhammer, W. J. Rucklidge (1998),
The emerging JBIG2 standard, IEEE Transactions on Circuits and Systems for
Video Technology, Vol. 8 (7), pp. 838-848.
[41]. J.H. Hwang, J. W. Kim, and J. U. Choi (2006), A Reversible Watermarking
Based on Histogram Shifting, IWDW 2006, pp. 384-361.
[42]. Takayuki Ishida, Kazumi Yamawaki, Hideki Noda, Michiharu (2009),
Performance improvement of JPEG2000 steganography using QIM, Journal of
Communication and Computer, Volume 6 (1), USA.
[43]. A. K. Jain (1989), Fundamentals of Digital Image Processing, Prentice Hall.
[44]. Makhoul, John; Francis Kubala; Richard Schwartz; Ralph Weischedel (1999),
Performance measures for information extraction, Proceedings of DARPA
Broadcast News Workshop, Herndon, VA.
[45]. P. M. Kumar, K. L. Shunmuganathan (2010), A reversible high embedding
capacity data hiding technique for hiding secret data in images, International
Journal of Computer Science and Information Security (IJCSIS), Vol.7 (3), pp.
109-115.
[46]. Wen-Chung Kuo, Yan-Hung Lin (2008), On the Security of Reversible Data
Hiding Based-on Histogram Shift, ICICIC 2008, pp. 174-177.
[47]. Lehmann E. (1959), Testing Statistical Hypothesis, John Wiley, New York.
[48]. Chih-Chiang Leea, Hsien-ChuWub, Chwei-Shyong Tsaic, Yen-Ping Chu, (2008),
Adaptive lossless steganographic schemewith centralized difference expansion,
Pattern Recognition 41, pp. 2097 2106.
[49]. Sang-Kwang Lee, Young-Ho Suh, and Yo-Sung Ho (2004), Lossless Data Hiding
Based on Histogram Modification of Difference Images, Advances in Multimedia
Information Processing - PCM 2004, pp. 340-347.
[50]. Xiaolong Li, Bin Yang, Daofang Cheng and Tieyong Zeng (2009), A
Generalization of LSB Matching, IEEE signal processing letters, Vol. 16 (2), pp.
69 72.
[51]. W.N. Lie, L.C. Chang (1999), Data hiding in images with adaptive numbers of
least significant bits based on the human visual system, in: Proceedings of IEEE
International Conference on Image Processing, Taipei, Taiwan, vol. 1, pp. 286
290.
[52]. Chia-Chen Lin, Wei-Liang Tai, Chin-Chen Chang (2008), Multilevel reversible
data hiding based on histogram modification of difference images, Pattern
Recognition 41, Science Direct Journal, pp. 3582-3591.
[53]. Ching-Chiuan Lin, Nien-Lin Hsueh (2008), Alossless data hiding scheme based
on three-pixel block differences, Pattern Recognition 41, pp. 1415 1425.
[54]. S. H. Liu, T. H. Chen, H. X. Yao and W. Gao (2004), A variable depth LSB data
hiding technique in images, Machine Learning and Cybernetics 2004, pp. 3990-
3994.
[55]. Z. M. Lu, J. S. Pan, and S. H. Sun (2000), VQ-based digital image watermarking
method, Electron. Lett, Vol. 36 (14), pp. 1201 1202.
[56]. Xiangyang Luo, Bin Liu, and Fenlin Liu (2005), Improved RS Method for
Detection of LSB Steganography, ICCSA 2005, LNCS 3481, pp. 508516.
[57]. Xiangyang Luo, Fenlin Liu (2007), A LSB Steganography approach against
pixel sample pairs Steganalysis, ICIC International @ 2007, ISSN 1349-4198,
pp. 575588.
[58]. B. Macq (2000), Lossless Multi-Resolution Transform for Image Authenticating
Watermarking, In Proc. of EUSIPCO, Tempere, Finland.
[59]. H. Malik (2008), Steganalysis of QIM Steganography Using Irregularity
Measure, MM&Sec08, Oxford, United Kingdom.
[60]. L. Marvel, C. G. Boncelet Jr., and C. T. Retter (1999), Spread spectrum image
steganography, IEEE Trans. on Image Processing, vol. 8 (8): pp. 1075-1083.
[61]. Alfred J. Menezes, Scott A Vanstone (1996), Handbook of Applied Cryptography,
CRC Press.
[62]. Ni, Z., Shi, Y., Ansari, N., Su, W. (2003), Reversible data hiding, Proc. ISCAS
2003, pp. 912915.
[63]. Olson, D. L.; Delen, D. (2008), Advanced Data Mining Techniques, Springer 1
edition, ISBN 3540769161, page 138.
[64]. S. Panchapakesan, N. Balakrishnan (1997), Advances in Statistical Decision
Theory and Applications, Hamilton Printing, Rensselaer, NY, ISBN 0 8176
3965 9, 3 7643 3965 9.
[65]. F. A. P. Petitcolas, R. J. Anderson, and M.G. Kuhn (1999), Information hiding
A survey, Proc. IEEE, vol. 87 (7), pp. 1062 1078.
[66]. Toms Pevn (2008), Kernel Methods in Steganalysis, Ph. D Thesis, Binghamton
University, State University of New York.
[67]. C. I. Podilchuk and E. J. Delp (2001), Digital watermarking: Algorithms and
applications, IEEE Signal Process. Mag., vol. 18 (4), pp. 33-34.
[68]. V. Poor (1994), An introduction to signal detection and estimation, Springer -
Verlag, New York.
[69]. Niesl Provos, Peter Honeyman (2003), Hide and seek: An introduction to
steganography, Published by The IEEE computer society.
[70]. N. Provos (2001), Defending Against Statistical Steganalysis, 10th USENIX
Security Symposium, Washington.
[71]. N. Provos and Peter Honeyman (2001), Detecting Steganographic Content on the
Internet, CITI Technical Report 01-11, submitted for publication.
[72]. M. Rabbani and R. Joshi (2002), An Overview of the JPEG2000 Still Image
Compression Standard, Signal Processing: Image Communication 17, pp. 348.

[73]. P. M. S. Raja, E. Baburaj (2011), Survey of Steganoraphic Techniques in
Network Security, International Journal of Research and Reviews in Computer
Science (IJRRCS), Vol. 2 (1), pp. 98 103.
[74]. Joseph Raphael A., Sundaram V. (2010), Secured Communication through
Hybrid Crypto-Steganography, International Journal of Computer Science and
Information Security (IJCSIS), Vol. 8 (4), pp. 45-48.
[75]. R. V. Schyndel, A. Tirkel, and C. Osborne (1994), A digital watermark, In
Proceedings of ICIP, vol. 2, Austin, TX, pp. 8690.
[76]. Aubrey de Seslincourt (1996), Herodotus - The Histories, Penguin Books,
London.
[77]. T. Sharp (2001), An implementation of key-based digital signal steganography,
in Proc. 4
th
Int. Workshop Information Hiding, Vol. 2137, Springer LNCS, pp. 13-
26.
[78]. C. A. Stanley (2005), Pair of Values and the chi-Squared Attack, Department of
Mattematics, Iowa State University.
[79]. J. P. Stern, G. Hachez, F. Koeune, and J. J. Quisquater (1999), Robust Object
watermarking Application to code, In proceedings of Info Hiding99, volume
1768, Lecture Notes in Computer Science, pp. 368-378.
[80]. K. Sullivan, O. Dabeer, U. Madow, B. S. Manujunath and S. Chandrasekaran (Sep.
2003), LLRT Based Detection of LSB Hiding, In Proc. IEEE International
Conference on Image Processing (ICIP), Barcelona, Spain, pp. 497500.
[81]. K. Sullivan, Z. Bi, U. Madhow, S. Chandrasekaran and B.S. Manjunath (2004),
Steganalysis of quantization index modulation data hiding, In Proc. IEEE
International Conference on Image Processing (ICIP), Singapore, pp. 11651168.
[82]. K. Sullivan, U. Madhow, B. S. Manjunath, and S. Chandrasekaran (2005),
Steganalysis for Markov Cover Data with Applications to Images, Submitted to
IEEE Transactions on Information Forensics and Security.
[83]. K. Sullivan, U. Madhow, S. Chandrasekaran and B. S. Manjunath (2005),
Steganalysis of Spread Spectrum Data Hiding Exploiting Cover Memory, In
Proc. IS&T/SPIEs 17th Annual Symposium on Electronic Imaging Science and
Technology, San Jose, CA.
[84]. K. M. Sullivan (2005), Image steganalysis: Hunting and Escaping, Ph. D Thesis in
Electrical and computer Engineering, University of California.
[85]. Ho Thi Huong Thom, Canh Ho Van, Tien Trinh Nhat (2009), Statistical Methods
to Steganalysis of Color or Grayscale Images, Proc. of IEEE-RIVF 2009 on
Doctoral Symposium, Da Nang University of Technology, pp. 1-5.
[86]. Ho Thi Huong Thom, Ho Van Canh, Trinh Nhat Tien (2009), Novel Algorithms
to Steganalysis of Uncompressed and Compressed Images, Proceedings of KSE
2009 on Knowledge and Systems Engineering, College of Technology, IEEE
Computer Society, Vietnam National University, Ha Noi, pp. 87-92.
[87]. Ho Thi Huong Thom, Ho Van Canh, Trinh Nhat Tien (2009), Steganalysis to
Reversible Data Hiding, Proceedings of FGIT 2009 on Database Theory and
Application, Springer-Verlag, Jeju, Korea, pp. 1- 6.
[88]. Ho Thi Huong Thom, Canh Ho Van, Tien Trinh Nhat (2010), Steganalysis of
Reversible Vertical Horizontal Data Hiding Technique, International Journal of
Computer Science and Information Security (IJCSIS), Vol. 8 (6), pp. 7-12.
[89]. Huynh-Thu, Q.; Ghanbari, M. (2008), Scope of validity of PSNR in image/video
quality assessment, Electronics Letters 44, pp. 800801.
[90]. J. Tian (2002), Reversible Watermarking by Difference Expansion, In Proc. of
Workshop on Multimedia and Security, pp. 19-22.
[91]. J. Tian (2002), Wavelet Based Reversible Watermarking for Authentication, In
Proc. Security and Watermarking of Multimedia Contents IV, Electronic Imaging
2002, Vol. 4675, pp. 679-690.
[92]. Y. Wang, P. Moulin (2003), Steganalysis of Block-DCT Image Steganography,
Proc. IEEE Workshop on Statistical Signal Processing 2003.
[93]. Shaowei Weng, Yao Zhao (2008), A novel reversible data hiding scheme,
International Journal of Invovative Computing, Information and Control, Vol. 4
(3), pp. 351 358.
[94]. A. Westfeld (2001), High Capacity Despite Better Steganalysis (F5A
Steganographic Algorithm), In: Moskowitz, I.S. (eds.): Information Hiding. 4th
International Workshop. Lecture Notes in Computer Science, Vol.2137. Springer-
Verlag, Berlin Heidelberg New York, pp. 289 302.
[95]. A. Westfeld and A. Pfitzmann (1999), Attacks on steganographic systems, In
Lecture notes in computer science: 3rd International Workshop on Information
Hiding.
[96]. A. Westfeld (2002), Detecting Low Embedding rates, Preproceedings 5th
Information Hiding Workshop, Noordwijkerhout, Netherlands, pp. 79.
[97]. H. C. Wu, N. I. Wu, C. S. Tsai, M. S. Hwang (2005), Image Steganographic
scheme based on pixel - value differencing and LSB replacement methods, IEE
Proc.-Vis. Image Signal Process., Vol. 152, Issue 5, pp. 611 615.
[98]. Guorong Xuan, Yun Q. Shi, Peiqi Chai, Xuefeng Tong, Jianzhong Teng, Jue Li
(2008), Reversible Binary Image Data Hiding By Run-Length Histogram
Modification, The 19th International Conference on Pattern Recognition (ICPR
2008), Tampa, Florida, USA, pp 1 - 4.
[99]. G. Xuan, Q. Yao, C. Yang, J. Gao, P. Chai, Y. Q. Shi, Z. Ni (2006), Lossless
Data Hidding Using Histogram Shifting Method Based on Integer Wavelets,
Proc. 5th Digital watermarking workshop, IWDW 2006, Korea,
vol. 4283, pp. 323-332.
[100]. L. Yu, Y. Zhao, R. Ni, T.Li (2010), Improved adaptive LSB steganography based
on chaos and genetic algorithm, EURASIP Journal on Advances in Signal
Processing - Special issue on advanced image processing for defense and security
applications, Vol. 2010.
[101]. Xinpeng Zhang and Shuozhong Wang (2005), Steganography Using Multiple-
Base Notational System and Human Vision Sensitivity, IEEE Signal Processing
Letters, Vol. 12 (1), pp. 67 70.
[102]. T. Zhang and X. Ping (2003), Reliable detection of LSB steganography based
on the difference image histogram, IEEE International Conferenceon Acoustics,
Speech, and Signal Processing, Volume 3, pp.545-548.
Trang Web
[103]. CBIR image database, University of Washington, available at:
http://www.cs.washington.edu/research/imagedatabase/groundtruth/
[104]. Derek Upham: Jsteg (1997), http://www.tiac.net/users/Korejwa/Jsteg.htm.
[105]. Romana Machado (1996), EzStego, http://www.stego.com.
[106]. StegoArchive.com: http://www.stegoarchive.com.
[107]. USC-SIPI Image Database, Signal and Image Processing Institute, University of
Southern California, http://sipi.usc.edu/services/database/ Database.html
Ting Nga
[108]. C. P. PAO (1968), uee auueeue eo u ux npueeu,
Mockba.
[109]. .H. oe, H.B.Cupo (1983), Ta Maeateco Cac,
Haya Moca.
[110]. P (1960), . ., p p, .