I HC QUC GIA H NI

TRNG I HC CNG NGH

Lu Xun Th

NGHIN CU CC K THUT D BIN P DNG

TRONG TRCH CHN CC B PHN KHUN MT

KHO LUN TT NGHIP I HC H CHNH QUY

Ngnh: Cng ngh thng tin

H NI 2010

I HC QUC GIA H NI
TRNG I HC CNG NGH

Lu Xun Th

NGHIN CU CC K THUT D BIN P DNG

TRONG TRCH CHN CC B PHN KHUN MT

KHO LUN TT NGHIP I HC H CHNH QUY

Ngnh: Cng ngh thng tin

Cn b hng dn: ThS. Ma Th Chu

H NI 2010

LI CM N
Li u tin em xin by t lng bit n ti cc thy, c gio trong trng i hc
Cng ngh - i hc Quc gia H Ni. Cc thy c dy bo, ch dn chng em v lun
to iu kin tt nht cho chng em hc tp trong sut qu trnh hc i hc c bit l
trong thi gian lm kho lun tt nghip.
Em xin by t lng bit n su sc ti c gio ThS. Ma Th Chu, c hng dn em
tn tnh trong c hc k va qua, c gp v chnh sa thng xuyn cho kha lun ca
em.
Ti cng xin cm n nhng ngi bn ca mnh, cc bn lun bn ti, gip v
cho ti nhng kin ng gp qu bu trong hc tp cng nh trong cuc sng.

H ni, ngy 2010

Lu Xun Th

TM TT
K thut d bin l bi ton mi ch xut hin cch y khng lu, ch khong vi thp
nin, nhng c rt nhiu nghin cu v n. Cc nghin cu ban u rt n gin, nh l
en trng v ch c mt khun mt chp thng, sau ny m rng ra cho nh mu, nh c
nhiu khun mt vi nhiu gc, mi trng xung quanh cng i t n gin n rt phc
tp.
T kha: edge detection, edge filter.

MC LC
LI CM N........................................................................................................................ 2
TM TT.............................................................................................................................. 3
MC LC............................................................................................................................. 4
Chng 1. GII THIU........................................................................................................5
1.1 Gii thiu v tm bin trong nhn dng khun mt.................................................5
1.2 Bi ton nghin cu k thut d bin p dng trong trch chn khun mt............6
1.3 Ni dung v cu trc kha lun..............................................................................6
Chng 2. CC K THUT D BIN................................................................................8
2.1 Quy trnh pht hin bin.........................................................................................8
2.2 K thut pht hin bin trc tip............................................................................8
2.3 K thut pht hin bin gin tip..........................................................................19
2.4 Mt s phng php khc....................................................................................19
................................................................................................................................... 20
2.5 Tng kt...............................................................................................................21
Chng 3. CC K THUT D BIN C P DNG..............................................22
3.1 Cc k thut c dng........................................................................................22
3.2 Chng trnh v kt qu.......................................................................................27
3.3 Tng kt...............................................................................................................32
Chng 4. KT LUN V HNG PHT TRIN........................................................34
4.1 Kt lun ...............................................................................................................34
4.2 Hng pht trin...................................................................................................34

Chng 1.

GII THIU

1.1 Gii thiu v tm bin trong nhn dng khun mt

K thut d bin l bi ton mi ch xut hin cch y khng lu, ch khong vi thp
nin, nhng c rt nhiu nghin cu v n. Cc nghin cu ban u rt n gin, nh l
en trng v ch c mt khun mt chp thng, sau ny m rng ra cho nh mu, nh c
nhiu khun mt vi nhiu gc, mi trng xung quanh cng i t n gin n rt phc
tp. Bi ton pht hin bin ni chung v pht hin bin khun mt ni ring c rt nhiu
hng pht trin, nhng c th k ra hai hng chnh sau:
- Th nht l nhn din (face recognition) mt khun mt, tc l gi s ta c bc nh
mt khun mt, ta s tm mt bc nh c khun mt ging vi khun mt trong nh. ng
dng ca n l truy tm ti phm, cc h thng an ninh xc inh da vo khun mt.
- Th hai l xc nh v tr nhng khun mt trong mt bc nh (face detection), cc
bc nh c th c nhiu khun mt, c kch thc v gc khc nhau. ng dng ca n nh
trong cc my chp hnh c kh nng nhn dng mt ngi chnh sng ni .
Bin l vn ch yu trong phn tch nh, v cc c im trch chn trong qu trnh
phn tch nh ch yu da vo bin. Mt im c gi l im bin nu c s thay
i t ngt v mc xm. Tp hp cc im bin to thnh bin hay ng bao ca nh.
V mt ton hc ngi ta xem bin l ni c s thay i t ngt v mc xm, trn c
s ngi ta thng s dng hai phng php pht hin bin sau:

- Phng php pht hin bin trc tip

- Phng php pht hin bin gin tip
Xut pht t thc t , mc tiu ca lun vn l nghin cu cc phng php biu
din bin, h thng ha kin thc v cc phng php pht hin bin, tm hiu cc k thut
phn vng nh, mt bc trc trong qu trnh d bin v ng dng ca n trong x l nh
v x l nh vn bn l mt trong nhng nhim v quan trng trong vic t ng ha cng
vic vn phng.

1.2 Bi ton nghin cu k thut d bin p dng trong trch chn

khun mt
Trong thc t, chng ta gp nhiu bi ton lin quan n nhn dng i tng. Thng
thng, vic nhn ra cc i tng thng da vo ng bin ca chng. Vit Nam hin
nay c mt s h thng nhn dng i tng nh: MapScan, VnDOCR, MarkREAD ca
Vin Cng ngh thng tin hay VecMap ca DolSoft, nhn chung nhng ng dng v ti tiu
c tnh cht h thng v cc phng php biu pht hin bin v ng dng ca n vn l
mt phn thiu vng.
Xut pht t thc t , mc tiu ca lun vn l nghin cu cc phng php biu
din bin, h thng ha kin thc v cc phng php pht hin bin, tm hiu cc k thut
phn vng nh, tm hiu qu trnh d bin v ng dng ca n trong x l nh v x l nh
vn bn, l mt trong nhng nhim v quan trng trong vic t ng ha cng vic vn
phng.
Trong kha lun ny bin khun mt s c hin th thng qua mt chng trnh m
n gin. Vi 5 k thut c p dng bin khun mt s c a ra vi 5 kiu khc nhau.
Mi kiu s l mt c im v kha cnh ring.

1.3 Ni dung v cu trc kha lun

Kha lun c t chc theo cu trc nh sau:
Chng 1: Gii thiu
Gii thiu s lc v cc k thut d bin ni chung v k thut d bin p dng vi
khun mt v p dng cho vic trch chn cc b phn ca khun mt. Bi ton pht hin
bin c phn tch di kha cnh ton hc gip ta chn hng gii quyt tt nht cho bi
ton l s dng cc k thut tm kim bin c in. Chng ny gii thiu nhng g m
kha lun nghin cu t thng qua vic trnh by v ni dung v cu trc ca kha lun.
Chng 2: Cc k thut d bin

Chng hai i vo gii thiu gii thiu cc k thut d bin. Vi 2 k thut d bin
trc tip v gin tip, nhng ta ch yu i xu vo k thut d bin trc tip c dng rng
ri v thng xuyn.
Chng 3: K thut d bin c p dng
Chng ny gii thiu vo cc k thut d bin c p dng trong chng trnh.
Bng cch s dng hm Gauss lm trn nh sau dng cc k thut tm kim trc tip
a ra 5 kiu bin khc nhau vi mt bc nh ni chung v khun mt trong chng
trnh ny.
Chng 4: Kt lun v hng pht trin
Chng ny tng kt li nhng g t c v cha t c. T nu ln nhng
kt qu hng ti, hng nghin cu v pht trin tip theo.

Chng 2. CC K THUT D BIN

2.1 Quy trnh pht hin bin
nh u vo

Lc nhiu

Lm ni
nh v bin
bin
H2.1. Quy trnh pht hin bin

output

trch chn bin

B1: Do nh ghi c thng c nhiu, bc mt l phi lc nhiu

B2: Lm ni bin s dng cc ton t pht hin bin.
B3: nh v bin. Ch rng k thut ni bin gy tc dng ph l gy nhiu lm mt s
bin gi xut hin do vy cn loi b bin gi.
B4: Lin kt v trch chn bin.

2.2 K thut pht hin bin trc tip

Phng php ny ch yu da vo s bin thin sng ca im nh lm ni
bin bng k thut o hm.
- Nu ly o hm bc nht ca nh: ta c phng php Gradient
nh ngha: Gradient l mt vector f(x, y) c cc thnh phn biu th tc thay i mc
xm ca im nh (theo hai hng x, y trong bi cnh x l nh hai chiu) tc:

Trong dx, dy l khong cch gia 2 im k cn theo hng x, y tng ng (thc t

chn dx=dy=1). y l phng php da trn o hm ring bc nht theo hng x, y.

Gradient trong gc ta gc (r, ), vi r l vector, l gc

H2.2. Vector gradient

2.2.1 K thut Gradient

Theo nh ngha v Gradient, nu p dng n vo x l nh, vic tnh ton s rt phc
tp. n gin m khng mt tnh cht ca phng php Gradient, ngi ta s dng k
thut Gradient dng cp mt n H1, H2 trc giao (theo 2 hng vung gc). Nu nh ngha
g1, g2 l Gradient theo hai hng x, y tng ng th bin g(m, n) ti im (m, n) c
tnh:

t A0 = g(m,n);

gim phc tp tnh ton, A0 c tnh gn ng nh sau:

Xt mt s ton t Gradient tiu chun nh ton t Robert, Sobel, Prewitt, ng hng

(Isometric), 4-ln cn di y.

H2.3. Ton t 4 ln cn
Ton t Robert (1965).
Robert p dng cng
thc tnh Gradient ti im (x, y)
nh hnh trn Wij vi mi im nh I(x, y) o hm theo x, y c k hiu tng ng gx,
gy:

Cc cng thc k trn c c th ha bng cc mt n theo chiu x v y tng ng

nh sau:

Mt n Robert

Ton t (mt n) Sobel

Ton t Sobel c Duda v Hart [5] t ra nm 1973 vi cc mt n tng t nh ca

Robert nhng cu hnh khc nh sau:

Hng ngang (x)

Hng dc (y)

Mt n Prewitt
Ton t Prewitt a ra nm 1970 c dng:

Hng ngang (x)

Hng dc (y)

Mt n ng hng:
Mt mt n khc cng c nu nh di y gi l mt n ng hng (Isometric).

Hng ngang (x)

Hng dc (y)

Ton t 4-ln cn (4-Neighbour Operator).

Ton t 4-ln cn c Chaudhuri v Chandor (1984) nu ra trong mt n c kch
thc 3x3 c thay cho mt n 2x2 ca ton t Robert. Cc mt n ny c cho:

H3. Mt n 4 ln cn

H2.4. Mt n 8 hng theo Kirsh.

Mt vi nhn xt:
Ton t Prewitt c th tch sn tt hn ton t Sobel, trong khi ton t Sobel tch
cc sn trn cc ng cho tt hn. Mt khc, cc ton t Robert v cc ton t 4-ln cn
c nhc im l nhy vi nhiu. Cc ton t Gradient v Sobel gim nhiu do tc dng ca
lc trung bnh cc im ln cn. Nh vy, t c kt qu mong mun cc ton t
Gradient thng c dng trc lm sch nhiu.
Cc mt n ca cc ton t trn c kch thc 2x2 hoc 3x3 chiu. Cc mt n c s
chiu ln hn cng c s dng. V d trong k thut pht hin bin ngi ta dng mt n
5x5 cho ton t Sobel:

Ton t Sobel 5x5.

Cc ton t k trn u s dng cc mt n theo hai chiu (x, y) tc l 4 hng (-x, yy, y) vi mc ch cho kt qu chnh xc hn(khi m tc v b nh my tnh tt. )

2.2.2 Ton t la bn

Kirsh xut mt n 8 hng nh 8 hng ca La bn(Compass). Hnh

di l m hnh 8 hng v c t tn theo hng a l v theo chiu kim

ng h: ng, ng Nam, Nam, Nam Ty, Ty, Ty Nam, Ty Bc,

Bc, ng Bc; mi hng lch nhau 45 .

Ton t la bn Kirsh:
C nhiu ton t la bn khc nhau. Ta xem xt ton t la bn Kirsh c trng bi tm
mt n vi kch thc 3x3 nh sau:

K hiu
l Gradient theo 8 hng nh 8 mt n k trn, khi bin
Gradient ti im nh (x, y) c tnh theo

- Nu ly theo o hm bc hai ca nh: ta c phng php Laplace

Hai phng php ny gi chung l phng php d bin cc b.
Ton t la bn khc:
Ngoi ton t la bn Kirsh, mt s ton t la bn khc s dng b mt n 8 hng
khc nh:

Hoc:

Trng hp tng qut, ngi ta c th m rng cc mt n vi n hng cch u tng

ng vi cc mt Wi; i=1, 2, , n. Khi , bin ti hng th i vi mt n Wi c xc
nh:

2.2.3 K thut Laplace

khc phc hn ch v nhc im ca phng php Gradient, trong s dng o
hm ring bc nht ngi ta ngh n vic s dng o hm ring bc hai hay ton t
Laplace. Phng php d bin theo ton t Laplace hiu qu hn phng php ton t

Gradient trong trng hp mc xm bin i chm, min chuyn i mc xm c tri

rng.
Ton t Laplace c nh ngha nh sau:

Ton t Laplace dng mt s mt n khc nhau nhm tnh gn ng o hm ring bc

2. Cc dng mt n theo ton t Laplace bc 3x3 c th:

Ghi ch: Mt n H1 cn ci bin bng vic ly gi tr tm bng 8 thay v gi tr 4. thy

r vic xp x o hm ring bc 2 trong khng gian 2 chiu vi mt n H1 lm v d, ta c
th tnh gn ng nh sau:

Do :

Tm li: K thut theo ton t Laplace to ng bin mnh (c rng 1 pixel). Nhc
im ca k thut ny rt nhy vi nhiu, do vy ng bin thu c thng km n nh.

2.2.4 Tch sn theo nh Canny

B tch sn nh theo Canny (1986) da trn cp o hm ring bc nhtvi vic lm
sch nhiu. Mc ny c ring v y l phng php tch ng bin kh ph bin
c dng theo ton t o hm. Nh ni, phng php o hm chu nh hng ln
ca nhiu. Phng php t hiu qu cao khi xp x o hm bc nht ca Gauss.

Vi fx, fy l o hm ring theo x,y ca f.

Do vy:

Ly o hm ring theo x v y ca G ta c:

H2.5. M hnh tnh ca phng php Canny.

Do b lc Gauss l tch c, ta c th thc hin ring bit cc tch chp theo x v y:

T ta c:

Vi bin v hng tnh theo cng thc trn, thut ton c minh ha nh hnh H2.5
trn.

2.2.5 D bin theo quy hoch ng

Nh trn ni, d bin theo phng php Gradient l xc nh cc tr cc b ca
Gradient theo cc hng; cn phng php Laplace da vo cc im khng ca o hm
bc hai. Phng php d bin theo quy hoch ng l phng php tm cc tr tng th theo
nhiu bc. N da vo nguyn l ti u ca Bellman. Nguyn l ny pht biu nh sau:
Con ng ti u gia 2 im cho trc cng l ti u gia 2 im bt k nm trn ng
ti u .

Th d, nu C l mt im trn con ng ti u gia A v B th on CB cng l cn

ng ti u t C n B khng k n ta n C bng cch no.

H2.6. Minh ha nguyn l Bellman

Trong k thut ny, gi s bn bin c xc nh v c biu din di dng
th lin thng N chng. Gi s hm nh gi c tnh theo cng thc:

Vi:

Xk, k=1,...,N: Biu din cc nh th ca th trong chng th k;

D(x, y): Khong cch gia 2 nh x v y tnh theo cc nh ngha tng ng v khong

cch;

|g(xk)| v (xk) Gradient bin v Gradient hng nh xk.

v cc hng s khng m.

ng bao ti u s nhn c bng cch ni cc nh xk, k=1,..., N no sao cho S(x1,...,

xN, N) t cc i.
nh ngha hm nh sau:

By gi ta c:

Ly N = k.
Nh vy:

Vi cch ny, thay v tm ti u ton cc phc tp ca S(x1, ,xN, N), ta tm ti u

ca N chng theo ti u 2 bin. Trong mi chng, vi mi xk tm ti u, ( k x k . d
hnh dung, xt v d sau:

Gi s c bn biu din bi th lin thng. Theo phng php trn c 5 ) 1, ( = A

, vi k =2 c . ) 2, ( 12 max(11,12) D = = iu c ngha l ng t A n D i qua
C v ACD l bin c chn vi k=2. Tng t, vi k=4, c hai ng c chn l
ACDEF v AGHJ. Tuy nhin, vi k=5 th on JB b loi v ch tn ti ng duy nht vi
cc i l 28. Nh vy, bin c xc nh l ADEFB.

a. th lin thng biu din bin

b. Qu trnh d bin theo quy hoch ng

H2.7. D bin theo phng php quy hoch ng

Trn hnh nhng ng nt t on biu th cung b loi; ng nt lin c mi tn

biu th ng i hay bin ca nh.

2.3 K thut pht hin bin gin tip

Nu bng cch no y, chng ta thu c cc vng nh khc nhau th ng phn
cch gia cc vng chnh l bin. Ni cch khc, vic xc nh ng bao ca nh c
thc hin t nh v c phn vng. Phng php d bin gin tip kh ci t nhng p
dng tt khi s bin thin sng nh.

2.4 Mt s phng php khc

Ngoi cc phng php trn, ngi ta cng p dng mt s phng php khc ci tin
nh tip cn bi m hnh mt, cch tip cn ti u ha.

Cch tip cn theo m hnh mt da vo vic thc hin xp x a thc trn nh gc hay nh
thc hin php lc Laplace. Cch tip cn ti u nhm xc nh mt hm (mt b lc),
lm gim phng sai 2 hoc gim mt s im cc tr cc b. Di y s trnh by mt
cch tm tt cc phng php .
Tip cn theo m hnh mt
T tng ca phng php ny l ti ln cn im ct khng (im bin), nh sau khi
lc Laplace c th c xp x bi mt a thc bc 3 theo hng v ct. a thc thng
c dng l a thc Trebchp vi kch thc 3x3. Cc a thc ny c nh ngha nh
sau:

Vi mi im ct khng pht hin ti P(x, y) trong nh c lc bi ton t Laplace

Gauss, Huertas v Medioni cho c tnh theo cng thc tnh xp x:

Vn l xc nh cc h s ai, i=1, 2, , N-1. Nu W l ca s lc ti im ct khng v

x, y, i, j trong ca s; cc h s a c th c tnh ton nh mt t hp tuyn tnh:

 y, IL-G(x, y) l k hiu nh c lc bi ton t LaplaceGauss. Cc h s ny c

th nhn c bi chp nh IL-G(x, y) vi cc nhn chp nh trung bnh c trng s hay
mt s nhn chp khc.
Cc bc ci t phng php nhy c th m t nh sau:
Chp nh gc kch thc NxM vi ton t Laplac Gauss kch thc M2, nh thu
c gi l IL-G.
Trch chn cc im ct khng ca nh IL-G, nh kt qu k hiu l IZCR.
Vi mi im ct khng trong IZCR, thc hin mt xp x vi kch thc 3x3 suy ra
cc im ct khng theo cch gi tch.
To mt nh mi ca cc im ct khng kch thc nXxnY m cc ng bao c
xc nh vi phn gii n no .
Tip cn ti u ha
tng ca cch tip cn ny l nh v ng v tr bng cch cc tiu ha phng sai
v tr cc im ct khng hoc hn ch s im cc tr cc b ch to ra mt ng
bao. Canny xut 3 rng buc ng vi 3 iu kin:

Rng buc u tin () nhm tm hm h(x) phn i xng sao cho t s gia tn hiu
v nhiu l cc i. Rng buc th hai () nhm cc tiu ha phng sai. Rng buc th ba
nhm hn ch im cc tr cc b vi mc ch cung cp ch mt ng bao.

2.5 Tng kt
Cc k thut s dng phng php Gradient kh tt khi sng c tc thay i
nhanh, kh n gin trn c s cc mt n theo cc hng. Nhc im ca cc k thut
Gradient l nhy cm vi nhiu v to cc bin kp lm cht lng bin thu c khng
cao.
Ngoi ra, ngi ta cn s dng phng php i theo ng bao da vo cng c
ton hc l nguyn l quy hoch ng v c gi l phng php d bin tng th.
Phng php d bin trc tip c hiu qu v t b tc ng bi nhiu.

Chng 3. CC K THUT D BIN C P DNG

3.1 Cc k thut c dng
Bin l tp hp cc im ti hm sng ca nh thay i cc b t ngt, do
pht hin bin v tch bin ta dng php ton o hm. Cc php ton o hm thng
dng l o hm bc nht v o hm bc 2. V tr ca bin chnh l ga tr ln nht ca o
hm bc nht v l cc im ti gi tr ca o hm bc 2 c s i qua im 0.
Chng trnh s dng k thut pht hin bin trc tip, tc l ly o hm bc nht theo
phng php Gradient.
Chng trnh p dng hm Gauss vi khai bo:

vi cc hng s thc a > 0, b, c > 0, v e 2. 718281828 (S Euler).

Hm Gauss c s dng rng ri. Trong thng k chng miu t phn b chun, trong
x l tn hiu chng gip nh ngha b lc Gauss, trong x l hnh nh hm Gauss hai chiu
c dng to hiu ng m Gauss v c s dng lm trn xy dng cc hm
wavelet ng dng cho vic xc nh bin, c th trong chng trnh ny ta dng phng
php Gradient, v trong ton hc chng c dng gii phng trnh nhit v phng trnh
khuych tn v nh ngha php bin i Weierstrass.
Biu ca mt hm Gauss l mt ng cong i xng c trng "hnh qu
chung". ng cong ny rt xung rt nhanh khi tin ti cng/tr v cng. Tham s a l
chiu cao ti a ng cong, b l v tr tm ca nh v c quyt nh chiu rng ca
"chung".

H3.1ng cong Gauss chun ha vi gi tr k vng v phng sai 2. Nhng tham s

tng ng l a = 1/( 2 ), b = , c =
Tip n ta s dng hm dgauss vi cng thc nh sau:
y = -x ae-((x-b)^2)/2c^2 / c2;

Vi hm Gauss c cng thc c nh ngha nh sau:

y = e-x^2/(2c^2) / (c 2 );

Hm ny chnh l o hm ca hm gauss vi cc tham s ca hm tng ng l a = 1/(c

2 ), b = 0, c = c. V hm d2dgauss:
h = d2dgauss(n1,sigma1,n2,sigma2,theta)

Hm ny tm kim v tr li bin 2D vi nh c c n1 * n2. Theta l gc xoay theo chiu

kim ng h, theo th t ca size ca bc nh cc thnh phn ln lt s c xoay mt
gc theta v tin hnh ly tch ca hm Gauss vi cc tham s th nht vi o hm ca
hm Gauss vi cc tham s th 2 ta thu c cc gi tr h tng ng v cui cng gi tr
hm s c tnh:

h = h / (sum sum ( abs ( h ) .*abs ( h ) ) ) ;

Sigma1 v sigma2 l lch tiu chun ca hm gauss. Ban u chng trnh x l

nh u vo v bin i thnh anh a cp xm (gray), s dng hm imread(image) c
nh u vo, sau chuyn nh ny thnh am cp xm bng hm ind2gray(x, map) v tin
hnh ly bin 2D theo cc k thut m c ni k phn di.

3.1.1 Ly bin theo trc X

Vi cc thng s chun ca hm Gauss, khi ly bin theo trc X ta s a bc nh v
kch thc 10X10, cc tham s chun ca hm Gauss Sigmax1=Sigmax2=1, gc quay
Theta1=pi/2. Sau khi nh vo c c bi hm imread(image) v c chuyn thnh nh
a cp xm qua hm ind2gray(x, map). V quy trnh ly bin theo trc X s c tin hnh
vi nh a cp xm ny. Ta s dng hm d2dgauss l hm vi cc tham s c th:
filterx=d2dgauss(Nx1,Sigmax1,Nx2,Sigmax2,Theta1);
w=ind2gray(x,map);

Qua bc x l ny th ly c bin theo cc tham s ng vi trc X, bc tip

theo l hin th ra mn hnh bin theo trc X. Ta s dng hm conv2:
Ix= conv2(w,filterx,'parameters');

Vi hm Conv2 vi shape = same: conv2(matrix, kernel, 'same'), ma trn kt qu c

chiu ging nh matrix, v gi tr ti mi phn t c tnh bng cch qut tm ca kernel
trn ton b matrix ri tnh tng tch cc cp im tng ng gia matrix v kernel. im

tm ca kernel c xc nh bng im gia ca ma trn, v d nu kernel l ma trn 3x3

th tm l im c ta 1:1, nu kernel l ma trn 4x4 th tm cng l im 1:1.

H3.2 Hm conv2 vi tham s

same

Conv2 vi shape = full: conv2(matrix, kernel, 'full'), nu matrix c chiu l m1 x n1,

kernel c chiu l m2 x n2 th ma trn kt qu c chiu l (m1 + m2 - 1) x (n1 + n2 - 1) v
gi tr ti mi phn t c tnh bng cch qut ton b, tun t tng im ca ma trn
Kernel ln tng im trn ma trn matrix sau tnh tng tnh cc cp im tng ng,
trong qu trnh qut c nhng im trn Kernel nm ngoi matrix khi tch ca n bng 0.

H3.3 Hm conv2 vi tham s

full

Conv2 vi shape = valid: conv2(matrix, kernel, 'valid'), nu matrix c chiu l m1 x

n1, kernel c chiu l m2 x n2 th ma trn kt qu c chiu l (m1 - m2 + 1) x (n1 - n2 + 1)
v gi tr ti mi phn t c tnh ging nh trng hp full nhng vi iu kin l ma
trn kernel trong qu trnh qut lun nm trn vn bn trong ma trn matrix.

H3.2 Hm conv2 vi tham s

valid

3.1.2 Ly bin theo trc Y

Vi cc thng s chun ca hm Gauss, khi ly bin theo trc Y cng c quy trnh
tng t nh quy trnh ly bin theo trc X vi cc tham s tng ng kch thc nh
10X10, cc tham s chun ca hm Gauss Sigmay1=Sigmay2=1, gc quay Theta1=0.

3.1.3 Ly bin theo Gradient

Vi phng php Gradient ta kt hp c theo trc X v Y. Vi Ix v Iy ta tnh c
trn th ta tnh:
NVI=

( Ix.* Ix + Iy.* Iy )

Hm ly cn bc hai ca bnh phng cc gi tr tham s theo trc X v Y. Sau khi ta s

c gi tr theo hng ng cho hnh ch nht hng xung gc phn t thc t vi 2
hng ca hnh ch nht l trc X v trc m Y. Cc tham s ca ma trn nh theo phng
php Gradient s c tnh nh cng thc cn bc 2 trn.

3.1.4 Ly bin theo Thresholding

Thresholding l hot ng u tin c thc hin to ra mt mt phn on.
Chng ta c th la chn mt vng m ta quan tm bng cch nh ngha mt phm vi ca
nhng gray value. Nhng ranh gii ca phm vi l cc gi tr ngng trn v ngng
di. Tt c cc im tng ng vi mt gray value trong phm vi s c t sng trong
mt mt.
Theo phng php ny gi tr min v max ca ma trn Gradient s c xc nh qua cc
hm max, min. Nh sau:
I_max=max(max(NVI));
I_min=min(min(NVI));

Ngng s c nh ngha nh sau:

level=alfa*(I_max-I_min)+I_min; alfa=0.1;

V sau nhng tham s no trong ma trn Gradient m ln hn ngng ny s c hin

th. V ta hin th bin theo phng php ny.

3.1.5 Ly bin theo Thinning

Phng php ny p dng kt qu ca cc phng php trc pht trin ln. Vi m,
n l kch c ca nh theo trn. Phng php s dng php ni suy tm cc im nh.

Ni suy hm 1 bin:MATLAB dng hm interp1(x,y,xi,< phng php>)vi x, l gi

tr ca hm ti nhng im cho v xi l gi tr m ti ta cn ni suy ra gi tr
yi.<phngphp> c th l mt trong cc gi tr sau :nearest- phng php ny t gi tr
ni suy vo gi tr cho gn nht, phngphp ny nhanh nhng kt qu km chnh xc
nht.
Vd:
x=[12345];
y=[5.5,43.1,128,290.7,498.4];
yi=interp1(x,y,1.6,'nearest')
yi=43.1000
linear- phng php ny coi ng cong i qua 2 im cho trc l ng thng.
Vd:
yi=interp1(x,y,1.6,'linear')
yi=28.0600
spline- dng phng php ni suy spline.
Vd:
yi=interp1(x,y,1.6,'spline')
yi=24.9782
cubic- phng php ny coi ng cong qua 2 im l ng cong bc 3.
Vd:
yi=interp1(x,y,1.6,'cubic')
yi=25
22.3840
Ni suy hm hai bin: Hm interp2 thc hin ni suy hm 2 bin. Dng hm tng qut:
ZI=interp2(X,Y,Z,XI,YI,<phngphp>)
Z- ma trn ch nht cha gi tr ca hm 2 bin.
X,Y-mng c cng kch thc, cha gi tr x, y cho.
XI,YI-mng cha gi tr cn ni suy.
Cc<phngphp>gm:nearest,linear,cubic

Ni suy mng nhiu chiu:

interp3 ni suy hm 3 bin.
interpn ni suy hm nhiu bin.
Phng php ny l duyt cc ma trn im nh ln lt l:
X=[-1,0,+1;-1,0,+1;-1,0,+1];
Y=[-1,-1,-1;0,0,0;+1,+1,+1];
Z=[Ibw(i-1,j-1),Ibw(i-1,j),Ibw(i-1,j+1);
Ibw(i,j-1),Ibw(i,j),Ibw(i,j+1);
Ibw(i+1,j-1),Ibw(i+1,j),Ibw(i+1,j+1)];
XI=[Ix(i,j)/NVI(i,j), -Ix(i,j)/NVI(i,j)];
YI=[Iy(i,j)/NVI(i,j), -Iy(i,j)/NVI(i,j)];

v tin hnh ni suy vi hm:

ZI=interp2(X,Y,Z,XI,YI);

Sau ta s so snh vi cc h s ca ma trn im nh Thresholding nu:

if Ibw(i, j) >= ZI(1) & Ibw(i, j) >= ZI(2);

Th:
I_temp(i,j)=I_max;

Nu ngc li:
I_temp(i,j)=I_min;

Ma trn im nh mi s c hnh thnh, hay phng php ny cn c gi l phng

php Thinning.

3.2 Chng trnh v kt qu

Chng trnh gm 10 file m. Trong gm c 3 file a ra hm Gauss nhm mc
ch lm trn nh, o hm ca hm Gauss, v hm bin i h s ca ma trn nh. Sau
l 7 file cha cc phng php ly bin ca bc nh khun mt. Trong c 5 file cha 5
k thut pht hin bin, mt file show tt c 5 phng php c s so snh, mt file th
hin nh a cp xm, nh bin i t nh gc. Sau y l chng trnh c th:
Hm Gauss vi file gauss.m:
function y = gauss(x,std)
y = exp(-x^2/(2*std^2)) / (std*sqrt(2*pi));

Hm dgauss l o hm ca hm gauss c nu ra trn vi file dgauss.m:

function y = dgauss(x,std)
y = -x * gauss(x,std) / std^2;

Hm d2dgauss l hm bin i ly bin ra bin 2D qua cc php bin i cc h s ca ma

trn nh u vo:
function h = d2dgauss(n1,sigma1,n2,sigma2,theta)
r=[cos(theta) -sin(theta);
sin(theta) cos(theta)];
for i = 1 : n2
for j = 1 : n1
u = r * [j-(n1+1)/2 i-(n2+1)/2]';
h(i,j) = gauss(u(1),sigma1)*dgauss(u(2),sigma2);
end
end
h = h / sqrt(sum(sum(abs(h).*abs(h))));

Vi cc tham s ban u c nh ngha nh sau:

Huong theo truc X:
Nx1=10;Sigmax1=1;Nx2=10;Sigmax2=1;Theta1=pi/2;
Huong theo truc Y:
Ny1=10;Sigmay1=1;Ny2=10;Sigmay2=1;Theta2=0;

Sau bc nh chn dung s c x l chuyn sang dng nh a cp xm:

[x,map]=imread('chandung.gif');
w=ind2gray(x,map);
figure(1);colormap(gray);

nh ny s c hin th trn mt ca s thng qua lng figure(1), v colormap(gray) hm

set v get mu hin ti cho bn mu. V sau vi bc nh u vo ta c bc nh a cp
xm:

ind2gray(x,map

nh u vo

nh a cp xm
H3.3 Bin thnh nh a cp xm

3.2.1 Ly bin theo trc X

Quy trnh ly bin theo trc X s c thc hin bi on m sau:
subplot(1,1,1);
filterx=d2dgauss(Nx1,Sigmax1,Nx2,Sigmax2,Theta1);
Ix= conv2(w,filterx,'same');
imagesc(Ix);
title('Ix');

Bin ly theo trc X s c hin th qua ca s th nht vi kch c ca s 1x1 thng qua
hm subplot(1,1,1), thng qua hm d2dgauss vi nhng tham s chun c a ra phng
php lc bin theo trc X s c thc hin v tip l hm tr li phn trung ca 2 phn

giao nhau thng qua hm conv2(w,filterx,same), cui cng ni dung s c hin th

thng qua imagesc(Ix) vi tiu l title(Ix). V kt qu c hin th:

Bin i theo trc X

a cp xm

Bin theo trc X

H3.4 Ly theo trc X

3.2.2 Ly bin theo trc Y

Quy trnh ly bin theo trc Y s c thc hin bi on m sau:
subplot(1,1,1)
filtery=d2dgauss(Ny1,Sigmay1,Ny2,Sigmay2,Theta2);
Iy=conv2(w,filtery,'same');
imagesc(Iy);
title('Iy');

Bin ly theo trc X s c hin th qua ca s th nht vi kch c ca s 1x1 thng qua
hm subplot(1,1,1), thng qua hm d2dgauss vi nhng tham s chun c a ra phng
php lc bin theo trc Y s c thc hin v tip l hm tr li phn trung ca 2 phn
giao nhau thng qua hm conv2(w,filtery,same), cui cng ni dung s c hin th
thng qua imagesc(Iy) vi tiu l title(Iy). V kt qu c hin th:

Bin i theo trc Y

a cp xm
Bin theo trc Y
H3.5 Bin i theo trc Y

3.2.3 Ly bin theo Gradient

Phng php Gradient l phng php ly bin trc tip vi s kt hp 2 phng php
ly bin theo trc X v trc Y trn. H s Gradient s c nh ngha theo ng di
ng cho hnh ch nht vi 2 cnh l 2 tham s Ix v Iy. V hm c nh ngha nh
sau:
Loc theo phuong phap Gradient(Ket hop loc theo truc X va Y)
subplot(1,1,1);
NVI=sqrt(Ix.*Ix+Iy.*Iy);
imagesc(NVI);
title('Norm of Gradient');

V kt qu nhn c theo phng php ny:

Ket hop loc theo truc X va Y

Bin theo Gradient

H3.6 Bin i theo Gradient

3.2.4 Ly bin theo Thresholding

Phng php Thresholding l phng php lc theo ngng v trong trng hp ny
th nhng h s ma trn Gradient m cao hn ngng th s c gi li v hin th, on
m nh sau:
I_max=max(max(NVI));
I_min=min(min(NVI));
level=alfa*(I_max-I_min)+I_min;(*)
subplot(1,1,1);
Ibw=max(NVI,level.*ones(size(NVI)));
imagesc(Ibw);
title('After Thresholding');

 y cc h s ln nht ca ma trn s c tnh, sau level(ngng) s c tnh theo

cng thc (*), sau cc h s ca ma trn s c so snh vi ngng ny v c chn
v hin th hay cn gi l phng php Thresholding, kt qu nh sau:

Bin i theo thresholding

Bin theo Gradient

Bin theo Thresholding

H3.7 Bin i theo Thresholding

3.2.5 Ly bin theo Thinning

Phng php Thinning l phc tp hn c, phng php s dng hm ni suy ma trn
vi cc ma trn 0,1 v cc ma trn cc h s ca thresholding, ma trn h s theo trc X
chia cho h s Gradient, v h s trc Y trn h s Gradient. c ni suy thng qua hm
interp2() v sau ta s so snh cc h s ca ma trn ni suy vi cc h s ca ma trn
thresholding, cc h s s c chn v hnh thnh ma trn mi, c th chng trnh nh
sau:
subplot(1,1,1);
[n,m]=size(Ibw);
for i=2:n-1,
for j=2:m-1,
if Ibw(i,j) > level,
X=[-1,0,+1;-1,0,+1;-1,0,+1];
Y=[-1,-1,-1;0,0,0;+1,+1,+1];
Z=[Ibw(i-1,j-1),Ibw(i-1,j),Ibw(i-1,j+1);
Ibw(i,j-1),Ibw(i,j),Ibw(i,j+1);
Ibw(i+1,j-1),Ibw(i+1,j),Ibw(i+1,j+1)];
XI=[Ix(i,j)/NVI(i,j), -Ix(i,j)/NVI(i,j)];
YI=[Iy(i,j)/NVI(i,j), -Iy(i,j)/NVI(i,j)];
ZI=interp2(X,Y,Z,XI,YI);
if Ibw(i,j) >= ZI(1) & Ibw(i,j) >= ZI(2)
I_temp(i,j)=I_max;
else
I_temp(i,j)=I_min;
end
else
I_temp(i,j)=I_min;
end
end
end

imagesc(I_temp);
title('After Thinning');

Sau y l kt qu chng trnh trn:

Theo thinning

Bin theo Thresholding

Bin theo Thinning

H3.8 Bin i theo Thinning

3.3 Tng kt
Vi vic s dng hm Gauss hai chiu to hiu ng m Gauss v c s dng
lm trn xy dng cc hm wavelet ng dng cho vic xc nh bin, c th trong
chng trnh ny ta dng phng php Gradient v sau s dng thm cc phng php
c pht trin ln thm theo phng php Thresholding v Thinning ta thu c nhng
ng bin khc nhau v hiu qu c tng dn theo tng phng php. iu ny s
c th hin r nt hn khi c th hin qua hnh di:

H3.9 Quy trnh bin i ly bin theo thinning

Ta thy bin c tch bit mt cch r rng hn khi qua phg php Thinning. Vi
vic lc bin nh th s rt hiu qu trong vic trch chn cc c trng khun mt, t
gip cho vic nhn dng khun mt s d dng hn.

Chng 4. KT LUN V HNG PHT TRIN

4.1 Kt lun
Vi 5 phng php pht hin bin i t n gin n phc tp, cng nh l hiu qu
tng ln theo tng phng php. Trong chng trnh ny k thut d bin trc tip c s
dng, c th l phng php Gradient. Bng cch s dng 2 cp mt n trc giao c th l 2
ma trn m bin theo trc X v ma trn bin theo trc Y. Bin c lc theo cc phng
php l c s chng ta c th trch chn nhng c trng ca khun mt, tc l ta s lc
theo ngng v kt hp nh lc theo ngng v nh lc theo bin ta s c cc c trng
khun mt. Qua qu trnh lm kha lun ti nm c cc phng php ly bin v bit
c nhng p dng ca n trong x l nh ni chung. Nhng kt qu m kha lun t
c c th tm tt nh sau:
Tch ra c bin ca khun mt vi mt bc nh u vo. C 5 phng php c
s dng.
L bc m cho cc bi ton nh trch chn c trng i tng, phn vng da
trn bin nh.
T bin nh khun mt ta c th lm cho bc chn dung mt hn bng cch tng
cng cho ng bin kt qu lin tc.

4.2 Hng pht trin

4.2.1 t vn
Pht hin v nhn dng khun mt trong nh c rt nhiu ng dng trong cuc sng.
y cng l bi ton c bn cn gii quyt trong cc h thng tng tc ngi my, quan
st m ng. Pht hin khun mt l qu trnh u tin quan trng v cn thit cho bt k
h thng x l khun mt mt cch t ng nh: nhn dng khun mt, xc nh cc thnh
phn c trng ca khun mt, kim chng xc thc khun mt.
Nhim v ca h thng pht hin khun mt nhm xc nh xem trong nh u vo c
khun mt hay khng, nu c th ch ra v tr v kch thc ca tng khun mt trong nh.
Trong hai thp nin gn y vn ny c rt nhiu cc nh khoa hc quan tm nghin
cu, v c kh nhiu cc gii php khc nhau c a ra nhm gii quyt bi ton pht
hin khun mt trong nh n v trong chui video. Tuy nhin do tnh phc tp v a dng
ca thc t mt gii php ton din v trn vn cho vn ny vn ang c nghin cu.
Ti xin a ra hng pht trin cho ca quy trnh pht hin bin khun mt trong vn

xc nh cc thnh phn c trng ca khun mt, qua nhm hng n vn pht hin
khun mt da trn cc c trng.

4.2.2 Phng php thc hin

a. Phng php nhn dng khun mt thng qua bin tp v hiu chnh to ra lp i
tng c trng:
Bc nh ta xt y l khun mt chp chung vi nhiu loi i tng, ta tin hnh
loi b cc i tng v gi li ng bin khun mt v qua rt trch cc im c
trng.
Nu nh khu vc cn tin hnh phn loi c s tch bit r rng gia cc i tng th ch
cn tin hnh phn loi khng gim st theo thut ton K-mean, cn nu nh khu vc c s
phc tp hn th cn tin hnh phn loi c gim st.
Thut ton K -mean:
Thut ton hot ng trn 1 tp vect d chiu, tp d liu X gm N phn t:
X = {xi | i = 1, 2, , N}
K-Mean lp li nhiu ln qu trnh:
Gn d liu.
Cp nht li v tr trng tm.
Qu trnh lp dng li khi trng tm hi t v mi i tng l 1 b phn ca 1 cm.
nh kt qu sau khi phn loi c tch chuyn to nh ch cha bao gm hai loi i
tng: i tng khun mt (gi s c gn cho gi tr 1) v i tng khng l khun
mt (gi s c gn cho gi tr l 0). nh ch cha hai loi i tng trn c gi vi
tn tm thi l nh A.
Tip theo, knh nh n sc c tin hnh x l lc nhm tch ly thng tin cnh
bin ca cc i tng. nh n sc sau khi x l lc bin c tin hnh to nh mi ch
cha bao gm hai loi thng tin i tng: cc i tng cnh bin (gi s c gn gi tr
l 1) v cc i tng khng l cnh bin (gi s c gn gi tr 0). V nh ny c gn
cho tn gi tm thi l nh B.
K n, tin hnh loi b cc i tng nhm ln trong lp lp i tng ca khun
mt. Thc hin php ton t hp hai knh nh A v B to ra nh kt qu mi C vi ch
rng: trong knh nh A, cc i tng c gi tr 1 l i tng ca khun mt, c gi tr 0
l cc i tng khng ca khun mt, trong knh nh B, cc i tng c gi tr 1 l cc

i tng cnh bin, c gi tr 0 l cc i tng khng phi cnh bin, v trong nh t hp

kt qu C, cc i tng c gi tr 1 l cc i tng ng khun mt cn tch ly, c gi
tr 0 th khng phi i tng ng bin khun mt. X l kt hp hai knh nh A v B
to ra knh nh C c th c m phng theo:
1 nu A = 1 v B = 0
C=
0 nu A = 0, hoc A = B = 1
Cui cng, t nh C tin hnh chuyn i cc i tng c gi tr 1 sang dng vector
bin tp v hiu chnh to ra lp i tng c trng khun mt hon chnh phc v cho
vic nhn dng khun mt ang c nghin cu.
b. Phng php nhn dng khun mt thng qua vic phn vng
Mt vng nh R l tp hp ca cc im nh c cng chung mt thuc tnh thuc v
mt i tng trong nh. Ranh gii cc vng nh l bin nh, cc ng bin khp kn cho
php cho php xc nh vng nh.
Bin c xc nh vi 2 vector vi 2 thnh phn:
- ln: xc nh bng ln ca Gradient
- Hng: hp vi hng gradient mt gc 900
Phn vng nh: L qu trnh phn hoch tp hp cc im nh X thnh cc tp con ca
cc vng nh Ri tho mn cc iu kin sau:

Cc hng tip cn:

- Da trn ng u, tng t v mc xm v cc thuc tnh ca cc pixel trong mi
vng.
- Da trn tch bin, da trn s bin thin ca hm mt sang hay mc xm.
Qu trnh nhn dng c thc hin nh i tng c x l tng cng cht lng,
lm ni bt cc chi tit, tip theo trch chn c trng da vo phn vng nh i tng, v
biu din cc c trng, cui cng l giai on nhn dng nh.

TI LIU THAM KHO

Ti liu tham kho ting Vit

[1]. Phm Vit Bnh (2007), Pht trin k thut d bin, pht hin bin v ng dng,
Lun n Tin s.
[2]. Lng Mnh B, Nguyn Thanh Thy (2002), Nhp Mn X l nh s, Nxb
Khoa hc v K thut, 2002.
[3]. Phm Vit Bnh (2006), Mt s tnh cht ca php ton hnh thi v ng dng
trong pht hin bin, Tp ch Tin hc v iu khin hc, Tp 22, s 2, 2006, 155163.
Ti liu tham kho ting Anh

[4]. J.R.Paker (1997), Algorithms for Image processing and Computer Vision. John
Wiley & Sons, Inc.
[5]. T. Pavlidis (1982), Algorithms for Graphics and Image Processing, Computer
Science Press.