B GIO DC V O TO

TRNG I HC LC HNG
***

NGUYN C NNG

NGHIN CU V XY DNG B LC NH THNG

QUA PHN LOI NH KT HP VI GOM CM

LUN VN THC S CNG NGH THNG TIN

ng Nai, 2013

B GIO DC V O TO
TRNG I HC LC HNG
***

NGUYN C NNG

NGHIN CU V XY DNG B LC NH THNG

QUA PHN LOI NH KT HP VI GOM CM

Chuyn ngnh: CNG NGH THNG TIN

M s: 60.48.02.01

LUN VN THC S CNG NGH THNG TIN

NGI HNG DN KHOA HC

TS PHM TRN V

ng Nai, 2013

LI CAM OAN
Ti xin cam oan y l cng trnh nghin cu ca bn thn. Cc s liu,
kt qu trnh by trong lun vn ny l trung thc. Nhng t liu c s dng
trong lun vn c ngun gc v trch dn r rng, y .

Hc vin

Nguyn c Nng

II

LI CM N
Ti xin by t lng bit n su sc n TS Phm Trn V hng dn
nhit tnh, tn tm trong sut qu trnh ti thc hin lun vn ny.
Ti xin chn thnh cm n Qu thy c trong Khoa Cng ngh thng tin
trng i hc Lc Hng to iu kin thun li cho ti trong sut thi gian
hc tp v nghin cu ti trng.
Ti cng xin chn thnh cm n Qu thy c ngoi trng tn tm dy
bo ti trong sut qu trnh hc tp v gip ti trong qu trnh nghin cu.
Xin chn thnh cm n nhng ngi thn trong gia nh, cng cc anh ch
em, bn b, ng nghip gip , ng vin ti trong qu trnh thc hin v
hon thnh lun vn ny.

ng Nai, ngy 12 thng 12 nm 2012

Hc vin

Nguyn c Nng

III

MC LC
LI CAM OAN ...........................................................................................I
LI CM N .............................................................................................. II
MC LC .................................................................................................. III
DANH MC HNH .................................................................................... VI
DANH MC BNG .................................................................................VIII
DANH MC CC T VIT TT .............................................................. IX
M U ...................................................................................................... 1
CHNG 1: TNG QUAN V PHN LOI HNH NH. ........................ 4
1.1.

Tng quan v phn loi hnh nh. ................................................ 4

1.1.1. Gii thiu v bi ton phn loi. ............................................. 4

1.1.2. Tng quan. ............................................................................... 4
1.2.

Quy trnh phn loi nh. ............................................................... 9

CHNG 2: CC PHNG PHP TRCH CHN C TRNG V

O TNG NG GIA CC NH. ..................................................... 10
2.1.

Harris. ......................................................................................... 10

2.2.

SIFT (Scale Invarian Feature Transform) .................................. 12

2.2.1. Pht hin cc tr. ................................................................... 12

2.2.2. nh v chnh xc im kha ................................................. 15
2.2.3. Gn hng cho cc im kha .............................................. 18
2.2.4. Xy dng b m t cc b ..................................................... 19
2.3.

Harris-Laplace ............................................................................ 21

2.3.1. Khng gian t l..................................................................... 21

2.3.2. Hm Harris thch nghi t l ................................................... 24
2.3.3. S la chn t l t ng ....................................................... 25
2.3.4. Thut ton pht hin im bt ng ...................................... 26
2.4.

Harris-Affine ............................................................................... 28

2.4.1. Mc tiu ................................................................................. 29

2.4.2. Ma trn Moment cp hai Affine............................................. 29
2.4.3. K thut pht hin im bt ng.......................................... 33

IV

2.5.

Phng php SURF (Speed Up Robust Feature) ....................... 39

2.5.1. nh tch hp (integral image) ............................................... 40

2.5.2. Pht hin Fast-Hessian: ........................................................ 40
2.5.3. S biu din khng gian t l: ............................................... 42
2.5.4. nh v im quan tm........................................................... 43
2.5.5. B m t im quan tm v so khp...................................... 44
2.6.

So snh - Kt lun ....................................................................... 49

2.7.

La chn c trng. .................................................................... 51

CHNG 3: CC PHNG PHP PHN LOI NH. ......................... 55

3.1.

Tng quan. .................................................................................. 55

3.2.

Cc phng php phn loi nh. ............................................... 57

3.2.1. Phng php phn loi K-Means. (tham kho web) ............ 57
3.2.2. Phng php php Nave Bayes (NB)................................... 62
3.2.3. Phng php Support Vector Machine (SVM) ..................... 64
3.2.4. Phng php K-Nearest Neighbor (KNN) ............................ 65
3.2.5. Phng php Linear Least Square Fit (LLSF) ..................... 66
3.2.6. Phng php Centroid based vector .................................. 67
3.2.7. Kt lun.................................................................................. 68
CHNG 4: NG DNG C TRNG BT BIN KT HP K-MEAN
TRONG PHN LOI NH. ....................................................................... 69
4.1.

Bi ton phn loi nh................................................................ 69

4.1.1. M hnh bi ton phn loi nh ............................................ 70

4.1.2. Thut ton s dng:............................................................... 70
4.2.

Hin thc bi ton ...................................................................... 73

4.2.1. Mi trng ............................................................................. 73

4.1.2. Cng c s dng .................................................................... 73
4.1.3. D liu ................................................................................... 74
4.1.4. Chng trnh ......................................................................... 74
4.1.5. nh gi. ............................................................................... 77
KT LUN V KIN NGH. ..................................................................... 80

VI

DANH MC HNH
Hinh 1.1: Quy trnh hun luyn nh. ........................................................... 9
Hnh 1.2: Quy trnh kim th nh. ............................................................... 9
Hnh 2.1. M phng vic tnh ton cc DoG nh t cc nh k m ......... 13
Hnh 2.2: Mi im nh c so snh vi 26 lng ging ca n.............. 14
Hnh 2.3. Cc giai on la chn cc im kha. .................................... 16
Hnh 2.4. B m t im kha ................................................................... 19
Hnh 2.5. Mt th hin a t l ca mt tn hiu ....................................... 22
Hnh 2.6. Cc mc khc nhau trong mt th hin khng gian t l .......... 23
Hnh 2.7. V d v cc t l c trng ....................................................... 26
Hnh 2.8. Pht hin im quan tm bt bin t l ..................................... 28
Hnh 2.9. im quan tm bt bin t l trong cc nh b bin i affine . 30
Hnh 2.10. Biu gii thch php chun ha affine ................................ 32
Hnh 2.11. Pht hin lp li ca mt im quan tm bt bin affine........ 37
Hnh 2.12. Pht hin im quan tm bt bin affine ................................. 39
Hnh 2.13: T tri sang phi: o hm ring bc hai ca hm Gaussian 41
Hnh 2.14: Thay v lp li vic gim kch c nh (bn tri), vic s dng
nh tch hp cho php tng t l lc vi gi tr khng i (bn phi)................. 42
Hnh 2.15: Biu t l pht hin. S lng im quan tm c pht
hin trn mi octave phn r nhanh chng.......................................................... 43
Hnh 2.16: Nhng im quan tm c pht hin trn mt cnh ng hoa
hng dng. ....................................................................................................... 44
Hnh 2.17: Php lc Haar wavelet tnh ton c trng x (bn tri) v
y hng (bn phi). Vng en c trng s -1 v vng trng c trng s +1 ...... 45
Hnh 2.18: Gn hng: mt ca s dch hng ca kch thc 3 pht
hin hng tri ca cc c trng Haar wavelet c trng s Gaussian mi
im mu trong vng trn lng ging quanh im quan tm. ............................. 46
Hnh 2.19: Chi tit ca nh Graffiti th hin kch thc ca ca s b m
t hng cc t l khc nhau. ........................................................................... 46
Hnh 2.20: xy dng b m t, mt khung li hng bc hai vi 4x4
vng con hnh vung c t trn cc im quan tm (bn tri). mi hnh
vung c trng wavelet c tnh ton. S chia nh 2x2 ca mi hnh vung
tng ng vi cc trng thc ca b m t. Nhng ci ny l tng ca dx, dy,
|dx| v |dy|, tnh ton tng i hng ca li (bn phi)................................ 47
Hnh 2.21. Cc mc m t ca min con i din cho tnh cht ca mu
cng c bn. Hnh tri: trong trng hp ca mt min con ng nht, tt
c cc gi tr l tng i thp. Hnh gia: s c mt ca tn s trong x hng,

VII

gi tr ca l cao, nhng tt c cc trng hp khc vn thp. Nu cng

tng dn theo x hng, c v u cao. ..................................................... 48
Hnh 2.22: Nu tng phn gia hai im quan tm khc nhau (ti trn
nn sng vi sng trn nn ti), ng vin s khng c xem l so khp c gi
tr. ......................................................................................................................... 49
Hnh 2.24: So snh v gc nhn (Bn tri). nh so snh (bn phi) ......... 50
Hnh 2.25: So snh v cng sng (Bn tri). nh so snh (bn phi)50
Hnh 2.26: So snh v t l (Bn tri). nh so snh (bn phi) ................ 51
Hnh 3.1: M hnh SVM ............................................................................. 64
Hnh 4.1. V d v bi ton phn loi nh ................................................. 69
Hnh 4.2. S chc nng nhn dng i tng ...................................... 70
Hnh 4.3: Phng php SURF................................................................... 71
Hnh 4.4: Phng php Hessian-Laplace ................................................. 71
Hnh 4.4: Phng php SIFT .................................................................... 72
Hnh 4.5: giao din chng trnh. ............................................................. 74
Hnh 4.6: Cng on rt trch c trng. ................................................. 75
Hnh 4.7: mt phn gc nhn ca tp c trng. ...................................... 75
Hnh 4.8: Cng on phn cm cc c trng. ........................................ 76
Hnh 4.9: Sau khi phn thnh 2 cm. ........................................................ 76
Hnh 4.10: c trng nhm 1 (class1.lhu). ............................................... 77
Hnh 4.11: Kt qu kim th...................................................................... 77

VIII

DANH MC BNG
Bng 2.1: Mt s phng php la chn c trng. ................................ 52
Bng 4.1: Bng so snh kt qu cc phng php ................................... 72
Bng 4.2: Mi trng thc nghim ........................................................... 73
Bng 4.3: Cng c m ngun m s dng ................................................ 73
Bng 4.4: 4 nhm nh v s lng mu dng trong thc nghim. ........... 78
Bng 4.5: Kt qu kim chng sau khi chy chng trnh. ...................... 79
Bng 4.6: Xc sut ca chng trnh. ....................................................... 79

IX

DANH MC CC T VIT TT

T vit tt

ngha

KNN

K-Nearest Neighbor

LLSF

Linear Least Square Fit

LDA
MM
NB

SVM
TF

Latent Drichlet Allocation

Maximum Matching
Nave Bayes

Support Vector Machine

ROI

Term Frequency

SIFT

Scale-invariant feature transform

SURF

Speeded-up Robust Features

BAN

Bayesian Networks Augmented Naive Bayes

NBC

Naive Bayes Classifiers

PCA

Principal Components Analysis

JSD

Jensen-Shannon divergence

DoG

difference-of-Gaussian

BDA

biased Discriminant analysis

MDA

Mutiple Discriminant analysis

DA

Regions Of Interest

Discriminant analysis

SMMS

symmetric maximized minimal distance in

subspace

CBIR

Content-based image retrieval

BOF

Bags of Features

BOW

Bags of Words

CLDA

Constrained linear discriminant analysis

VQ

Vector-Quantization

M U
Trong nhng nm gn y, s pht trin vt bc ca Cng ngh thng tin
lm tng s lng giao dch thng tin trn mng Internet mt cch ng k c bit l
th vin in t, tin tc in t, hnh nh, Do m s lng vn bn cng nh
hnh nh xut hin trn mng Internet cng tng vi mt tc chng mt, v tc
thay i thng tin l cc k nhanh chng. Vi s lng thng tin s nh vy, mt
yu cu ln t ra l lm sao t chc v tm kim thng tin, d liu c hiu qu nht.
Bi ton phn lp l mt trong nhng gii php hp l cho yu cu trn. Nhng mt
thc t l khi lng thng tin qu ln, vic phn lp d liu th cng l iu khng
th. Hng gii quyt l mt chng trnh my tnh t ng phn lp cc thng tin
d liu trn.
Trong cc loi d liu th hnh nh l loi d liu ph bin m con ngi
thng gp phi. Chnh v l m hng Google a thm chc nng tm kim
hnh nh vo th vin chc nng ca mnh, cc cng c tm kim hnh nh ngy
cng tng ln. Nhm tng s lng truy cp, h khng ngng pht trin module
tm kim hnh nh cng nh cc module khc ca mnh. Vy h lm ra sao vi
khi lng hnh nh s n nh vy ?. M hnh biu din hnh nh ph bin
hin nay l m hnh khng gian vector, trong mi hnh nh c biu din bng
mt vector ca cc im c trng (keypoint). Tuy nhin bi ton khai ph d liu
hnh nh thng gp phi mt s kh khn nh tnh nhiu chiu ca nh, nhiu
ca nh, bin dng ng thi, khi x l cc bi ton phn lp t ng th
cng gp phi mt s kh khn l xy dng c b phn lp c tin cy cao
i hi phi c mt lng cc mu d liu hun luyn tc l cc hnh nh c
gn nhn ch lp tng ng. Cc d liu hun luyn ny thng rt him v t
v i hi thi gian v cng sc ca con ngi. Do vy, cn phi c h thng x l
hnh nh hiu qu v mt phng php hc khng cn nhiu d liu c phn loi
v c kh nng tn dng c cc ngun d liu cha phn loi rt phong ph nh
hin nay. Nhn thy y l lnh vc mang tnh khoa hc cao, ng dng rt nhiu
trong cc bi ton thc t v d nh: ng dng lc ni dung nh, bi ton phn lp

sau tm kim, Tc gi quyt nh chn ti Nghin cu v xy dng b lc

nh thng qua phn loi nh kt hp vi gom cm. l mt vic lm khng ch
c ngha khoa hc, m cn mang tnh thc tin.
Trong lun vn s trnh by mt s thut ton phn lp tiu biu v a ra
hng thc nghim cho h thng phn lp.
Lun vn p dng phn tch thnh phn c trng bt bin ca tm nh c th
l thut ton Scale-invariant feature transform (SIFT) phc v cho vic tin hnh
rt ly nhng c trng bt bin ca nh sau dng gii thut clustering tin
hnh phn lp. Thc nghim cho thy chnh xc tng i, ph hp p dng
vo h thng phn lp t ng.
Mc tiu ca lun vn:
- Nghin cu cc k thut x l hnh nh ly ra c cc vector c trng.
- Nghin cu cc phng php gom cm d liu in hnh l K-Means nhm
mc ch phn nhm cc c trng thnh cc nhm ring l.
- Xy dng ng dng hin thc cho vic phn loi nh vo cc nhm nh theo
ni dung.
- nh gi v a ra kin ngh cho ti.
i tng nghin cu: Cc tp tin hnh nh.

Phm vi nghin cu: Phn loi hnh nh vo cc th loi tng ng vi ni

dung tm nh. Trong khun kh lun vn cc th loi c nghin cu x l cn t
cha c phong ph.
Nhng vn cn gii quyt trong phm vi lun vn:
-

Tm hiu tng quan v vn cn nghin cu.

Tm hiu cch thc tng tc vi tp tin nh rt ra c trng.
Tm hiu cc gii thut clustering.
Xy dng b d liu dng hun luyn my.
Xy dng quy trnh phn loi nh.
Hin thc quy trnh phn loi nh.
B cc trnh by ca lun vn:

Chng 1: Gii thiu tng quan v bi ton phn loi nh v a ra quy trnh
phn loi.

Chng 2: Trnh by cc phng php trch chn c trng v o tng

ng gia cc nh phc v cho bi ton.
Chng 3: Trnh by cc phng php phn loi nh.
Chng 4: Thc nghim v nh gi chng trnh.
Kt lun nhng im chnh, ch ra nhng im cn khc phc ng thi t
ra hng pht trin.

CHNG 1: TNG QUAN V PHN LOI HNH NH.

1.1. Tng quan v phn loi hnh nh.
1.1.1. Gii thiu v bi ton phn loi.
Phn loi hnh nh l mt trong nhiu lnh vc c ch nht v c
nghin cu trong nhng nm gn y.
Phn loi hnh nh (hay Image Classification hoc Image Categorization)
l qu trnh gn cc nh vo mt hay nhiu lp nh c xc nh t trc.
Ngi ta c th phn loi nh bng cch th cng, tc l nhn vo ni dung tm
nh sau gn chng vo mt hay nhiu lp c th no . H thng qun l tp
tin nh gm nhiu nh cho nn vic lm ny s tn rt nhiu thi gian, cng sc
v do l khng kh thi. Do vy m phi c cc phng php phn loi t
ng. phn loi t ng, ngi ta s dng cc phng php my hc trong tr
tu nhn to nh cy quyt nh, Nave Bayes, K lng ging gn nht, gii thut
clustering,
Mt trong nhng ng dng quan trng nht ca phn loi nh t ng l
ng dng trong cc h thng tm kim nh. T mt tp con cc nh phn lp
sn, tt c cc nh trong min tm kim s c x l rt ra nhng vector c
trng sau c a qua clustering hnh thnh cc nhm c trng v c
gn nhn lp tng ng.
Mt ng dng khc ca phn loi nh l trong lnh vc hiu nh. Phn loi
nh c th c s dng nhm cc nh vo cc nhm m ni dung tm nh
cp. Bt lun tm nh c b xoay, co gin, hay ni cch khc l hnh nh c b
nhiu.
Trong phn loi nh, s tng ng gia mt nh vi mt lp hoc thng
qua vic gn gi tr ng sai (True nh thuc lp, hay False nh khng thuc
lp) hoc thng qua mt ph thuc (o ph thuc ca nh vo lp). Trong
trng hp c nhiu lp th phn loi ng sai s l vic xem mt nh c thuc
vo mt lp duy nht no hay khng.
1.1.2. Tng quan.
X l nh, phn loi nh trong nhng nm gn y l lnh vc ang c
gii khoa hc quan tm khng nhng trong nc m cn ngoi nc. Cc cng
trnh lin quan n vn x l nh c bit l phn loi nh c cng b
nh sau:

Ngoi nc:
ti Beyond Bags of Features: Spatial Pyramid Matching for
Recognizing Natural Scene Categories ca ng tc gi Svetlana
Lazebnik, Cordelia Schmid, Jean Ponce. [2]
Trong ti ny tc gi a ra phng php xc nh loi quang
cnh da vo xp x hnh hc ton cc. Trong nhng nm gn th cc
cng trnh nghin cu a ra cc khi nim v c trng cc b v c
trng ton cc nhng vic tnh ton trn cc c trng ny cn gp rt
nhiu hn ch v l do c rt nhiu c trng trong mt bc nh khin cho
vic tnh ton tr nn phc tp v hao tn nhiu ti nguyn h thng.
Chnh v l m cc tc gi trong ti [2] nghin cu v a ra khi
nim Bags of Features hay Bags of Words (BOF hay BOW) nhm mc
ch gim thiu thi gian tnh ton cho h thng.
Bi bo Boosting Image Classification with LDA-based Feature
Combination for Digital Photograph Management ca ng tc gi
Xuezheng Liu, Lei Zhang, Mingjing Li, Hongjiang Zhang, Dingxing
Wang. [3]
c s dng thut ton LDA gn tn lp cho nhng thuc tnh
m rt ra c. LDA SVM thng c thy trong cc ti tnh
ton hoc lm vic trn vn bn. LDA dng gn nhn vo cc c trng
sau cc c trng s c tnh ton v phn vo cc nhm theo mt
tiu ch no nh vo SVM. Trong ti [3] cc tc gi dng LDA
cho vic gn nhn cc c trng hnh nh nhm mc ch trnh s dng
thut ton phn cm, mt trong nhng nguyn nhn gy hao tn ti
nguyn h thng khi phi lm vic trn mt s lng ln cc c trng.
Bi bo Unsupervised real-time constrained linear discriminant analysis
to hyperspectral image classification, Qian Du, Department of Electrical
and Computer Engineering, Missisippi State University, MS 39762, USA.
Accepted 14 August 2006. [17]
Khi s lng cc c trng tr ln nhiu th vic tnh ton s gp
nhiu kh khn tc gi Qian Du [17] ci thin c thut ton CLDA
theo cch khng gim st nhm mc ch cc c trng c phn vo cc
nhm trong khi cc khi nim nhm l cha c. Vn d CLDA l mt
phng php c gim st tc l cc c trng cn c gn cho mt trng
s, mt nhn no m c khi nim trc . Trong thc t th vic
lm ny gp kh khn v phi phn nh r rng trng s hay tn nhm
trc.

Bi bo SVM-KNN: Discriminative Nearest Neighbor Classification for

Visual Category Recognition ca ng tc gi Hao Zhang, Alexander C.
Berg, Michael Maire, Jitendra Malik thuc khoa khoa hc my tnh trng
i hc Berkeley, California. [15]
Vi mi nh cn phn loi s rt ra nhng c trng sau ly ra
vng ln cn ca cc im c trng ny v tnh ton khong cch cho cc
c trng, dng thut ton KNN-SVM tnh trng s cho cc im c
trng . Vi mi nh cn phn loi s tm ra trong c s d liu k lng
ging gn nht gn nht, nu mi nh ny thuc vo mt nhm th s kt
thc tin trnh phn loi, ngc li dng SVM cho k im c trng .
l tng ca bi bo [15] nhng khi thc hin li gp phi kh khn
l vic tnh c k lng ging gn nht li tr ln lu v hao tn nhiu ti
nguyn my tnh.
Bi bo Image Classification using Super-Vector Coding of Local Image
Descriptors ca tc gi XiZhou, Kai Yu, Tong Zhang, Thomas S.
Huang.[9]
Trong bi bo tc gi xut mt phng thc mi trong vic
phn loi nh l s dng vector miu t nh cc b. Cng vic c
thc hin bng cch tm ra cc nhm c trng i din cho mt bc nh.
Phng php phn loi nh tri qua 3 bc: M t m ha, tnh ton
khng gian tng hp, v phn loi nh. Trong vic m t m ha ca mt
tm nh c nh x phi tuyn tnh to ra mt vector vi s chiu ti
thiu, trong bi bo c xut mt phng php tam gi l Super-vector
m ha, thut ton l mt m rng ca Vector-Quantization (VQ). bc
tnh ton khng gian tng hp, i vi mi khu vc a phng, cc m
ha ca tt c cc m t trong c tng hp li to thnh mt
vector duy nht sau cc vector ny c tng hp li to thnh c s
dng tnh ton tng ng gia cc miu t cc b. SVMs tuyn
tnh l cch thc c chn trong bi bo ny dng phn loi nh.
ti Object Recognitionusing Local Descriptors ca tc gi Javier
Ruiz v Patricio Loncomila thuc trung tm nghin cu khoa hc
Chile.[10]
Trong ti tc gi s dng c trng cc b bt bin xc
thc i tng trong nh, mc ch chnh l dng tm nh v cng
a ra cch xy dng c s d liu ci tin tc tm kim l s
dng Kd-trees.

Bi bo Object Recognition from Local Scale-Invariant Features ca tc

gi David G. Lowe, thuc khoa khoa hc my tnh, trng i hc British
Columbia. [9]
David G. Lowe cng chnh l tc gi a ra khi nim v c trng
cc b bt bin Local Scale-Invariant Features (SIFT), c ng dng
nhiu trong cc bi ton truy tm nh, phn loi nh v xc thc.
Cc c trng hnh nh bao gm nhiu loi: mu sc, kt cu, hnh
dng, tuy nhin cc c trng ny t nhiu li ph thuc vo khng gian
nh, bin i nh.
Trong cng vic xc nh i tng trong nh, tc gi lu tr cc
c trng v nh ch mc cho chng khi cc nh tham gia truy vn s
c rt ra cc c trng SIFT v em ra so snh vi cc c trng c
trong c s d liu. Vic lm ny s lm hao tn rt nhiu thi gian tnh
ton ca h thng.
Bi bo Texture classification of aerial image based on bayesian network
augmanted nave bayes, YU Xin, ZHENG Zhaobao, ZHANG Haitao, YE
Zhiwei. [16]
Bi bo c s so snh hai phng thc Bayesian Networks
Augmented Naive Bayes (BAN) v Naive Bayes Classifiers (NBC) and
PCA-NBC trong phn loi nh v nhn thy BAN chy tt hn NBC v
PCA-NBC.
Bi bo Speeded-up Robust Features (SURF), Herbert Bay, Andreas Ess,
Tinne Tuytelaars, Luc Van Gool, 12/2007. [14]
Bi bo vi mong mun thay th c trng SIFT bng SURF v s
dng ma trn Hessian o b pht hin c trng, nhm ng dng trong
cc h thng camera.
Bi bo Recognizing Indoor Scenes, Ariadna Quattoni, Antonio
Torralba.[12]
Trong khi cc cng c xc nh quang cnh ch tp trung khng
gian ngoi tri th bi bo chn khng gian trong nh xc nh, v
nhng nhc im ca cc cng c xc nh loi quang cnh ngoi tri s
km linh hot trong khng gian trong nh, tc gi bi bo a ra mt
phng thc hin i l Regions Of Interest (ROI), tm gi vng c
trng bng cch di chuyn khung i chiu c lp vi nhau.
Bi bo Combining Local and Global Image Feature for Object Class
Recognition ca tc gi Dimitri A. Lisin, Marwan A. Mattar, Matthew B.
Blaschko, Mark C. Benfield, Erik G. Learned-Miller. [4]

Bi bo nu ra rng cc c trng ton cc hay cc b u c th

dng xc nh i tng trong tm nh.
Cc ti trn mi mt ti mnh v mt im nhng cha thc
s a ra c cch ti u trn mt tp nh ln. Vi cc nh dng nh
*.PNG, *.PGM th c trng SIFT c rt ra nhanh, nhng vi nh dng
*.JPG th cn l tr ngi. ng thi trong vic i snh hai nh vi nhau
SIFT cn hn ch v mt thi gian thc hin do s lng tp key point cn
qu ln.

Trong nc:
Trong nc tuy cn t ti nghin cu v lnh vc phn loi nh, m ch
tp chung ch yu vo nghin cu cc cng c i snh nh, tm nh nhng c
s dng cc c trng bt bin cng cc k thut phn cm v cy quyt nh.
in hnh cho vn ny c cc bi bo sau:
ti Gii thiu ng dng phng php phn loi da trn i tng
(Object-based classification) trong thnh lp bn rng t nh v tinh,
Ts. V Anh Tun. [18]
y l ti phn loi nh da vo phng php phn loi c
kim nh v phn loi da vo decision tree.
ti phng php trch chn c trng nh trong thut ton hc my
tm kim nh p dng vo bi ton tm kim sn phm, Nguyn Th
Hon. [20]
ti c gii thiu v ng dng c trng SIFT cho bi ton ca
mnh.
ti Xc nh cm xc mt ngi, Trn Ngc Phm. [21]
ti s dng PCA trn tp hun luyn nh rt trch c
trng. Phng php AdaBoost v c trng Haar-like c p dng
hun luyn cc b phn loi.
ti Nghin cu phng php kt hp cc c trng mu sc hnh dng
v v tr truy vn nh lun vn thc s ca tc gi Trn Sn Hi, nm
2007 [19].
Lun vn ny xut mt phng php kt hp cc c trng
mu sc, hnh dng v v tr bng h thng lin mng meta-Nron. H
thng lin mng meta-Nron khng nhng p dng vo cc c trng mu
sc, hnh dng v v tr ca nh m cn c th p dng cho cc c trng
lng t khc. Cc c trng lng t bt k rt trch t nh s qua cc

mng Nron con cho ra cc output cc b. Cc output ca cc mng con

s l ng vo ca mng meta-Nron cho ra cc kt qu output cui
cng ca ton h thng lin mng.
1.2. Quy trnh phn loi nh.

Hinh 1.1: Quy trnh hun luyn nh.

Hnh 1.2: Quy trnh kim th nh.

i vi tp hun luyn th s lng nh cn nhiu v th tin trnh hun
luyn s rt lu. im quan trng nm ch rt c trng, phi xc nh c
trng thch hp cho bi ton v nh hng n chnh xc ca chng trnh.

10

CHNG 2: CC PHNG PHP TRCH CHN C

TRNG V O TNG NG GIA CC NH.
Chng ny trnh by mt s k thut c s dng hiu qu trong cch
tip cn xc nh cc im bt bin trong nh nhm trch chn cc c trng
bt bin ca i tng v s dng cc c trng ny trong vic so khp, nhn
dng i tng. Ngoi ra cc im ny tc gi cng s dng nhm mc ch
phn loi nh theo nh mc tiu ca cun bo co.
Trong nhng nm gn y vic s dng cc c trng cc b tr thnh
mt trong nhng hng tip cn c nh hng ln trong vic nhn dng i
tng da vo ni dung nh. Vic pht hin cc im c bit l bc u tin
trong qu trnh so khp v nhn dng. V vy, mt thut ton ng tin cy cho
vic trch chn cc im bt bin l rt cn thit cho nhiu ng dng. Chng
ny trnh by mt s k thut mi cho vic trch chn cc im bt ng trong
nh. Cc hng tip cn ny bt bin i vi cc php bin i hnh hc v php
bin i trc quang. y cng nhn mnh vn bt bin i vi php bin i
affine.
2.1. Harris.
Pht hin gc (corner detection) hoc mt thut ng tng qut hn l pht
hin im quan tm (interest point detection) l mt hng tip cn c s
dng trong cc h thng th gic my tnh trch chn cc loi c trng v suy
lun ra cc ni dung ca mt nh. Vic pht hin gc c dng thng xuyn
trong pht hin, theo di chuyn ng, m hnh 3D v nhn dng i tng.
Mt gc c xc nh bi ni giao nhau ca hai cnh. Mt gc cng c
th c xc nh nh mt im c hai hng khc nhau trong mt vng cc b
ca im . Mt im quan tm l mt im trong mt nh m im ny c v
tr c xc nh tt v c th c pht hin nhanh chng. iu ny c ngha l
mt im quan tm c th l mt gc nhng cng c th l mt im n c gi
tr cng cc i hoc cc tiu cc b, cc im kt thc ca ng thng
hoc mt im trn mt ng cong m cong l ti a cc b. Trn thc
t, hu ht cc phng php pht hin gc pht hin cc im hn l cc gc ni
ring.
Phng php pht hin gc Harris l mt phng php pht hin im
quan tm ph bin v n bt bin i vi php quay, thay i sng v tp
nhiu nh. Phng php ny da trn hm tng quan t ng cc b ca mt

11

tn hiu; hm tng quan t ng cc b o cc thay i cc b ca tn hiu

vi cc mnh nh c dch chuyn mt lng nh theo cc hng khc nhau.
Cho trc s dch chuyn (x, y) v mt im (x,y), hm tng quan t
ng c nh ngha nh sau:
(, ) = [( , ) ( + x, + y)]2

(2.1)

Trong I(,) biu th hm nh v (x i ,yi ) l cc im trong ca s W t

v tr (x,y). nh c dch chuyn c xp x bi php khai trin Taylor c
lt bt thnh cc hng thc bc nht
( + x, + y) I( , ) + [ ( , ) ( , )]

(2.2)

y I x (,) v I y(,) biu th cc o hm tng phn tng ng theo x v

y.
Th cng thc (2.2) vo (2.1), ta c:
(, ) = [ ( , ) ( + x, + y)]2

x 2
= ( , ) ( , ) [ ( , ) ( , )]
y

x 2
= [ ( , ) ( , )]
y

x 2
= [ ( , ) ( , )]
y

( , )

= [x y]
( , ) ( , )

x
= [x y](, )
y

( , ) ( , )

( , )

x

y

y ma trn C(x,y) bt gi cu trc cng ca mt vng ln cn cc

b quanh im (x,y). Ly 1 , 2 l cc gi tr ring ca ma trn C(x,y). Cc gi
tr ring ny to nn mt s m t bt bin i vi php quay. C 3 trng hp
cn c xt:
1. Nu c 1, 2 u nh, hm tng quan t ng cc b khng thay
i (tc l t thay i ti c(x,y) theo bt k hng no) th vng nh nm trong

12

ca s gn nh khng thay i v cng . Tc l trong trng hp ny, khng

c im quan tm no c tm thy ti im nh (x,y).
2. Nu mt gi tr ring l ln v mt gi tr ring l nh, th ch c cc
dch chuyn cc b theo mt hng (dc theo nh ) gy nn s thay i nh
c(x,y) v thay i ng k hng trc giao, iu ny biu th cho mt cnh.
3. Nu c hai gi tr ring u ln, th cc s dch chuyn theo bt k
hng no cng s a n kt qu l lm tng ng k; iu ny biu th cho
mt gc.
Thut ton ny n gin d hiu, pht hin c nhanh chng cc im
quan tm trong nh tuy nhin phng php ny khng bt bin i vi vic thay
i t l v cc php bin i affine.
2.2. SIFT (Scale Invarian Feature Transform)
y l mt trong nhng phng php hiu qu trch chn cc im bt
bin t cc nh c dng thc hin so khp tin cy gia cc tm nhn khc
nhau ca cng mt i tng hoc quang cnh. Phng php ny c gi l
Php bin i c trong bt bin t l (Scale Invariant Feature Transform
SIFT) v n bin i d liu nh thnh cc ta bt bin t l c lin quan ti
cc c trng cc b. Thut ton ny gm 4 giai on chnh: pht hin cc cc tr
trong khng gian t l, nh v chnh xc im kha, gn hng cho cc im
kha, xy dng c trng.
2.2.1. Pht hin cc tr.
Giai on u tin ca pht hin im kha l tm ra cc v tr v cc t l
c th c gn lp i lp li di cc tm nhn khc nhau ca cng mt i
tng. Vic pht hin cc v tr bt bin khi c s thay i t l ca nh c th
c thc hin bng vic tm kim cc c trng n nh qua tt c cc t l c
th, s dng mt hm lin tc t l c hiu nh khng gian t l.
Dng hm Gaussian lm hm nhn ca khng gian t l. V vy, khng
gian t l ca mt nh c xc nh bi hm L(x,y, ), hm ny c to ra t
php cun Gaussian bin thin t l, G(x,y, ), vi nh u vo I(x,y):
(, , ) = (, , ) (, )

trong * l php ton cun theo x v y, v

(, , ) =

1
( 2 + 2 )22

22

13

pht hin hiu qu cc v tr im kha n nh trong khng gian t l,

ta s dng cc cc tr khng gian t l trong hm Difference-of-Gaussian c
cun vi nh , D(x,y, ), hm ny c th c tnh t s chnh lch gia hai t
l ln cn c phn bit bi tha s k:
D(x,y,) = (G(x,y,k) - G(x,y,))*I(x,y) = L(x,y,k ) L(x,y, )

(2.3)

Hnh 2.1. M phng vic tnh ton cc DoG nh t cc nh k m

Hnh 2.1 th hin mt phng php hiu qu cho vic xy dng hm
D(x,y, ). nh ban u c cun theo kiu gia tng vi cc hm Gaussian
to ra cc nh c phn bit bi tha s k trong khng gian t l, c xp
thnh chng ct bn tri. Ta chia mi qung ca khng gian t l (ngha l gp
i ) thnh s khong (s l s nguyn), v vy k = 21/s. Chng ta phi to ra s+3
nh trong chng cc nh b lm m cho mi qung, vic pht hin cc tr cui
cng bao ph trn vn mt qung. Cc t l nh gn k c tr vi nhau to
ra cc nh Difference-of-Gaussian c th hin hnh bn phi. Mt khi mt
qung trn vn c x l, chng ta ti ly mu nh Gaussian gp i gi tr ban
u v vic x l c lp li.

14

Hnh 2.2: Mi im nh c so snh vi 26 lng ging ca n

tm gi tr cc i v cc tiu a phng ca hm D(x,y, ), mi im
mu c so snh vi 8 lng ging trong nh hin thi v 9 lng ging trong t l
trn v di (Hnh 2.2). N c chn ch khi ln hn tt c cc lng ging
ny hoc nh hn tt c chng. Chi ph ca s kim tra ny l kh nh v trn
thc t hu ht cc im mu s b loi b sau vi ln kim tra u tin.
2.2.1.1. Tn s ly mu theo t l
S xc nh thc nghim ca tn s ly mu lm tng ti a tnh n nh
ca cc cc tr. xc nh tn s ly mu ngi ta s dng mt b su tp gm
32 nh thc gm nhiu loi khc nhau, bao gm cc cnh ngoi tri, cc mt
ngi, cc bc nh trn khng v cc nh k ngh. Sau mi nh phi chu mt
dy cc php bin i, bao gm php quay, thay i t l, thay i sng v
tng phn, v thm tp nhiu nh. Bi v cc thay i ny l khng t nhin,
nn c th d on chnh xc ni m mi c trng trong nh gc s xut hin
trong nh bin i, ch n php o tnh lp li v chnh xc v tr i
vi mi c trng. Kt qu l, kh nng lp li cao nht c t n khi ly
mu 3 t l cho mi qung.
Thc nghim cho thy kh nng lp li ca cc im kha khng tng khi
nhiu t l hn c ly mu. L do l v c nhiu cc tr a phng hn c
pht hin, nhng tnh trung bnh cc cc tr ny t n nh v v vy t c kh
nng c pht hin trong nh b bin i. S lng cc im kha tng ln
cng vi vic ly mu tng ca cc t l v tng s lng cc so khp chnh xc
cng tng. V s thnh cng ca vic nhn dng i tng thng ph thuc
nhiu vo s lng cc im kha c so khp chnh xc, ch khng phi t l

15

phn trm so khp chnh xc ca chng, nn i vi nhiu ng dng, s ti u

hn khi s dng mt lng ln cc mu t l. Tuy nhin, chi ph tnh ton cng
tng cng vi s lng ny, v vy qua thc nghim chng ta ch cn chn 3 mu
t l trn mi qung.
Tm li, cc th nghim cho thy rng hm Difference-of-Gaussian ca
khng gian t l c mt lng ln cc cc tr v s tn nhiu chi ph pht hin
tt c chng. May thay, chng ta c th pht hin c mt tp con n nh v
hu ch nht thm ch khi vic ly mu t l tr nn ti.
2.2.1.2. Tn s ly mu trong mt vng khng gian
V chng ta xc nh tn s ly mu trn mi qung ca khng gian t
l, cho nn phi xc nh tn s ly mu trong mt vng nh lin quan ti t l
ca vic lm trn. Bit rng cc tr c th gn nhau mt cch ty , nn s c
mt s cn bng tng i gia tn s ly mu v t l pht hin.
D nhin, nu ta lm trn nh trc khi pht hin cc tr th s loi b mt
cch hiu qu cc tn s khng gian cao nht. Bi vy, lm tng tnh hu ch
ca d liu vo th nh c th c m rng to ra nhiu im mu hn chng
c mt trong nh gc. Ta tng gp i kch thc ca nh u vo s dng php
ni suy tuyn tnh trc khi xy dng mc u tin ca hnh chp. Khi php ton
tng ng c th c thc thi mt cch hiu qu bng vic s dng cc b
lc khong trng subpixel trn nh gc, th vic gp i nh dn n s thc thi
c hiu qu hn. Gi s rng nh gc c mt vt m ti thiu = 0.5 v v vy,
nh c gp i c = 1.0 lin quan ti khong cch im nh mi ca n.
iu ny c ngha l cn lm trn mt cht trc khi to ra qung u tin ca
khng gian t l. Vic nhn i nh lm tng s lng cc im kha n nh bi
mt tha s l 4, nhng cha tm thy cc ci tin ng k hn na i vi tha
s m rng ln hn.
2.2.2. nh v chnh xc im kha
Mt khi mt im kha ng c c tm thy bng vic so snh mt im
nh vi cc lng ging ca n, th bc tip theo l thc hin iu chnh chi tit
vi d liu ln cn cho v tr, t l, v t l ca cc cong ch yu. Thng tin
ny cho php loi b cc im c tng phn thp hoc c nh v km dc
bin.
Thc thi ban u ca hng tip cn ny nh v mt cch n gin cc
im kha v tr v t l ca im mu trung tm. Tuy nhin, gn y ngi ta
s dng mt phng php khc l lm ph hp mt hm bc hai 3D cho cc

16

im mu a phng xc nh v tr ni suy ca im cc i, v cc th
nghim cho thy rng phng php ny mang li s ci tin ng k cho vic
so khp v n nh. Phng php ny s dng php khai trin Taylor (ti a
l dng bc hai) ca hm khng gian t l, D(x,y, ), c thay i nh gc
v tr im mu:
D(x) = D +

1
2

2
2

(2.4)

Trong D v cc o hm ca n c nh gi im mu v x =
(x,y,)T l offset t im ny. V tr ca cc tr, x, c xc nh bng vic ly
o hm theo x v thit lp n bng 0, ta thu c:
x =

2 D1 D
x2

(2.5)

Hnh 2.3. Cc giai on la chn cc im kha. (a) nh gc vi 233x189

im nh. (b) 832 v tr im kha ban u cc im cc i v cc tiu ca
hm Difference-of-Gaussian. Cc im kha c th hin nh cc vect cho
bit t l, hng v v tr. (c) Sau khi p dng mt ngng ln tng phn ti
thiu, cn li 729 im kha. (d) 536 im kha cui cng c gi li sau khi
p dng mt ngng cho t l ca cc cong ch yu.
Theo xut ca Brown th ma trn Hessian v o hm ca D c xp
x bng vic s dng cc chnh lch gia cc im mu ln cn. Nu offset

17

x ln hn 0.5 bt k chiu no, th c ngha l cc tr nm gn vi mt im

mu khc hn. Trong trng hp ny, im mu c thay i v thc hin php
ni suy thay cho im . Offset cui cng x c cng thm v hng v tr
im mu ca n c c s c lng ni suy cho v tr ca cc tr .
Gi tr hm cc tr, D(x), c ch cho vic loi b cc cc tr khng n
nh c tng phn thp. C th t c iu ny bng vic th phng trnh
(2.18) vo (2.17), ta c:
1 DT
D(x ) = D +
x
2 x

Thng qua cc th nghim ngi ta nhn thy rng, tt c cc cc tr c gi

tr |D(x)| nh hn 0.03 u c loi b.

Hnh 2.3 cho thy hiu qu ca vic la chn im kha trn mt nh t

nhin. trnh qu nhiu s ln xn, s dng mt nh c phn gii thp vi
233x189 im nh v cc im kha c th hin nh cc vect cho bit v tr,
t l, v hng ca mi im kha (vic gn hng c miu t sau). Hnh
2.3(a) th hin nh gc, nh ny c th hin vi tng phn thp dn cc
hnh tip theo. Hnh 2.3(b) ch ra 832 im kha tt c cc im cc i v cc
tiu c pht hin bi hm Difference-of-Gaussian, trong khi hnh 2.3(c) ch
ra 729 im kha cn li sau khi loi b cc im c |D()| nh hn 0.03. Phn
(d) s c gii thch trong mc tip theo.
* Loi b cc p ng bin

i vi tnh n nh, khng loi b cc im kha c tng phn

thp. D v tr dc theo bin c xc nh ti nhng hm Difference-ofGaussian vn c mt p ng mnh dc theo cc bin v v vy khng n nh
khi c cc lng nh tp nhiu.
nh c xc nh ti trong hm Difference-of-Gaussian s c mt
cong ln ch yu ngang qua bin ngoi tr cong nh hng trc giao. Cc
cong ch yu c th c tnh t ma trn Hessian 2x2, H, c tnh v tr v
t l ca im kha:

(2.6)

Cc o hm c c lng bng vic ly cc chnh lch gia cc

im mu lng ging.

18

Cc gi tr ring ca ma trn H tng ng vi cc cong ch yu ca D.

Ly l gi tr ring vi cng ln nht v l gi tr ring vi cng nh
hn. Khi , ta c th tnh tng cc gi tr ring t du vt ca H v tch ca
chng c tnh t gi tr ca nh thc:
Tr(H) = D xx + D yy = + ,
Det(H) = D xx D yy (D xy)2 = .
Trong trng hp khng chc xy ra l nh thc c gi tr m, cc
cong c cc du hiu khc nhau v vy im b loi b khng phi l mt cc tr.
Ly r l t l gia gi tr ring c cng ln nht v gi tr ring c cng
nh hn, = r. Khi ,
()2 ( + )2 ( + )2 ( + 1)2
=
=
=
()

Biu thc (r+1)2/r nhn gi tr cc tiu khi hai gi tr ring bng nhau v
n tng cng vi r. V vy, kim tra xem t l ca cc cong ch yu c
di mt ngng r no khng, ta ch cn kim tra:
()2 ( + 1)2
<
()

Cc th nghim cho thy s dng gi tr r = 10, s loi b c cc im

kha c t l gia cc cong ch yu ln hn 10. S chuyn tip t Hnh 2.3(c)
sang Hnh 2.3(d) th hin cc tc ng ca thao tc ny.
2.2.3. Gn hng cho cc im kha
Bng vic gn mt hng thch hp cho mi im kha da trn cc c
tnh nh cc b, b m t im kha c trnh by phn sau c lin quan ti
hng ny v v vy t c s bt bin i vi php quay nh.
gn mt hng cc b cho mi im kha ta s dng hng gradient
ca nh. T l ca im kha c dng la chn nh c lm trn
Gaussian, L, vi t l gn nht, thc hin tt c cc tnh ton theo kiu bt
bin t l. i vi mi mu nh, L(x,y), t l ny, cng gradient, m(x,y),
v hng, (x,y), c tnh ton trc s dng chnh lch im nh:
2

(, ) = ( + 1, ) ( 1, ) + (, + 1) (, 1)

(, ) = tan1 (, + 1) (, 1)( + 1, ) ( 1, )

19

Mt biu hng c thit lp t cc hng gradient ca cc im mu

trong phm vi mt vng ln cn xung quanh im kha. Biu hng c 36 bin
bao ph 360 ca tt c cc hng. Mi mu c thm vo biu c gn
trng s bi ln gradient ca n v bi mt ca s hnh trn Gaussian vi
gp 1.5 ln t l ca im kha .
Cc nh trong biu hng tng ng vi cc hng bao qut cc
gradient cc b. Da vo biu hng ta c th xc nh c nh cao nht
trong biu v khi bt k nh cc b no khc nm trong phm vi 80% so
vi nh cao nht u c dng to ra mt im kha vi cng hng . V
vy, i vi cc v tr c nhiu nh c cng tng t nhau, th s c nhiu
im kha c to ra cng v tr v t l nhng cc hng th khc nhau.
Ch c khong 15% im c gn nhiu hng, nhng nhng im ny gp
phn ng k cho tnh n nh ca vic so khp. Cui cng, mt ng parabol
c lm ph hp vi 3 gi tr ca biu gn vi mi nh nht ni suy v
tr ca nh mang li chnh xc tt hn.
2.2.4. Xy dng b m t cc b
Cc thao tc trn gn v tr, t l v hng cho mi im kha. Cc
tham s ny p t cho h ta 2D cc b m t mt vng nh cc b. Bc
tip theo l tnh ton mt b m t cho vng nh cc b c th bt bin i
vi cc thay i cn li nh thay i sng hoc im nhn 3D.

Hnh 2.4. B m t im kha c to ra bng cch: u tin tnh ton

ln v hng gradient mi im mu trong mt vng xung quanh v tr im
kha, nh hnh bn tri. Cc hng ny c gn trng s bi mt ca s

20

Gaussian, c biu th bi ng trn ph ngoi. Sau cc mu ny c

gom li thnh cc biu hng tm tt ni dung trn 4x4 vng con, c th
hin hnh phi, vi chiu di mi mi tn tng ng vi tng cc cng
gradient gn vi hng trong phm vi ca vng .
Hnh 2.4 minh ha cho vic tnh ton b m t im kha. u tin cc
ln v hng gradient nh c ly mu quanh v tr im kha, s dng t l
ca im kha la chn mc m Gaussian cho nh. t n s bt bin v
hng, th cc ta ca b m t v cc hng gradient b quay c lin quan
ti hng ca im kha. thun tin trong vic tnh ton b m t, cc
gradient phi c tnh trc cho tt c cc mc ca hnh chp. Cc gradient ny
c minh ha bi cc mi tn nh mi v tr mu hnh bn tri ca hnh 2.4.
Hm gn trng s Gaussian vi bng mt na chiu rng ca ca s b
m t c dng gn mt trng s cho cng ca mi im mu. iu ny
c minh ha bng mt ca s hnh trn th hin hnh bn tri ca hnh 2.4.
Mc ch ca ca s Gaussian ny l trnh cc thay i t ngt trong b m t
khi c cc thay i nh v tr ca ca s, v t quan tm n cc gradient xa
v tr trung tm ca b m t.
Hnh bn phi ca hnh 2.4 th hin b m t im kha. N ch n s
thay i ng k cc v tr gradient bng vic to ra cc biu hng trn 4x4
vng mu. Hnh ny th hin 8 hng cho mi biu , vi chiu di ca mi
mi tn tng ng vi ln ca mi mc (entry) ca biu .
trnh tt c cc nh hng bin l iu tht s quan trng, b m
t thay i t ngt v mt mu thay i lin tc t mt biu ny sang mt
biu khc hoc t mt hng ny sang hng khc. V vy, s dng php ni
suy tuyn tnh bc 3 phn b gi tr ca mi mu gradient vo cc bin biu
gn k. Mt khc, mi entry trong mt bin c tng ln nhiu ln bi trng s
l 1-d cho mi chiu, trong d l khong cch ca mu t gi tr trung tm ca
bin c o di dng cc n v ca khong cch bin biu .
B m t c to nn t mt vect cha cc gi tr ca tt c cc entry
ca biu hng, tng ng vi cc chiu di ca cc mi tn hnh bn phi
ca hnh 2.4. Hnh ny th hin mt mng 4x4 cc biu vi 8 bin hng. V
vy, mt vect c trng c 4x4x8 =128 phn t m t cho mi im kha.
Cui cng, vect c trng c sa i gim cc tc ng ca s thay
i v sng. u tin, vect c chun ha theo chiu di n v. S thay
i v tng phn ca nh tc l mi gi tr im nh c nhn vi mt

21

hng s s lm tng cc gradient bi cng hng s , cho nn php chun ha

vect s xa b c s thay i v tng phn. Thay i sng tc l mt
hng s c thm vo mi im nh, iu ny s khng nh hng n cc gi
tr gradient, v gi tr gradient c tnh t cc chnh lch ca im nh. Bi
vy, b m t bt bin i vi cc thay i affine v sng. Tuy nhin, cc thay
i sng phi tuyn tnh cng c th xy ra da trn s bo ha ca camera
hoc da trn cc thay i v s chiu sng m chng nh hng n cc b mt
3D vi cc hng khc nhau bi cc lng khc nhau. Cc nh hng ny c th
gy nn s thay i ln cc cng lin quan i vi mt s gradient, nhng
t c kh nng nh hng n cc hng gradient. V vy, gim c tc ng
ca cc cng gradient ln bng vic ly ngng i vi cc gi tr trong
vect n v c trng cho mi cng l khng vt qu 0.2, sau chun
ha li chiu di n v. iu ny c ngha l vic so khp cc cng i vi
cc gradient ln khng cn quan trng na, v s phn b ca cc hng c tm
quan trng rt ln. Gi tr 0.2 c xc nh bng thc nghim s dng cc nh
c cc chiu sng khc nhau cho cng cc i tng 3D.
2.3. Harris-Laplace
Mc ny trnh by mt k thut mi trong vic pht hin cc im quan
tm bt bin t l, k thut ny kt hp k thut Harris tin cy v s la chn t
l t ng.
2.3.1. Khng gian t l
Mt c tnh vn c ca cc i tng th gii thc l chng tn ti nh
cc thc th y ngha trn khp cc t l khc nhau. Mt v d n gin l
khi nim mt nhnh cy, n ch c ngha t l t mt vi centimet ti nhiu
nht l vi mt, v vy tht v ngha khi tho lun khi nim cy mc
nanomet hoc kilomet. Vi c s lp lun ny, th cc i tng trong th gii
xut hin theo cc cch khc nhau ty thuc t l quan st nu ngi ta nhm
vo vic m t chng. V vy khi nim t l l cc k quan trng.
c bit, s cn thit i vi vic th hin a t l ny sinh khi thit k
cc phng php phn tch t ng v thu nhn thng tin t cc php o th gii
thc. c th trch chn bt k thng tin no t d liu nh, r rng ngi ta
phi tng tc vi d liu nh bng cch s dng cc ton t no . Kiu thng
tin c th thu c phn ln c xc nh bi mi quan h gia kch thc ca
cc cu trc hin thc trong d liu v kch thc ca cc ton t. Vi vn
rt c bn trong x l nh tp trung vo ton t no c dng, ni p dng

22

chng v chng phm vi nh th no. Nu cc vn ny khng c quan

tm thch ng th vic gii thch cho s p ng ca ton t c th rt kh khn.
Tuy nhin, trong cc hon cnh khc nhau c th khng l hin nhin
xc nh trc t l no l thch hp. Mt v d cho trng hp nh vy l h
thng th gic vi nhim v phn tch cc cnh cha bit. Bn cnh cc c tnh
a t l vn c ca cc i tng th gii thc, th mt h thng nh vy phi
i mt vi cc vn nh php nh x theo lut gn xa a n cc thay i v
kch thc, tp nhiu cng b a vo trong qu trnh thu nhn nh, v d liu
sn c l cc tp d liu hai chiu phn nh cc c tnh gin tip ca mt th
gii 3 chiu. c th i ph vi cc vn ny, mt cng c cn thit l mt
l thuyt hnh thc cho cch m t cc cu trc nh cc t l khc nhau.
* S th hin khng gian t l: nh ngha v cc tng c bn

Hnh 2.5. Mt th hin a t l ca mt tn hiu l mt tp c th t ca

cc tn hiu thu nhn c d nh th hin tn hiu gc cc mc t l khc
nhau.
L thuyt khng gian t l l mt nn tng cho cc thao tc th gic gn
y, l thuyt ny c pht trin bi cng ng th gic my tnh x l bn
cht a t l c cp trn ca d liu nh. Mt vn chnh ng sau cu
trc ca n l nu khng cho trc thng tin v cc t l thch hp i vi mt
tp d liu cho trc th ch c mt phng php duy nht cho h thng th gic
khng rng buc l th hin d liu vo nhiu mc t l khc nhau. iu ny
c ngha l tn hiu gc nn c nhng vo mt h mt tham s ca cc tn hiu
thu nhn, cc cu trc c t l nh c nn lin tip (Hnh 2.5). Mt
tng nh vy nn c thc hin nh th no trong thc t? Mt yu cu ct
yu l cc cu trc cc t l th trong mt th hin a t l s l cc s n

23

gin ha ca cc cu trc tng ng cc t l nh hn. Tm li, i vi bt k

tn hiu n chiu no f:RNR, th mt th hin khng gian t l ca n L:
RNxR + R c nh ngha bi cng thc sau:
(; ) =

()g()

g: RNxR + R biu th hm nhn Gaussian.

g(; ) =

1
(1 2 ++ 2 )2

(2 2 )2

Bin t c xem l tham s t l. Tng ng, h khng gian t l c th

c t n nh mt gii php cho phng trnh tuyn tnh:
1
= 2
2

Vi iu kin ban u L(.; t) = f. Khi , da vo th hin ny, cc o

hm khng gian t l bt k t l t no u c xc nh bi:
(. ; ) = 11 (. ; ) = 11 g(. ; )

Hnh 2.6. Cc mc khc nhau trong mt th hin khng gian t l ca mt

nh hai chiu cc mc t l t = 0, 2, 8, 32, 128 v 512 cng vi cc hnh git
nc mc xm biu th cc gi tr cc tiu cc b mi t l.

24

Hnh 2.6 th hin mt v d ng vi mt nh hai chiu. y, nhn

mnh cc bin i cc b trong mt nh cp xm, cc gi tr cc tiu cc b
trong cc nh cp xm mi t l c biu th bi cc hnh git nc mu en.
Chng ta c th thy rng phn ln cc hnh git nc nh l do tp nhiu v kt
cu c pht hin cc t l nh. Sau khi lm trn, cc nt bm trn bn phm
hin ra r rng hn, trong khi cc t l ln hn cc nt ny hp thnh mt
khi. Hn na, cc cu trc nh ti hn (nh my tnh, dy, v ng nghe in
thoi) xut hin nh cc hnh git nc n cc t l ln hn. V d ny minh
ha cho cc kiu phn tch hnh dng c th bc m cc phn tch ny c th
c t n bng vic thay i tham s t l trong th hin khng gian t l .
Cc mi lin h gia cc cu trc nh cc t l khc nhau c to ra theo cch
ny c gi l cc cu trc theo su (deep structures).
2.3.2. Hm Harris thch nghi t l
Phng php pht hin im quan tm Harris da trn ma trn moment
cp hai. Ma trn moment cp hai, cn gi l ma trn tng quan t ng, thng
c dng cho vic pht hin c trng hoc m t cc cu trc nh cc b. Ma
trn ny c lm thch nghi vi cc thay i v t l, lm cho n c lp vi
phn gii ca nh. Ma trn moment cp hai thch nghi t l (scale-adapted
second moment matrix) c nh ngha nh sau:
11
(, , ) =
21

(, )
2 (, )
12
2 ( )
(2.7)

22
(, ) 2 (, )

y I l t l tch phn, D l t l vi phn v La l php o hm c

tnh theo hng a. Ma trn ny m t s phn b gradient trn mt vng ln cn
cc b xung quanh mt im. Cc o hm a phng c tnh vi cc hm
nhn Gaussian c kch thc c xc nh bi t l cc b D (t l vi phn differentiation scale). Sau , cc o hm ny c tnh trung bnh trong vng
ln cn ca im bng vic lm trn vi ca s Gaussian c kch thc I (t
l tch phn - integration scale). Cc gi tr ring ca ma trn ny m t hai s
thay i tn hiu ch yu trong vng ln cn ca mt im. c tnh ny cho
php trch chn cc im, m i vi chng c hai cong u ng k, iu
ny c ngha l s thay i tn hiu l ng k cc hng trc giao tc l cc
gc, cc mi ni v.v... Cc im nh vy n nh trong cc iu kin chiu sng
ty v i din cho mt nh. Mt trong nhng phng php pht hin im
quan tm tin cy nht, l phng php Harris, da theo nguyn tc ny. Php
o Harris kt hp du vt v nh thc ca ma trn moment cp hai c xc
nh nh sau:

25

= (, , ) 2 (, , )

(2.8)

Cc gi tr cc i cc b ca cornerness xc nh v tr ca cc im quan
tm, c xc nh thng qua thc nghim.
2.3.3. S la chn t l t ng
S la chn t l t ng v cc c tnh ca cc t l c chn c
nghin cu rng ri. tng l la chn t l c trng ca mt cu trc cc b,
m i vi n mt hm cho trc t c mt cc tr trn tt c cc t l. Lin
quan ti vic la chn t l t ng, thut ng characteristic trc tin cp
n mt s vic l t l c chn c lng chiu di c trng (characteristic
length) ca cc cu trc nh tng ng, theo cch tng t nh khi nim v
chiu di c trng c dng trong Vt l. T l c chn l c trng theo
ngha nh lng, v n o c t l m c s ging nhau ti a gia ton
t pht hin c trng v cc cu trc nh cc b. S c lng t l ny s tun
th hon ton vi s bt bin t l khi c s thay i t l ca mu nh.
Cho mt im trong mt nh v mt ton t la chn t l chng ta tnh
ton cc p ng ca ton t cho mt tp cc t l n (Hnh 2.7). T l c
trng tng ng vi cc tr a phng ca cc p ng . Ch rng c th c
vi cc i hoc cc tiu, l cc t l c trng tng ng vi cc cu trc
nh khc nhau c t vo gia im ny. T l c trng khng ph thuc
nhiu vo phn gii ca nh. N lin quan ti cu trc v khng lin quan ti
phn gii m cu trc c miu t. T l gia cc scale m cc cc
tr c tm thy cho cc im tng ng l tha s t l thc s gia cc vng
ln cn ca im . Nu c qu t im quan tm c pht hin th ni dung
nh c miu t khng tin cy cho my. Hn na, cc cuc th nghim cho
thy rng hm Laplacian-of-Gaussian tm c t l phn trm cao nht ca cc
t l c trng chnh xc c cho bi cng thc sau:
|LoG(, )| = 2 (, ) + (, )

(2.9)

26

Hnh 2.7. V d v cc t l c trng

Hnh 2.7 minh ha cho cc t l c trng. Hng trn th hin hai nh
c ly vi cc chiu di cc b khc nhau. Dng di th hin cc p ng
ca hm F norm (x, n ) trn cc t l, F norm l hm LoG chun (cng thc 2.9).
Cc t l c trng ny nm trong khong 10.1 v 3.89 i vi nh tri v nh
phi. T l gia cc t l tng ng l tha s t l (2.9) gia hai nh. Bn knh
ca cc vng trn bng 3 ln t l c trng.
Khi kch thc ca hm nhn LoG khp vi kch thc ca cu trc bloblike th p ng t c mt cc tr. V vy, hm nhn LoG c th c gii
thch nh mt b lc so khp. Hm LoG c lm thch nghi tt vi vic pht
hin m mu (blob) v tnh i xng trn ca n, nhng n cng cung cp mt
s c lng tt v t l c trng cho cc cu trc cc b khc nh cc gc, cc
cnh, cc hnh chp v a mi ni.
2.3.4. Thut ton pht hin im bt ng
Mc ny trnh by chi tit v thut ton pht hin cc im c trng bt
bin t l. Phng php Harris-Laplace dng hm Harris thch nghi t l (cng
thc 2.8) xc nh cc im trong khng gian t l. Sau , n la chn cc
im m i vi chng hm Laplacian-of-Gaussian (cng thc 2.9) t c
mt gi tr cc i trn khp t l. Ngi ta xut 2 thut ton. Thut ton th
nht l thut ton lp pht hin ng thi v tr v t l ca cc vng c
trng. Thut ton th hai l mt thut ton n gin, t chnh xc nhng hiu qu
hn nhiu.

27

2.3.4.1. Thut ton

Thut ton ny bao gm hai bc: pht hin im a t l (multi-scale
point) v la chn lp i lp li t l v v tr. u tin ta xy dng mt th hin
khng gian t l vi hm Harris cho cc t l c chn trc n = n 0 , vi l
tha s t l gia hai mc lin tip ( = 1.4 ). mi mc ca s th hin ny ta
trch chn cc im quan tm bng vic pht hin cc im cc i a phng
trong 8 lng ging ca im x. S dng mt ngng loi b cc im cc i
ca gc (cornerness) nh, v chng t n nh di cc thay i trong cc iu
kin nh. Ma trn (x, n ) c tnh vi t l tch phn I = n v t l cc b
D =s n , s l mt hng s (thit lp 0.7 trong cc th nghim). Sau i vi mi
im ta p dng thut ton lp pht hin ng thi v tr v t l ca cc im
quan tm. Cc cc tr trn t l ca hm LoG c dng la chn t l cho
cc im quan tm. Loi b cc im m i vi chng p ng ca hm LoG
khng t c cc tr no v p ng di ngng. Cho mt im x ban u
vi t l I , cc bc lp:
1. Tm cc tr a phng trn t l ca hm LoG cho im x(k), mt khc
(+1)

loi b im . Mt dy cc t l c kim tra b gii hn ti

()

vi t thuc vo [0.7,, 1.4].

2. Pht hin v tr khng gian x(k+1) ca im cc i ca php o Harris

(+1)

gn vi x(k) nht i vi

c chn.
(+1)

3. Quay v bc 1 nu

()

hoc x(k+1) x(k).

Cc im ban u c pht hin vi b pht hin Harris a t l c s

thay i ln gia hai mc t l pht hin lin tip l 1.4. Thc nghim cho thy
nu dng mt t l nh hn (1.1) trong thut ton s mang li chnh xc tt
hn cho v tr x v t l I . Cho trc cc im ban u c pht hin vi
khong cch t l = 1.4, vng lp kim tra cn thn dy cc t l t I vi t thuc
vo [0.7, , 1.4], iu ny tng ng vi khong cch gia hai mc trong
khng gian t l gn vi t l ca im ban u l I . Ch rng cc im ban
u c pht hin trn cng cu trc cc b nhng cc t l khc nhau s hi
t n cng v tr v cng t l. D dng nhn ra cc im ny da vo cc ta
v cc t l.
2.3.4.2. Mt vi v d
Hnh 2.8 th hin 2 v d v cc im c pht hin theo phng php
Harris-Laplace n gin. Dng trn th hin cc im c pht hin vi b pht

28

hin Harris a t l c dng cho vic khi to. y, ta la chn bng tay cc
im tng ng vi cng cu trc cc b. T l pht hin c th hin bi mt
vng trn bao quanh im vi bn knh 3 I . Ch cch thc m mt im
quan tm, c pht hin i vi cng cu trc nh , thay i v tr ca n lin
quan ti t l pht hin hng gradient . Ngi ta c th xc nh mt chui
cc im v ch chn mt im trong chng th hin cho cu trc cc b.
hng tip cn ny, php o LoG c dng chn cc im in hnh cho cc
cu trc nh vy. Hn na, hm LoG cho php cc im c trng tng ng c
th c chn (dng di) thm ch khi c s bin i ng k gia cc nh.
Thnh thong, hai hoc nhiu hn hai im c chn t mt tp a t l, nhng
khng cho bit trc v s thay i t l gia cc nh nn chng ta phi gi li
tt c cc im chn. Nh vy nhn vo hnh chng ta c th thy, v tr v t
l ca cc im ng vi s bin i gia cc nh.

Hnh 2.8. Pht hin im quan tm bt bin t l: (dng trn) cc im

Harris a t l ban u (c chn bng tay) tng ng vi mt cu trc cc b.
(Dng di) cc im quan tm c chn vi phng php Harris-Laplace
n gin.
2.4. Harris-Affine
Hng tip cn bt bin t l c th c m rng lm cho n bt bin
affine. Phn ny trnh by v phng php pht hin im bt bin HarrisLaplace trong trng hp c cc php bin i affine ca nh. Tip theo gii
thiu mt phng php cho vic c lng hnh dng affine ca mt cu trc
cc b. Mi bc ca thut ton pht hin c tho lun chi tit v trnh by
mt phc tho ca th tc lp ny. Phn ny cng trnh by mt v d v cc
im bt bin affine c pht hin theo phng php ny.

29

2.4.1. Mc tiu
Trong trng hp c cc bin i affine th nhn chung s thay i t l l
khc nhau mi hng. Phng php pht hin Harris-Laplace c thit k ch
x l cc thay i t l ng dng nn n s tht bi trong trng hp c cc
bin i affine ng k. Hnh 2.9 trnh by mt cp im c pht hin trong
cc nh khi c php bin i affine gia chng. Dng trn th hin cc im
c pht hin vi b pht hin Harris a t l. T l (c chn vi hm LoG)
c hin th bng mu en. dng di, cc vng Harris-Laplace c trnh
by mu en v cc hnh elip mu trng l cc vng tng ng c chiu t nh
khc vi php bin i affine. Chng ta c th thy rng cc vng c pht hin
theo phng php Harris-Laplace khng bao ph cng mt b phn ca nh
b bin dng affine.
Trong trng hp c php bin i affine, khi s thay i t l khng
nht thit phi ging nhau mi hng, nn cc t l c chn mt cch t
ng khng phn nh c s bin i thc s ca mt im. Bit rng cc v tr
khng gian ca cc im cc i Harris lm thay i tng i t l pht hin
(hnh 2.8 v 2.9). Nu cc t l pht hin khng ph hp vi tha s t l thc
gia cc nh th s dn n mt li dch chuyn gia cc im tng ng v cc
vng lin i cng khng ph hp. Cc t l pht hin phi thay i c lp vi
cc hng trc giao x l bt k t l affine no. V vy, chng ta gp phi
vn v vic tnh ton ma trn moment cp hai trong khng gian t l affine
Gaussian, vng ln cn hnh trn ca mt im c thay th bng hnh
elip. Mc tip theo trnh by v cch thc gii quyt vn ny.
2.4.2. Ma trn Moment cp hai Affine
Ma trn moment cp hai c th c dng c lng hnh dng khng
ng hng ca mt cu trc nh cc b. c tnh ny c tm ra bi
Lindeberg (1998) v sau l Baumberg (2000) pht hin s bin dng affine
ca mt cu trc ng hng. Sau y l cch xc nh hnh dng khng ng
hng ca mt vng ln cn ca mt im.

30

Hnh 2.9. im quan tm bt bin t l trong cc nh b bin i affine

Hnh 2.9: (Hnh trn) cc im quan tm ban u c pht hin vi b
pht hin Harris a t l v cc t l c trng ca chng c la chn bi nh
t l ca hm Laplacian (mu en-Harris-Laplace). (Hnh di) im c trng
c pht hin vi phng php Harris-Laplace (mu en) v cc im tng
ng t nh khc c chiu vi php bin i affine (mu trng).
Trong khng gian t l, ma trn moment cp hai v tr im x cho
trc c xc nh bi cng thc:
(, ) = ( )( ) ()(, )()(, )

(2.10)

Trong v l cc ma trn ng bin, cc ma trn ny xc nh

cc hm nhn Gaussian tch phn v vi phn. R rng, khng thc t tnh ton
ma trn ny cho tt c cc kt hp c th ca cc tham s kernel. Khng mt tnh
tng qut chng ta c th gii hn s t do bng vic thit lp = , s
l mt hng s. V vy, cc nhn vi phn v tch phn s ch khc nhau v kch
c m khng khc nhau v hnh dng.
2.4.2.1. Php bin i affine ca ma trn moment cp hai
Xt mt im x L b bin i bi php bin i tuyn tnh x R = Ax L . Ma
trn L c tnh im x L cng b bin i theo cch sau:

31

, , , , = , , , ,
(2.11)

= , , , ,

Nu ta biu th cc ma trn tng ng bi:

( , , , , ) =

( , , , , ) =

Vy cc ma trn ny c vit li nh sau:

M L = ATM R A

M R = A-TM L A-1

(2.12)

Trong trng hp ny cc nhn vi phn v tch phn c bin i thnh:

R = A L AT
Gi s rng ma trn M L cng c tnh theo cch nh vy:
, = 1

, = 1 (2.13)

Trong cc i lng v hng I v D l cc t l tch phn v vi phn

tng ng. V vy, ta c th tm c mi quan h sau:
, = , = (1 ) = ( 1 )1 = 1

, = , = (1 ) = ( 1 )1 = 1

(2.14)

iu ny cho thy rng vic li dng cc iu kin, c nh ngha

cng thc (2.13) dn n cc mi quan h cng thc (2.14), vi gi nh l cc
im c thut li bi php bin i affine v cc ma trn c tnh ton cho
cc t l tng ng I v D . By gi chng ta c th o ngc vn ny v
gi s rng c hai im c thut li bi mt php bin i affine no . Nu
ta c lng c cc ma trn R v L cc ma trn ny xc minh cho cc
iu kin (2.13) v (2.14), th quan h (2.12) s ng. c tnh ny cho php cc
tham s ca php bin i c biu din trc tip bi cc thnh phn ca ma
trn . Khi , php bin i affine c th c nh ngha nh sau:

= 1 2 1

32

Trong R l ma trn trc giao th hin mt php quay bt k hoc php

bin i phn chiu (i xng gng). Mc tip theo trnh by v mt thut ton
lp cho vic c lng cc ma trn L v R . Php bin i affine c th c
c lng ti a l mt php quay gia hai im tng ng m khng bit trc
v php bin i ny. Hn na, cc ma trn M L v M R , c tnh di cc iu
kin (2.13) v (2.14), xc nh cc vng tng ng c nh ngha bi cng
thc XTMx = 1. Nu vng ln cn ca cc im x R v x L c chun ha bi cc

php bin i = 1 2 v = 1 2 , th cc vng c chun ha ny

c thut li bi mt php quay n gin =

= = 1 2 1 2 , 1 2 = 1 2

(2.15)

Cc ma trn v trong cc cu trc c chun ha bng vi ma

trn quay thun ty (Hnh 2.10). Mt khc, cc mu cng trong cc cu trc
c chun ha l ng hng di dng ma trn moment cp hai.

Hnh 2.10. Biu gii thch php chun ha affine da trn cc ma trn
moment cp hai. Ta nh c chuyn i thnh cc ma trn 1
1

. Cc nh b bin i c thut li bi mt php bin i trc giao.

2.4.2.2. Php o tnh ng hng (Isotropy Measure)

Ma trn moment cp hai cng c th c chuyn i thnh php o ng

hng. Khng mt tnh tng qut, chng ta gi s rng mt cu trc khng ng

33

hng cc b l mt cu trc ng hng di php bin i affine. b vo

s bin dng affine, ta phi tm ra mt php bin i m php bin i ny chiu
mu khng ng hng thnh mt mu ng hng. Ch rng php quay gi
li tnh ng hng ca mt mnh nh, v vy, s bin dng affine ca mt cu
trc ng hng c th c xc nh ti a l mt nhn t ca php quay. Php
quay ny c th c khi phc bi cc phng php da vo hng gradient
ca nh. Tnh ng hng cc b c th c o bi cc gi tr ring ca ma trn
moment cp hai (x, I , D ). Nu cc cc gi tr ring bng nhau th chng ta xt
n tnh ng hng ca im . t c php o chun ha ta phi s
dng t l gia cc gi tr ring:
=

()

()

(2.16)

Gi tr ca T thay i trong khong [01] bng 1 i vi mt cu trc

ng hng hon ton. Php o ny c th cho mt p ng hi khc i vi cc
t l khc nhau v ma trn c tnh i vi t l tch phn v vi phn cho
trc. Cc t l ny nn c chn c lp vi phn gii ca nh. K thut
la chn t l cho ta kh nng xc nh t l tch phn c lin quan ti cu
trc nh cc b. Cc t l tch phn v vi phn c th c thut li bi mt hng
s s, D = s I . Hin nhin l t l vi phn nn nh hn t l tch phn. Tha s s
khng nn qu nh, mt khc vic lm trn cng khng nn qu nhiu i vi
php ly vi phn. Mt khc s nn nh ca s Gaussian vi kch thc I c
th tnh trung bnh ma trn ng bin (x, D , I ) trong vng ln cn ca im .
Mt tng l kh nhiu m khng lm mt i hnh dng khng ng
hng ca cc cu trc nh c quan st. Gii php l chn t l vi phn D c
lp vi t l I , iu ny c ngha l thay i tha s s trong phm vi
[0.5,,0.75]. Cho trc t l tch phn chng ta phi tm kim t l D m i
vi n p ng ca php o tnh ng hng t c mt gi tr cc i a
phng. V vy, hnh dng c chn cho cu trc c quan st gn vi mt
cu trc ng hng hn.
2.4.3. K thut pht hin im bt ng
Tip theo ta m t v hng tip cn bt bin affine. Khi to cho thut
ton pht hin im quan tm bt bin affine vi cc im c trch chn bi
phng php pht hin Harris a t l. xc nh v tr khng gian ca cc
im quan tm ta s dng phng php pht hin Harris, phng php ny cng
da vo ma trn moment cp hai, nn n ph hp mt cch t nhin vi
framework ny. thu c ma trn hnh dng (shape matrix) cho mi im

34

quan tm ta cn tnh ton b m t moment cp hai (second moment descriptor)

vi cc t l tch phn v vi phn c la chn mt cch t ng. hng tip
cn ny cc ma trn tch phn v vi phn c thut li bi mt i lng v
hng = gii hn khng gian tm kim. Phc tho ca phng php
pht hin ny c m t nh sau:

V tr khng gian ca mt im quan tm mt t l v hnh dng

cho trc c xc nh bi gi tr cc i a phng ca hm
Harris.
T l tch phn c chn cc tr trn t l ca hm Laplacian
c chun ha.
T l vi phn c chn ti gi tr cc i ca tnh ng hng
c chun ha.
Ma trn thch nghi hnh dng c c lng vi ma trn moment
cp hai v c dng chun ha vng ln cn ca im .

Sau y ta s trnh by chi tit mi bc ca thut ton.

Ma trn thch nghi hnh dng (Shape Adaptation Matrix). Phng
php thch nghi hnh dng lp ny lm vic trong vng nh b bin i. Chng
ta bin i mt nh v p dng nhn vng trn (circular kernel) thay v p dng
nhn affine Gaussian. iu ny cho php s dng s thc thi quy ca cc b
lc Gaussian cho vic tnh ton L x v L y. Ma trn moment cp hai c tnh da
theo cng thc (2.7). Mt ca s cc b W c t v tr trung tm ca im
quan tm x v c bin i bi ma trn:
1
2

()

(0)

(2.17)

bc (k) ca thut ton lp. Tip theo ta xem thao tc ny nh l php

bin i U. Ch rng mt ma trn mi c tnh mi ln lp v ma trn U
l s lin kt cc cn bc hai ca cc ma trn moment cp hai. Chng ta bo m
rng nh gc c ly mu chnh xc bng vic thit lp gi tr ring ln max (U)
= 1, iu ny mun ni rng mnh nh c phng to theo hng min (U). i
vi bt k mt im cho trc no, t l tch phn v t l vi phn s xc nh
c ma trn moment cp hai . Cc tham s t l ny c chn t ng mi
ln lp. V vy, ma trn kt qu khng ph thuc vo t l ban u v phn
gii ca nh.
T l tch phn (Integration Scale). i vi bt k im khng gian cho
trc no chng ta u la chn c t l c trng ca n mt cch t ng.

35

duy tr s bt bin i vi cc thay i v kch thc ta chn t l tch phn

I m hm Laplacian chun ha (cng thc 2.9) t c mt gi tr cc i
a phng trn khp t l. Khi c s hin din ca cc bin dng affine ln th
s thay i t l s rt khc nhau mi hng. V vy, t l c trng ny c
pht hin nh gc v phin bn bin i U ca nh c th khc nhau ng
k. Bi vy, vic la chn t l tch phn mi ln lp sau khi p dng php
bin i U l ht sc cn thit. Ta s dng th tc tng t vi th tc trong
phng php Harris-Laplace. Cc im ban u ny hi t v mt im m
t l v ma trn moment cp hai khng thay i na.
T l vi phn (Differentiation Scale). Chng ta la chn t l vi phn cc
b s dng t l tch phn v php o tnh ng hng T. Gii php ny c
thc y bi mt thc t l t l cc b c nh hng quan trng n s hi t
ca ma trn moment cp hai. Th tc lp ny hi t v mt ma trn c cc gi tr
ring bng nhau. chnh lch gia cc gi tr ring ( max (), min ()) ca ma
trn ban u cng nh th gii php cui cng cng cht ch v s hi t cng
nhanh. Ch rng php o Harris (cng thc (2.8)) la chn cc im vi hai
gi tr ring ln. S chnh lch gia cc gi tr ring ln dn n vic thay i t
l ln theo mt hng bi php bin i U. Trong trng hp ny im
khng hi t v mt im n nh do tp nhiu. Vic la chn t l cc b cho
php ta tm c mt t l hp l gia cc gi tr ring v cc im s hi t.
Ch rng t l vi phn cc b c th c thit lp cn xng vi t l
tch phn D = s I , s l mt hng s. iu ny y nhanh ng k cc ln lp
nhng c mt s im li khng hi t do chnh lch ln gia cc gi tr
ring.
nh v khng gian. Ta bit cc im cc i cc b ca php o
Harris thay i v tr nh th no nu t l pht hin thay i (Hnh 2.8). C th
quan st c s nh hng ny khi thay i t l khc nhau mi hng.
hng tip cn ny, vic pht hin c cc t l khc nhau cc hng x v y
c thay th bng vic p dng cng mt t l c hai hng i vi nh
bin i. Do , chng ta pht hin li im cc i trong ca s chun ha
affine W. V vy, ta thu c mt vect ca s dch chuyn hng ti im cc
i gn nht trong ca s W c chun ha - U. V tr ca im ban u c
hiu chnh theo vect dch chuyn ny s b bin i ngc tr li v vng nh
ban u:
()

(1)

() = (1) + (1) .

36

x w l mt im trong cc ta ca nh bin i U.
Tiu chun hi t. Mt phn quan trng ca th tc lp l tiu chun
dng. Php o tnh hi t c th da vo ma trn U hoc ma trn . Nu tiu
chun ny da vo ma trn c tnh mi ln lp th chng ta dng lp khi
ma trn ny gn vi php quay thun ty. iu ny mun ni rng gi tr
max () v min () bng nhau. Thc t chng ta cho php mt sai s nh C =0.05.
1

()

()

<

(2.18)

Mt kh nng khc l phn tch ma trn U = RT.D.R thnh php quay R v

chn thang t l D v so snh cc php bin i U lin tip nhau. Ta dng vic
lp khi cc php bin i R v D lin tip ging nhau. C hai tiu chun kt
thc u cho cng cc kt qu cui cng. Mt im quan trng khc l dng
trong trng hp xy ra s phn k. Theo l thuyt, c mt trng hp c bit
l khi t l gi tr ring dn ti v cng tc l im trn mt step-edge. V
vy, im ny nn c loi b nu t l qu ln (tc l = 6), mt khc n dn
n cc cu trc b ko di khng n nh.
()
()

>

(2.19)

Cc c tnh hi t ca thut ton thch nghi hnh dng c nghin

cu rng ri bi Lindeberg v Garding (1997), h ch ra rng ngoi tr trng
hp c bit cn trong cc trng hp khc th im hi t lun l duy nht.
Nhn chung, s hi t ca th tc dn n mt iu l s c lng ban u
ca php bin i affine dn ti php bin dng ch thc, v t l tch phn
c la chn chnh xc i vi kch thc ca cu trc nh cc b.
Thut ton pht hin. Ngi ta xut mt th tc lp cho php cc
im ban u hi t ti cc im v cc vng bt bin affine. khi to cho
thut ton, ta s dng cc im c trch chn bi phng php pht hin
Harris a t l. Cc im ny khng c pht hin theo cch bt bin affine do
hm nhn Gaussian khng thch nghi (non-adapted Gaussian kernel), nhng
cung cp mt v tr v t l gn ng cho s tm kim v sau. i vi mt im
quan tm ban u cho trc x(0) ta p dng th tc sau:
1. Khi to U(0) l ma trn ng nht.
2. Chun ha ca s W(x w ) = I(x) c t trung tm
(1)

(1)

= (1)

(1)

3. Chn t l tch phn I ti im

37

4. Chn t l vi phn D = s I , sao cho vic la chn ny lm cc i

()

(1)

, vi s thuc [0.5, , 0.75] v =

()
()

, ,

5. Pht hin v tr khng gian ca mt gi tr cc i ca php o

(1)

Harris (cng thc (2.8)) gn vi

im quan tm x(k)
()

6. Tnh

()

= 2 , ,

nht v tnh ton v tr ca

()

7. Ghp php bin i () = . (1) v chun ha U(k)

max (U(k)) =1
()

()

8. Quay li bc 2 nu 1

Mc d s tnh ton dng nh tn rt nhiu thi gian, ch yu tn thi

gian cho vic tnh ton L x v L y, iu ny c thc hin ch mt ln mi
bc nu mi quan h gia cc t l tch phn v t l cc b l hng s. Vng
lp bt u vi vic la chn t l tch phn bi v b phn ny ca thut ton
hu nh mnh m i vi cc sai s nh v nh ca im quan tm ny. Tuy
nhin, t l I s thay i nu hnh dng ca mnh nh b bin i. Cho trc
mt gii php xp x ban u, thut ton c trnh by trn s sa i mt
cch lp i lp li hnh dng, t l v v tr khng gian ca mt im v hi t ti
mt cu trc cc b. Hnh 2.11 ch ra cc im affine c pht hin cc bc
lin tip ca th tc lp. Sau ln lp th 4 th v tr, t l v hnh dng ca im
khng thay i na. C th thy rng cc hnh elip cui cng bao ph cng
mt vng nh mc d c s bin dng affine mnh.

Hnh 2.11. Pht hin lp li ca mt im quan tm bt bin affine khi c

s hin din ca php bin i affine (dng trn v di). Ct u tin th hin
cc im c dng cho vic khi to. Cc ct tip theo th hin cc im v

38

cc vng sau cc ln lp th 1, 2, 3 v 4. Ch rng cc im ny hi t sau 4

ln lp v cc hnh elip hi t ti cc vng nh tng ng.
S la chn cc im affine tng t nhau. Ta c th gi s rng cc
c trng l n nh nu chng trong mt dy t l. Cc c trng ny c
nhn ra bi vi im m cc im ny hi t ti cng mt cu trc. Vi iu kin
vng c chun ha l ng hng, th s c mt gi tr cc i khng gian ca
php o Harris v mt t l c trng cho cu trc cc b ang c xem xt. V
vy, vi im ban u tng ng vi cng mt c trng nhng li c pht
hin cc mc t l khc nhau hi t v v tr v t l ca mt im. Khng
phc tp nhn ra cc im ny bng vic so snh v tr (x,y), t l I ,
min (U)/ max (U) v mt nghing (skew). Mt nghing ny c khi phc t ma
trn ca php quay R, U = RT.D.R. Chng ta xc nh mt im tng t
nu mi tham s trong cc tham s ny nm trong phm vi mt ngng i vi
cc tham s ca im tham chiu. Cui cng, ta tnh ton cc tham s trung bnh
v la chn im tng t nht t tp cc im xc nh. Kt qu l, i vi
mt nh cho trc ta thu c mt tp cc im m mi mt im th hin
mt v tr v cu trc nh khc nhau.
V d v cc im bt bin Affine. Hnh 2.12 minh ha cho vic pht
hin cc im bt bin affine. Ct (a) biu din cc im c dng cho vic
khi to, cc im ny c pht hin bi phng php phtt hin Harris a t
l. Cc vng trn th hin cc t l pht hin, cc bn knh ca vng trn l
3I. Cc vng trn mu en th hin cc im c chn bi phng php
Harris-Laplace. Ch rng c s dch chuyn ng k gia cc im c pht
hin cc t l khc nhau v cc vng trn trong cc nh tng ng (dng u
v dng cui) khng bao ph cng mt b phn ca nh. ct (b) trnh by cc
im Harris-Laplace vi cc vng affine c c lng (mu en). T l v v
tr ca cc im khng thay i trong sut cc ln lp. Cc vng c chiu
tng ng c th hin bi mu trng v cho thy s khc bit r rng v v tr
v hnh dng ca vng. T l ban u c pht hin khng ng do s dng
ton t Laplacian vng trn (khng thch nghi affine). Tng t, cc v tr ca
cc im khc nhau 3 n 4 im nh. Cc im ct (a), tng ng vi cng
mt cu trc vt l, nhng c pht hin cc v tr khc nhau do t l, hi t
v cng mt v tr v cng mt vng v c trnh by ct (c). Chng ta c th
thy rng phng php ny hi t chnh xc thm ch ngay c khi v tr v t l
ca im ban u tng i xa im hi t. Nhn chung t n s hi t
ch cn t hn 10 ln lp. in hnh, khong 40% cc im ban u khng hi t
do khng c cc t l c trng hoc do s chnh lch ln gia cc gi tr ring

39

ca ma trn U ( max (U)/ min (U) > 6). Khong 30% cc im cn li c la

chn bi php o tnh tng t. Khong 20-30% cc im Harris a t l ban
u c dng th hin mt nh. Ct (d) biu din cc im c chn (mu
en) v cc im c chiu t nh tng ng (mu trng). S khc bit ch yu
gia cc vng trong ct (d) gy ra bi tnh khng chnh xc ca vic c lng
t l v sai s C . Ct (e) biu din cc im c chn c chun ha vi
cc ma trn c lng loi b s ko dn v nghing. Chng ta c th thy
rng cc vng ny tng ng gia hai nh (dng trn v dng di)

Hnh 2.12. Pht hin im quan tm bt bin affine: (a) Cc im ban u

c pht hin bng phng php Harris a t l v t l c trng c la
chn bi nh t l Laplacian (mu en-Harris-Laplace). (b) Cc vng affine
c pht hin cho cc im Harris-Laplace (mu en) v cc vng c chiu
t cc nh tng ng (mu trng). (c) Cc im v cc vng affine tng ng
thu c vi thut ton lp p dng cho cc im Harris a t l ban u. (d)
Cc im affine trung bnh c chn (mu en) v cc im c chiu tng
ng ca n (mu trng). (e) Cc vng ln cn c chun ha vi cc ma trn
c lng loi b s ko dn v nghing.
2.5. Phng php SURF (Speed Up Robust Feature)
SURF l mt phng php pht hin v m t hnh nh mnh m, do
Herbert Bay a ra ln u vo nm 2006, c th c s dng trong cc nhim
v tm nhn ca my tnh nh nhn dng i tng, phc hi 3D. N c ly
cm hng t m t SIFT. Phin bn tiu chun ca SURF nhanh hn nhiu so
vi SIFT v n chng li s bin i hnh nh khc nhau tt hn SIFT. SURF
da trn tng xp x cc c trng Haar wavelet 2D v s dng hiu qu cho cc
nh tch hp (integral image).

40

Phng php ny da trn cc ma trn Hessian, nhng s dng mt xp x

c bn, cng ging nh DoG l mt pht hin c bn da trn Laplacian. N da
trn hnh nh tch hp gim thi gian tnh ton v c gi n l pht hin
'Fast-Hessian'. Mt khc, m t ny m t mt phn b cc c trng Haarwavelet trong cc lng ging ca im quan tm. Hn na, ch s dng kch
thc 64, gim thi gian tnh ton cc c trng v so khp, ng thi tng s
chc chn. y cng trnh by mt bc lp ch mc mi da trn cc du hiu
ca hm Laplacian, khng ch lm tng tc so khp, m cn vng mnh
ca m t ny.
2.5.1. nh tch hp (integral image)
nh tch hp, c a ra bi Viola v Jones trong Rapid object
detection using a boosted cascade of simple Features [23], l mt mng 2 chiu
vi kch thc bng kch thc ca nh cn tnh cc c trng, vi mi phn t
ca mng ny c tnh bng cch tnh tng ca im nh pha trn (dng-1) v
bn tri (ct-1) ca n. Bt u t v tr trn, bn tri n v tr di, phi ca
nh, vic tnh ton ny n thun ch a trn php cng s nguyn n gin, do
tc thc hin rt nhanh.

() =
=0 =0 (, )

(2.20)

Vi I c tnh ton, ch mt bn php cng tnh ton tng cc cng

bt k dng thng ng, hnh ch nht din tch, c lp vi kch thc ca
n.
2.5.2. Pht hin Fast-Hessian:
Phng php SURF da vo pht hin v cc ma trn Hessian v hiu sut
tt ca n v thi gian tnh ton v chnh xc. Tuy nhin, thay v s dng mt
bin php khc la chn v tr v t l (nh c thc hin trong pht hin
Hessian-Laplace), y da trn cc nh thc Hessian cho c hai. Vi mt
im x=(x, y) trong mt nh I, cc ma trn Hessian H(x,) x c t l c
nh ngha nh sau:

41

(, ) =

(, )
(, )

(, )

(, )

(2.21)

trong L xx (x,) l tch chp ca o hm bc hai ca hm Gaussian

2

() vi nh I ti im x, v tng t cho L xy (x,) v L yy (x,).

Hm Gaussians c ti u cho vic phn tch khng gian t l. Tuy nhin

trong thc t, hm Gaussian cn phi c ri rc v ct b (Hnh 2.13: na bn
tri), thm ch vi c b lc Gaussian th rng ca vn cn xy ra ngay sau khi
nhng hnh nh kt qu c ly mu gim. Ngoi ra, cc tnh cht khng c cu
trc mi c th xut hin tin ti phn gii thp hn c th c chng
minh trong trng hp 1D, nhng khng p dng trong trng hp lin quan n
2D. Do , tm quan trng ca hm Gaussian c v nh phn no c nh
gi qu cao v vn ny, v y th nghim mt gii php thay th n gin
hn. Khi b lc Gaussian l khng l tng trong bt k trng hp no, v
Lowe's thnh cng vi xp x LoG, phng php ny cho xp x Hessian vi cc
b lc vung (Hnh 2.13: na bn phi). Xp x o hm Gausian bc hai, c th
c nh gi rt nhanh bng cch s dng hnh nh tch hp, c lp vi kch
thc.

Hnh 2.13: T tri sang phi: o hm ring bc hai ca hm Gaussian

y hng (Lyy) v xy hng (Lxy) tng ng, v xp x ca n y hng (Dyy)
v xy hng (Dxy). Vng xm bng zero.
Cc b lc 99 trong hnh 2.13 l nhng xp x ca o hm bc hai
Gaussian vi = 1.2 v biu din t l thp nht (ngha l phn gii khng
gian cao nht). K hiu l D xx , D yy , v D xy . Trng s p dng cho cc vng ch
nht c gi n gin cho hiu qu tnh ton. iu ny mang li
Det(H approx ) = D xx D yy (0.9D xy)2

(2.22)

Cc trng s tng i w ca cc b lc c trng phi c cn bng

biu thc cho nh thc ca Hessian. iu ny l cn thit cho vic bo ton
nng lng gia cc nhn Gaussian v gn ng cc nhn Gaussian.

42
(1.2) | (9)|

= |

(1.2)| (9)

= 0.912 0.9

(2.23)

trong |x| F l chun Frobenius. Hn na, cc b lc c trng c

chun ha i vi cc kch thc mt n. iu ny m bo mt chun
Frobenius lin tc cho bt k kch thc b lc no.
2.5.3. S biu din khng gian t l:
Khng gian t l thng c chia thnh cc octave (mt octave i din
cho mt lot cc bn c trng lc thu c bng cch ghp cc nh u vo
tng t nhau vi kch thc lc tng dn) v th hin nh kim t thp nh. Cc
nh lin tc c lm mn bi hm Gaussian, ri sau c ly mu gim
t c mt mc cao hn ca kim t thp. Do vic s dng cc b lc vung v
nh tch hp, chng ta khng phi p dng lp i lp li php lc tng t cho
u ra ca mt lp c lc k trc , nhng thay th c th p dng
nhng b lc nh vy ca bt k kch thc chnh xc cng tc trc tip trn
nh gc. Do khng gian t l c phn tch bng cch m rng kch thc
b lc thay v lp i lp li vic gim kch thc nh. u ra trn b lc 9x9
c xem l lp t l ban u , y s gii thiu l t l s=1.2 (tng ng vi
cc dn sut Gaussian vi =1.2). Cc lp tip theo thu c bng cch lc cc
nh vi mt n ln dn, c tnh n tnh ri rc ca cc nh tch hp v cu trc
c th ca cc b lc. C th iu ny a n cc b lc kch thc 9x9, 15x15,
21x21, 27x27,vv quy m ln hn, bc gia kch c b lc lin tc phi
ph hp vi t l. Do , i vi tng octave mi, s gia tng kch thc b lc
l tng gp i (t 6 n 12 n 24). ng thi, khong ly mu tch cc
im quan tm c th c tng ln gp i.

Hnh 2.14: Thay v lp li vic gim kch c nh (bn tri), vic s dng
nh tch hp cho php tng t l lc vi gi tr khng i (bn phi).

43

Khi t l thit k b lc khng thay i sau khi m rng, cc xp x o

hm Gaussian c cng t l ph hp. V d, b lc 27x27 tng ng vi
=31.2=3.6=s. Hn na, khi cc ch tiu Frobenius vn khng i cho cc b
lc, chng l t l c chun ha.
2.5.4. nh v im quan tm
nh v im quan tm trong nh v trn cc t l, mt s loi tr
khng cc i trong mt lng ging 3x3x3 c p dng, cc i ca nh thc
ma trn Hessian c ni suy trong t l v khng gian nh

Hnh 2.15: Biu t l pht hin. S lng im quan tm c pht

hin trn mi octave phn r nhanh chng.
Ni suy khng gian t l l c bit quan trng trong trng hp ny, nh
s khc bit t l gia cc lp u tin ca mi octave l tng i ln. Hnh
2.16 cho thy mt v d v cc im quan tm c pht hin bng cch s dng
pht hin Fast-Hessian.

44

Hnh 2.16: Nhng im quan tm c pht hin trn mt cnh ng hoa

hng dng.
2.5.5. B m t im quan tm v so khp
B m t ca phng php ny m t s phn b cng ni dung bn
trong lng ging ca cc im quan tm, ging nh thng tin gradient c rt
trch bi phng php SIFT v nhng bin i ca n. y xy dng s phn
b ca cc c trng Haar wavelet bc nht x v y hng hn l gradient, khai
thc nh tch hp cho tc v ch s dng kch thc 64. iu ny lm gim
thi gian tnh ton c trng v so khp, v ng thi chng minh s gia tng
chc chn. Hn na, y s trnh by bc nh ch mc mi da trn du hiu
Laplacian, khng ch lm tng chc chn m cn tng tc so khp.
Phng php pht hin-m t ny c gi l SURF (Speed Up Robust Feature).
Bc u tin gm c c nh hng lp da trn thng tin t vng trn
bao quanh im quan tm. Sau , xy dng mt vng hnh vung ph hp vi
hng c chn v trch xut m t SURF t n. Cui cng cc c trng c
so khp gia hai nh.
2.5.5.1. Gn hng
bt bin vi php xoay nh, ta nh ngha mt hng lp cho cc im
quan tm. Vi mc ch , u tin ta tnh ton c trng Haar-wavelet
hng x v hng y, nhng c trng ny nm trong vng trn lng ging bn
knh 6s xung quanh im quan tm, vi s l t l cc im quan tm c pht

45

hin. Bc ly mu l ph thuc t l c chn c s. ph hp vi phn

cn li, cng c kch thc cc wavelet l ph thuc t l v thit lp mt cnh
di 4s. V vy ta c th s dng nh tch hp cho vic lc nhanh. Cc php lc s
dng c ch ra trong hnh 2.17. Ch 6 php ton c s dng tnh ton c
trng x hoc y hng bt k t l no.

Hnh 2.17: Php lc Haar wavelet tnh ton c trng x (bn tri) v
y hng (bn phi). Vng en c trng s -1 v vng trng c trng s +1
Mi mt c trng wavelet c tnh ton v iu chnh vi hm Gaussian
(=2.5s) tm im ca im quan tm, cc c trng c biu din nh
vector trong khng gian vi ln c trng theo chiu ngang dc theo honh
v ln c trng thng dc theo tung . Hng ch o c c tnh
bng cch tnh tng tt c cc c trng trong mt ca s nh hng trt bao

quanh mt gc , xem hnh 2.18. Cc c trng ngang v dc trong ca s c

3

tnh tng, hai c trng c tng hp sinh ra mt vector mi. Hng vector di
nht tng ng vi hng im quan tm. Kch thc ca s trt l mt i s
c chn cn thn.

46

Hnh 2.18: Gn hng: mt ca s dch hng ca kch thc pht hin

3

hng tri ca cc c trng Haar wavelet c trng s Gaussian mi im

mu trong vng trn lng ging quanh im quan tm.
2.5.5.2. B m t da trn tng cc c trng Haar wavelet.
tch m t, bc u tin bao gm vic xy dng mt khu vc trung
tm hnh vung bao quanh im quan tm v hng theo hng chn trong
phn trc. Kch thc ca s ny l 20s. V d v cc vng vung c minh
ha nh hnh 2.19.

Hnh 2.19: Chi tit ca nh Graffiti th hin kch thc ca ca s b m

t hng cc t l khc nhau.

47

Khu vc ny thng c chia nh thnh cc vng con 4x4. iu ny

gip gi c cc thng tin khng gian quan trng. i vi tng khu vc con, ta
tnh ton nhng c trng n ca cc im mu cch qung 5x5. n gin,
ta gi dx l c trng Haar wavelet theo phng nm ngang v dy l c trng
Haar wavelet theo phng thng ng (b lc kch thc 2s). Ngang v thng
ng y c nh ngha theo hng la chn cc im quan tm. gia
tng chc chn i vi bin dng hnh hc v cc li nh v, cc c trng
dx, dy l trng s u tin vi hm Gaussian(=3.3s) c tm ti im quan tm.

Hnh 2.20: xy dng b m t, mt khung li hng bc hai vi 4x4

vng con hnh vung c t trn cc im quan tm (bn tri). mi hnh
vung c trng wavelet c tnh ton. S chia nh 2x2 ca mi hnh vung
tng ng vi cc trng thc ca b m t. Nhng ci ny l tng ca dx, dy,
|dx| v |dy|, tnh ton tng i hng ca li (bn phi).
Sau cc c trng wavelet dx, dy c tng hp qua tng khu vc con
v hnh thnh mt tp ch mc vector c trng u tin. mang li thng tin
v s khc bit ca thay i cng , ta trch tng tr tuyt i cc c trng
|dx|, |dy|. Do , mt phn min s c mt vector m t 4 chiu v cho cu trc
cng c bn ca phn min = , , | | , . Kt qu l mt
vector m t cho tt c 4x4 vng con c di 64. Bt bin tng phn (mt
tha s t l) t c bng cch chuyn m t vo trong mt vector n v.

48

Hnh 2.21. Cc mc m t ca min con i din cho tnh cht ca mu

cng c bn. Hnh tri: trong trng hp ca mt min con ng nht, tt
c cc gi tr l tng i thp. Hnh gia: s c mt ca tn s trong x hng,
gi tr ca | | l cao, nhng tt c cc trng hp khc vn thp. Nu cng
tng dn theo x hng, c v | | u cao.

Hnh.2.21 cho thy cc c tnh ca m t trong ba nh cng mu

khc nhau trong mt phn min. Ta c th hnh dung kt qu ca vic kt hp
cc mu cng cc b l mt m t c bit.
2.5.5.3. Lp ch mc v so khp
lp ch mc nhanh chng trong giai on so khp, du hiu Laplacian
(ngha l du vt ca ma trn Hessian) l bao gm cho cc im quan tm c
bn. Thng thng cc im quan tm c tm thy cc cu trc kiu m
mu (blob-type). Du hiu Laplacian khc bit cc m mu sng trn nn ti t
trng thi nghch o. c im ny c gi tr i ch khng thm chi ph tnh
ton v n c tnh ton trong giai on pht hin. giai on so khp, ta
ch so snh cc c trng nu n c cng kiu tng phn, nh hnh 2.22. Do
, thng tin ti thiu ny cho php so khp nhanh hn, m khng lm gim hiu
sut ca b m t. Lu rng y cng l li th cho cc phng php lp ch
mc nng cao hn. V d vi k-d tree, thng tin b sung ny nh ngha mt siu
phng c ngha cho vic tch d liu, tri vi vic chn ngu nhin mt phn
t hay thng k cc c trng.

49

Hnh 2.22: Nu tng phn gia hai im quan tm khc nhau (ti trn
nn sng vi sng trn nn ti), ng vin s khng c xem l so khp c gi
tr.
2.6. So snh - Kt lun
Tc gi tin hnh nh gi so snh gia cc k thut da trn tp 816
nh gm 4 i tng. Cc nh so snh di cc iu kin khc nhau v gc nhn,
cng sng, t l
Bng so snh s lng c trng pht hin v thi gian thc hin gia cc
k thut (ly 1 nh lm mu nh gi)
Detector
Fast
Hessian
(SURF)
HarrisLaplace
HessianLaplace
DoG(SIFT)

S lng
im c
trng

Thi gian
thc hin

1418

120

1664

1850

1000

650

1520

400

Cng thc tnh lp li

Trong

repeatablity: lp li ca cc c trng.
correct-matches: s so khp chnh xc.

50

ground-truth-matches: s so khp c s.
So snh v gc nhn

Hnh 2.24: So snh v gc nhn (Bn tri). nh so snh (bn phi)

So snh v cng sng

Hnh 2.25: So snh v cng sng (Bn tri). nh so snh (bn phi)
So snh v t l

51

Hnh 2.26: So snh v t l (Bn tri). nh so snh (bn phi)

Kt qu so snh cho ta thy k thut SIFT t c s cn bng v tc
cng nh s im c trng tm c so vi cc k thut khc.
Trn y trnh by cc phng php cho vic pht hin im quan tm
bt bin t l v bt bin affine trong nh. Thut ton pht hin im bt bin
affine c lm thch nghi ng thi v tr, t l v hnh dng ca mt vng
ln cn ca mt im thu c cc im bt bin affine. Khng c phng
php no trong cc phng php trc y gii quyt ng thi cho tt c cc
tham s ny trong mt thut ton trch chn c trng. Cc phng php bt bin
t l c th x l tt cho cc thay i t l ln hn phng php bt bin affine
nhng n li tht bi i vi cc nh c cc php bin i affine ln. Cc im
bt bin affine cng mang li mt s so khp tin cy cho cc nh c cc bin
dng hnh phi cnh ng k. Tuy nhin, tnh n nh v hi t ca cc vng
affine l mt ch ca hng nghin cu tng lai cng nh tnh mnh m ca
chng i vi cc ng bin ct (occlusions).
2.7. La chn c trng.
Sau khi trch chn c cc c trng ni dung ca nh, tp cc c trng
c th c ti u ha bng cc phng php la chn c trng tng cht
lng v hiu qu khi s dng cc tp c trng.
Mt cch tng qut, la chn c trng l phng php gim thiu cc c
trng nhm chn ra mt tp con cc c trng ph hp trong hc my xy
dng m hnh hc tt nht. Mc ch ca la chn c trng l tm ra khng gian
con cc c trng ti u sao cho cc tp nh thch hp v khng thch hp
c tch bit nht.

52

C nhiu phng php la chn c trng c xut nh: phng php

tng khuych i (boosting manner) kt hp vi nn tng Real Adaboost ca
Wei Jian v Guihua Er. Mingjing Li a ra tiu ch la chn cc c trng l:
M hnh tng phn c trng c tng qut ha (Generalized Feature Contrast
Model) da trn m hnh tng phn c trng (Feature Contrast Model). Mt s
phng php c in khc nh phng php da vo phn phi (distribution
based). Phng php da vo phn tch bit thc (Discriminant analysis DA) v
d nh Phn tch a bit thc (Mutiple Discriminant analysis MDA)), phn tch
bit thc khng i xng (biased Discriminant analysis BDA). Phng php ti
a khong cch ti thiu i xng trong khng gian con (symmetric maximized
minimal distance in subspace SMMS)
Bng 2.1: Mt s phng php la chn c trng.
Phng php

M t, nhn xt

TT
Phng php da vo phn
Khng xt n yu cu v
phi
(Distribution
based tnh bt i xng trong h thng
approaches)
CBIR.
Kh nh gi phn phi mu
v mt s mu hun luyn khng
c t c ht ton b tp d liu.
V vy, phng php ny khng
thch hp cho h thng tm kim
nh hc online.
Phng php khuych i
Khng xt n yu cu v
thng thng
tnh bt i xng trong h thng
CBIR.
(conventional
Boosting
method)
Khng c nh gi tt v
kh nng tng qut ha thp do tiu
ch la chn c trng da trn li
hun luyn.
Phng php phn tch bit
thc.

Phng php DA tng hp

cc phn tch bit thc tuyn tnh
v gi thit rng cc nh thch
hp c nhm vo vi nhau nh

53

mt cm.
Vi nhng nh khng thch
hp, phng php DA gi thit
rng chng khng nm trong mt
phn phi mt cm.
Phng php MDA gi thit
rng mi nh khng thch hp
n t mt lp khc nhau.
Phng php BDA gi thit
rng mi nh khng thch hp
n t mt s khng xc nh cc
lp.
SMMS la chn khng gian
c trng con trc giao vi khng
gian con ko di bng cc mu
thch hp.
Phng BiasMap (BDA ht
nht)

nh x mu hun luyn n
mt khng gian nhiu chiu hn
gii quyt vn gi thuyt mt
cm.

Phng php khuych i

Tng cc c trng c hc
(Boosting manner)
thnh phn lp ton b gim li
hun luyn.
C nhiu phng php nh gi kt qu ca tp con c trng. V vy,
kt qu i vi nhng m hnh la chn c trng khc nhau l khc nhau. Hai
m hnh ph bin cho la chn c trng l: M hnh Filter v m hnh Wrapper.
M hnh Filter: nh gi mi phn t bng mt vi tiu chun hay o
no , ri chn ra tp con cc thuc tnh c nh gi cao nht.
M hnh Wrapper: S dng mt thut ton tm kim nh gi tp con
cc thuc tnh coi nh l mt nhm hn l mt phn t ring l. Ct li
ca m hnh Wrapper l mt thut ton hc my c th. N nh gi tt
ca nhng tp con c trng ty theo chnh xc hc ca tp con, iu
ny xc nh thng qua mt tiu ch no .

54

Theo kt qu cng trnh ngin cu ca tc gi Maridalia Guerrero thuc

i hc Utah State vi ti A Comparative Study of Three Image Matcing
Algorithms: Sift, Surf, and Fast [22] c cng b ngy 01 thng 01 nm 2011.
Th trong ba phng php trch chn c trng phng php Sift cho kt qu kh
quan nht, vi s c trng tm c cao hn c so vi hai phng php cn li.
Chnh v l tc gi chn c trng Sift l c trng nh cho ti ca
mnh.
Bn cnh v trong khun kh lun vn tc gi s dng cng c m
ngun m Asift ca tc gi Goushen Yu v Jean Michel Morel (ni r trong
chng 4) rt ra c trng nh.

55

CHNG 3: CC PHNG PHP PHN LOI NH.

3.1. Tng quan.
Phn loi nh l mt qu trnh phc tp v i hi phi xem xt nhiu yu
t. Nhn chung cc bc chnh ca qu trnh phn loi nh c th bao gm: xc
nh mt h thng phn loi c th v ph hp, la chn mu o to, tin xa l
nh, khai thc tnh nng, la chn cc phng php tip cn phn loi ph hp,
v nh gi chnh xc. Nhu cu ca ngi s dng, quy m ca cng trnh
nghin cu, iu kin kinh t, v k nng ca nh phn tch l nhng yu t quan
trng nh hng n s la chn d liu, thit k ca cc th tc phn loi, v
kt qu ca cc th tc phn loi.
Hin nay c rt nhiu cng trnh nghin cu v phn loi hnh nh v
c c nhng kt qu ng khch l, nh l: Nave Bayes, Support Vector
Machine, KNearest Neighbor, Linear Least Squares Fit, Neural Network, Nave
Bayes, CentroidBased im chung ca cc phng php ny u da vo
xc sut thng k. Trong mi phng php u c cch tnh ton khc nhau, tuy
nhin cc phng php ny u phi thc hin mt s bc chung, nh: u tin
mi phng php s da vo thng tin v s xut hin ca cc c trng (tn s
xut hin trong tp c trng, ) biu din thnh dng vector, sau ty
tng bi ton c th m chng ta s quyt nh chn p dng phng php no,
cng thc tnh ton no cho ph hp phn loi tp c trng da trn tp cc
vector xy dng c bc trn, nhm mc ch t c kt qu phn loi
tt nht.
Trong nhng nm gn y, nhiu phng php phn loi tin tin c
nghin cu, chng hn nh Neural Network, Fuzzy-sets, v cc h thng chuyn
gia c p dng rng ri cho vic phn loi nh. Cch tip cn vi bi toi
phn loi nh c th c nhm thnh hnh thc c gim st (supervised) v
khng gim st (unsupervised), hoc c tham s (parametric) v khng tham s
(unparametric), hoc cng (hard) v mm (Fuzzy), hoc cho mi im nh (perpixel), nhm im nh (subpixel), v vng (perfield).
Bng 3.1: Cch phn loi cc phng php phn loi nh.
Tiu chun

Danh mc

c im

V d v phn
loi
Phn loi c Phng php Cc lp hc c nh ngha Phn loi da
s dng mu tip cn phn trc. C y cc d liu vo tng
o to
loi c gim st cn thit dng lm mu ng ln nht,

56

Phng php
tip cn phn
loi
khng
gim st

Phn
loi C tham
da vo cc phn loi
tham s ma
trn
hip
phng sai
hay vector

Khng tham s
phn loi

Phn
da
thng
pixel

loi Per-pixel
trn
tin

Subpixel

o to. Cc kt qu c to
ra t vic hun luyn s c
dng phn loi cc d liu
th thnh cc lp thch hp.
Cc thut ton gom cm
c s dng chia cc nh
vo nhng lp nht nh da
trn nhng thng tin vn c
ca nh. Cc lp cha c
nh ngha trc. Qu trnh
phn tch s gn nhn v t
ng phn nhm cc nh vo
nhm ph hp.
Cc thng s (v d: vector
c trng v ma trn hip
phng sai) thng c to
ra t cc mu hun luyn.
Khi cc d liu qu phc tp
th kt qu thng s b
nhiu. Mt nhc im ln
l n rt kh tch hp
trong trng hp d liu
ngy cng gia tng, cc thuc
tnh khng gian theo ng
cnh v cc thng tin kh
phn loi.
Thng cha bit d liu
phn loi, phng php
khng s dng tham s thng
k tnh ton tch lp v
c bit thch hp dng
tng hp cc d liu phn
loi.
Vic phn lp da vo cch
kt hp cc im c coi l
c trng ca nh.

khong cch ti
thiu,
mng
neural thn kinh,
cy quyt nh.
Phn loi dng
ISODATA, thut
ton K-means.

Thng
dng
vo tng
ng ln nht,
phn tch tuyn
tnh phn bit.

Thng
dng
mng
neural
thn kinh, cy
quyt nh, my
hc, h chuyn
gia.

Hu ht c
dng cho vic
tnh o tng
ng ln nht,
khong cch ti
thiu,
mng
neaural
thn
kinh, cy quyt
nh v my hc.
Gi tr ti mi pixel c cho Dng tp m,
l s kt hp tuyn tnh hoc subpixel,
v

57

phn tch a hn
hp.
Phn loi theo Phn on nh thnh cc i Ecognition.
i tng.
tng v vic phn loi c
tin hnh da trn cc i
tng, thay v da trn im
nh. Khng s dng d liu
vector GIS.
Phn loi theo GIS ng vai tr quan trng Phng
php
vng
trong vic phn loi theo tip cn phn
vng, tch hp d liu raster loi da trn
v vector trong phn loi. GIS.
Cc vector thng c
dng chia nh cc tm nh
thnh cc parcel v vic phn
nhm c da trn cc
parcel ny trnh s thay i
quang ph trong cng lp.
phi tuyn tnh.

Phn
da
thng
pixel

loi
trn
tin

Phn
da
thng
pixel

loi
trn
tin

3.2. Cc phng php phn loi nh.

3.2.1. Phng php phn loi K-Means. (tham kho web)
K-Means l thut ton rt quan trng v c s dng ph bin trong k
thut phn cm. T tng chnh ca thut ton K-Means l tm cch phn nhm
cc i tng (objects) cho vo K cm (K l s cc cm c xc inh trc,
K nguyn dng) sao cho tng bnh phng khong cch gia cc i tng n
tm nhm (centroid ) l nh nht.
Thut ton K-Means c m t nh sau

58

Thut ton K-Means thc hin qua cc bc chnh sau:

1. Chn ngu nhin K tm (centroid) cho K cm (cluster). Mi cm c
i din bng cc tm ca cm.
2. Tnh khong cch gia cc i tng (objects) n K tm (thng dng
khong cch Euclidean)
3. Nhm cc i tng vo nhm gn nht
4. Xc nh li tm mi cho cc nhm
5. Thc hin li bc 2 cho n khi khng c s thay i nhm no ca
cc i tng
V d minh ha thut ton K-Mean:
Gi s ta c 4 loi thuc A,B,C,D, mi loi thuc c biu din bi 2 c
trng X v Y nh sau. Mc ch ca ta l nhm cc thuc cho vo 2 nhm
(K=2) da vo cc c trng ca chng.

59

Object
Medicine A
Medicine B
Medicine C
Medicine D

Feature 1 (X): weight index

1
2
4
5

Feature 2(Y): pH
1
1
3
4

Bc 1. Khi to tm (centroid) cho 2 nhm. Gi s ta chn A l tm ca

nhm th nht (ta tm nhm th nht c1(1,1)) v B l tm ca nhm th 2
(to tm nhm th hai c2 (2,1)).

Bc 2. Tnh khong cch t cc i tng n tm ca cc nhm

(Khong cch Euclidean)

D0 =

0
1

1
0

3.61
2.83

5 C1 = (1,1)

4.24 C2 = (2,1)

2
1

4
3

Tm nhm 1
Tm nhm 2

Mi ct trong ma trn khong cch (D) l mt i tng (ct th nht

tng ng vi i tng A, ct th 2 tng ng vi i tng B,). Hng th
nht trong ma trn khong cch biu din khong cch gia cc i tng n
tm ca nhm th nht (c1) v hng th 2 trong ma trn khong cch biu din
khong cch ca cc i tng n tm ca nhm th 2 (c2).

60

V d, khong cch t loi thuc C=(4,3) n tm c1(1,1) l 3.61 v n

tm c2(2,1) l 2.83 c tnh nh sau:
C 1 = (1,1)
C 2 = (2,1)

(4 1)2 + (3 1)2 = 3.61

(4 2)2 + (3 1)2 = 2.83

Bc 3. Nhm cc i tng vo nhm gn nht

G0 =

1
0

0
1

0
1

B C

0 Nhm 1

1 Nhm 2
D

Ta thy rng nhm 1 sau vng lp th nht gm c 1 i tng A v

nhm 2 gm cc i tng cn li B,C,D.
Bc 5. Tnh li ta cc tm cho cc nhm mi da vo ta ca cc
i tng trong nhm. Nhm 1 ch c 1 i tng A nn tm nhm 1 vn khng
i, c1(1,1). Tm nhm 2 c tnh nh sau:

2 =

2+4+5 1+3+4
11 8
,
= ,
3
3
3 3

Bc 6. Tnh li khong cch t cc i tng n tm mi

61

0
D =
3.14
1

A B

1
1

2
1

1
2.36
C

4
3

3.61
0.47

1.89

C1 = (1,1)
11 8

C2 = ,
3

5 X

4 Y

Bc 7. Nhm cc i tng vo nhm

1 1
G1 =
0 0

0 0

1 1

A B C D

Nhm 1
Nhm 2

Bc 8. Tnh li tm cho nhm mi

C1 =

C2 =

1+2 1+1
,
= (112 , 1)
2
2

4+5 3+4
,
= (412 , 312 )
2
2

1
2

62

Bc 9. Tnh li khong cch t cc i tng n tm mi

0.5
D =
4.30
2

0.5
3.54

3.20
0.71

C1 = (112 , 1)
C2 = (412 , 312 )

4.61

0.71

B C

1
1

2
1

4
3

Nhm 1
Nhm 2

Bc 10. Nhm cc i tng vo nhm

G2 =

1
0

1
0

0
1

0 Nhm 1

1 Nhm 2

A B C D

Ta thy G2 = G1 (Khng c s thay i nhm no ca cc i tng) nn

thut ton dng v kt qu phn nhm nh sau:
Object
Medicine A
Medicine B
Medicine C
Medicine D

Feature 1 (X): weight

1
2
4
5

Feature 2 (Y): pH
1
1
3
4

Group (result)
1
1
2
2

Thut ton K-Means c u im l n gin, d hiu v ci t. Tuy

nhin, mt s hn ch ca K-Means l hiu qu ca thut ton ph thuc vo
vic chn s nhm K (phi xc nh trc) v chi ph cho thc hin vng lp tnh
ton khong cch ln khi s cm K v d liu phn cm ln.
3.2.2. Phng php php Nave Bayes (NB).
Nave Bayes l phng php phn loi da vo xc sut c s dng rng ri
trong lnh vc my hc v nhiu lnh vc khc nh trong cc cng c tm kim, cc
b lc mail,
tng c bn ca cch tip cn ny l s dng xc sut c iu kin gia

nh v ch d on xc sut ch ca mt nh cn phn loi. im quan

63

trng ca phng php ny chnh l ch gi nh rng s xut hin ca tt c cc

c trng trong nh u c lp vi nhau. Nh th NB khng tn dng c s ph

thuc ca nhiu nh vo mt ch c th. Chnh gi nh lm cho vic tnh
ton NB hiu qa v nhanh chng hn cc phng php khc vi phc tp theo
s m v n khng s dng cch kt hp cc t a ra phn on ch .
Mc ch chnh l lm sao tnh c xc sut Pr(C j , d), xc sut nh
dnm trong lp C j . Theo lut Bayes, nh d s c gn vo lp C j no c xc sut
Pr(C j , d) cao nht.
Cng thc tnh Pr(C j , d) nh sau:

d'
Pr(C ). Pr(w | C )
j
i j

i
1
=
'
H BAYES (d ) = argmax

d'
Pr(c'). Pr(w i | C')
i =1
c' c
c j C
Vi :
-

TF(w i , d) l s ln xut hin ca c trng w i trong nh d

|d| l s lng cc c trng trong nh d

w i l mt c trng trong khng gian c trng F vi s chiu l |F|

Pr(C j ) c tnh da trn t l phn trm ca s nh mi lp tng ng.

( )

Pr C j =

Cj
C

Cj
C'
C' C

trong tp d liu hun luyn

-

Pr w i | C j =

1 + TF w i , c j
F+

TF w ' , c j
w' F

Ngoi ra cn c cc phng php NB khc c th k ra nh ML Nave

Bayes, MAP Nave Bayes, Expected Nave Bayes. Ni chung Nave Bayes l mt

64

cng c rt hiu qu trong mt s trng hp. Kt qu c th rt xu nu d liu

hun luyn ngho nn v cc tham s d on (nh khng gian c trng) c cht
lng km. Nhn chung, y l mt thut ton phn loi tuyn tnh thch hp trong
phn loi nh nhiu ch . NB c u im l ci t n gin, tc thc hin
thut ton nhanh, d dng cp nht d liu hun luyn mi v c tnh c lp cao
vi tp hun luyn.

3.2.3. Phng php Support Vector Machine (SVM)

SVM l phng php phn loi rt hiu qu c Vapnik gii thiu nm
1995. tng ca phng php l cho trc mt tp hun luyn c biu din
trong khng gian vector, trong mi mt nh c xem nh mt im trong
khng gian ny. Phng php ny tm ra mt siu mt phng h quyt nh tt
nht c th chia cc im trn khng gian ny thnh hai lp ring bit tng ng,
tm gi l lp + (cng) v lp (tr). Cht lng ca siu mt phng ny c
quyt nh bi mt khong cch (c gi l bin) ca im d liu gn nht ca
mi lp n mt phng ny. Khong cch bin cng ln th cng c s phn chia
tt cc im ra thnh hai lp, ngha l s t c kt qu phn loi tt. Mc tiu
ca thut ton SVM l tm c khong cch bin ln nht to kt qa phn
loi tt.

Hnh 3.1: M hnh SVM

C th ni SVM thc cht l mt bi ton ti u , mc tiu ca thut ton
l tm c mt khng gian H v siu mt phng quyt nh h trn H sao cho sai
s khi phn loi l thp nht, ngha l kt qa phn loi s cho kt qu tt nht.
Phng trnh siu mt phng cha vector d i trong khng gian nh sau:

di . w + b = 0

+, d . w + b > 0

i
h d i = sign d i . w =

, d . w + b < 0
i

65

Nh th vector h(d i ) biu din s phn lp ca vector d i vo hai lp. Gi

Y i mang gi tr +1 hoc -1, khi Y i = +1 nh tng ng vi vector d i thuc lp
(+) v ngc li n s thuc vo lp (-). Khi ny c siu mt phng h, ta s
gii bi ton sau:

Tm Min w vi w v b tha iu kin: i 1, n : y i (sign(d i w + b)) 1

Chng ta thy rng SVM l mt phng quyt nh ch ph thuc vo cc
vector h tr c khong cch n mt phng quyt nh l 1/w i . Khi cc im
khc b xa i th thut ton vn cho kt qu ging nh ban u. Chnh c im
ny lm cho SVM khc vi cc thut ton khc nh KNN, LLSF, Nnet, NB v tt
c d liu trong tp hun luyn u c dng ti u ha kt qu.
3.2.4. Phng php K-Nearest Neighbor (KNN)
K-Nearest Neighbor l phng php truyn thng kh ni ting theo
hng tip cn thng k c nghin cu trong nhiu nm qua. KNN c
nh gi l mt trong nhng phng php tt nht c s dng t nhng thi
k u trong nghin cu v phn loi hnh nh.
tng ca phng php ny l khi cn phn loi mt nh mi, thut
ton s xc nh khong cch (c th p dng cc cng thc v khong cch nh
Euclide, Cosine, Manhattan, ) ca tt c cc nh trong tp hun luyn n nh
ny tm ra K nh gn nht, gi l K Nearest Neighbor K lng ging gn
nht, sau dng cc khong cch ny nh trng s cho tt c cc ch . Khi
, trng s ca mt ch chnh l tng tt c cc khong cch trn ca cc
nh trong K lng ging c cng ch , ch no khng xut hin trong K lng
ging s c trng s bng 0. Sau cc ch s c sp xp theo gi tr trng
s gim dn v cc ch c trng s cao s c chn lm ch ca nh cn
phn loi.
Trng s ca ch c j i vi nh x c tnh nh sau :

W x, c j =

sim x , . y , c j b j

d i d i

d i {kNN}

Trong :
y (d i , c) thuc {0,1} , vi :
- y = 0: nh d i khng thuc v ch c j

66

- y = 1: nh d i thuc v ch c j
sim(x , d): ging nhau gia nh cn phn loi x v nh d. Chng ta c
th s dng o Cosine tnh khong cch :

x.d


i

sim x ,
=
= cos x ,

d i
d i

x d
i

- b j l ngng phn loi ca ch c j c t ng hc s dng mt tp

nh hp l c chn ra t tp hun luyn.
chn c tham s k tt nht cho thao tc phn loi, thut ton cn
c chy th nghim trn nhiu gi tr K khc nhau, gi tr K cng ln th thut
ton cng n nh v sai st cng thp.
3.2.5. Phng php Linear Least Square Fit (LLSF)
LLSF l mt cch tip cn nh x c pht trin bi Yang v Chute vo
nm 1992. Ban u LLSF c th nghim trong lnh vc xc nh t ng
ngha sau s dng trong phn loi vo nm 1994. Cc th nghim cho thy
hiu sut phn loi ca LLSF c th ngang bng vi phng php KNN kinh
in.
tng ca LLSF l s dng phng php hi quy hc t tp hun
luyn v cc ch c sn.
Tp hun luyn c biu din di dng mt cp vector u vo v
u ra nh sau:
- Vector u vo l mt nh bao gm cc c trng v trng s.
- Vector u ra gm cc ch cng vi trng s nh phn ca nh ng
vi vector u vo .
Gii phng trnh cc cp vector u vo, u ra chng ta s thu c ma
trn ng hin ca h s hi quy ca nh v ch .
Phng php ny s dng cng thc :
2
F LS = arg F min FA B

Trong :

67

- A, B l ma trn i din tp d liu hun luyn (cc ct trong ma trn

tng ng l cc vector u vo v u ra).
- F LS l ma trn kt qu ch ra mt nh x t mt nh bt k vo vector ca
ch gn trng s.
Nh vo vic sp xp trng s ca cc ch , chng ta c mt danh
sch ch c th gn cho nh cn phn loi. Nh t ngng ln trng s ca
cc ch m ta tm c ch thch hp cho nh u vo. H thng t ng
hc cc ngng ti u cho tng ch , ging vi KNN. Mc d LLSF v KNN
khc nhau v mt thng k, nhng chng ta vn tm thy im chung trong cch
lm ca hai phng php ny l qu trnh hc ngng ti u.
3.2.6. Phng php Centroid based vector
L mt phng php phn loi n gin, d ci t v tc nhanh do c
phc tp tuyn tnh O(n).
tng ca cch tip cn ny l mi lp trong d liu hun luyn s c
biu din bng mt vector trng tm. Vic xc nh lp ca mt nh bt k s
thng qua vic tm vector trng tm no gn vi vector biu din nh th nht.
Lp ca nh chnh l lp m vector trng tm i din v khong cch c xc
nh theo o Cosine.
Chng ta c cng thc tnh vector trng tm ca lp i :

= 1

d
C i {i}
d j {i} j
o khong ccg gia vector x v vector C i :

x .C

i

cos x ,
=

C i

x .C
i

Trong :
- x l vector nh cn phn loi
- {i} l tp hp cc nh thuc ch C i
Ch ca vector x l C x tha mn cos(x, C x )= arg max (cos(x,C i )).

68

3.2.7. Kt lun
Cc thut ton phn loi trn t thut ton phn loi hai lp (SVM) n cc
thut ton phn loi a lp (KNN) u c im chung l yu cu nh phi c
biu din di dng vector c trng. Ngoi ra cc thut ton nh KNN, NB, LLSF
u phi s dng cc c lng tham s v ngng ti u khi phn loi nh, trong
khi thut ton SVM c th t xc nh cc tham s ti u ny trong qu trnh thc
hin thut ton. Xt v mt thi gian, cc phng php c thi gian hun luyn khc
nhau, cc phng php KNN, NB, LLSF c thi gian hun luyn v phn loi nh
nhanh hn so vi cc thut ton cn li, ng thi d dng ci t hn.
C 3 yu t quan trng tc ng n kt qu phn loi hnh nh:
1) Cn mt tp d liu hun luyn chun v ln cho thut ton hc phn
loi. Nu chng ta c c mt tp d liu chun v ln th qu trnh hun luyn
s tt v khi chng ta s c kt qa phn loi tt sau khi c hc.
2) Cc phng php trn hu ht u s dng m hnh vector biu din nh,
do phng php rt trch c trng trong nh ng vai tr quan trng qu trnh
biu din nh bng vector.
3) Thut ton s dng phn loi phi c thi gian x l hp l, thi gian
ny bao gm: thi gian hc, thi gian phn loi nh, ngoi ra thut ton ny phi c
tnh tng cng (incremental function) ngha l khng phn loi li ton b tp nh
khi thm mt s nh mi vo tp d liu m ch phn loi cc nh mi m thi, khi
thut ton phi c kh nng gim nhiu (noise) khi phn loi nh.

69

CHNG 4: NG DNG C TRNG BT BIN KT HP

K-MEAN TRONG PHN LOI NH.
Phn ny trnh by ng dng ca phng php trch chn c trng kt hp
vi thut ton gom cm Kmean gii quyt bi ton phn loi nh. Ci t th
nghim mt phng php trnh by chng 2.

4.1. Bi ton phn loi nh

Pht biu bi ton
Cho trc mt bc nh v tp hp nhiu nhm nh phn loi bng tay
trc. Yu cu xc nh xem bc nh thuc vo nhm nh no trong nhng
nhm nh cho.

DATA
BASE

Flower

Sunset

Query Image

Lanscape

Animal

Flower ?
Sunset ?
Lanscape ?
Animal ?

Hnh 4.1. V d v bi ton phn loi nh

Cch gii quyt bi ton
T tng: Cho trc mt bc nh v tp hp nhiu nhm nh phn loi
bng tay trc. Yu cu xc nh xem bc nh thuc vo nhm nh no trong
nhng nhm nh cho bng cch so snh c trng ca nh truy vn vi cc c
trng ca nhng nhm nh hun luyn, t ta tnh xem khong cch gia nh
truy vn vi cc nhm nh u l gn nht th ta coi nh nh truy vn thuc vo
nhm . Nh vy cn phi gii quyt bi ton theo hai cng on.
My hc.
1. Rt cc c trng ca nhm nh cho trc.
2. p dng K-Mean phn nhm nh.

70

Truy vn.
1. Rt cc c trng ca nh truy vn.
2. nh ngng phn bit.
3. Tnh xc xut thuc vo cc nhm nh ca nh truy vn.
y cng chnh l bi ton ln trong lnh vc nhn dng v th gic my tnh

4.1.1. M hnh bi ton phn loi nh

Hnh 4.2. S chc nng nhn dng i tng

4.1.2. Thut ton s dng:
Rt cc c trng nh:
Nh ni trong chng 2 ca lun vn, cch chn phng php nhm rt
ra nhng c trng bt bin ca nh l ht sc quan trng. N khng ch nh hng
ti tnh chnh xc ca chng trnh m cn nh hng ti hiu xut na. Chnh v l
tc gi thc nghim trn mt s phng php, nhm a ra cch chn phng
php sao cho hiu qu. Sau y l mt s hnh nh tc gi so snh hiu qu ca
cc thut ton.

71

Hnh 4.3: Phng php SURF

Hnh 4.4: Phng php Hessian-Laplace

72

Hnh 4.4: Phng php SIFT

Sau y l bng so snh:

Bng 4.1: Bng so snh kt qu cc phng php

Phng php

Kt qu

SURF
SIFT
Hessian-Laplace

38173
40907
30524

Thi gian
(giy)
5
6
3

Nh vy tc gi nhn thy. Vi phng php Hessian-Laplace tuy thi gian

thc hin l nhanh nht nhng s lng im nh rt ra c li thp hn ht. iu
ny nh hng khng nh ti tnh chnh xc ca chng trnh, cn v hai phng
php cn li SIFT tuy c chm hn SURF nhng li cho kt qu cao hn, iu ny
tc gi nhn thy l kh thi v quyt nh chn SIFT lm phng php rt ra c
trng nh cho chng trnh.

Phn loi cc c trng:

Trong m t bi ton c nu l cc nhm nh c phn loi th cng trc,
sau cc nh tham gia truy vn s c sp xp vo cc nhm ny. Tuy nhin vic
phn loi th cng ny nhm mc ch kim th tnh chnh xc ca chng trnh m
thi. Trong vic phn loi c trng ny tc gi s dng thut ton K-Mean phn
loi. Cc nh trong b my hc s c gom chung li vi nhau sau i qua bc

73

ly c trng ri mi phn tch ra thnh cc nhm. Qui trnh my hc ny c

thc hin qua cc bc sau:
B1: p dng SIFT ly c trng nh
B2: Loi bt cc c trng khng tim nng
B3: Xc nh s nhm mun phn loi
B4: p dng K-Mean cho tp hp cc c trng ny
B5: Kim th v gn nhn cho nhm c trng
Cng vic gn nhn ny tc gi thc hin th cng, v sau khi gom chung cc
nh tham gia my hc li vi nhau v i qua bc 1 th cc c trng l khng xc
nh. Tip n bc 4 sau khi c c cc nhm c trng, cc nhm ny ch mang
tnh khi nim. Chnh v l ny ta cn phi xc nh chnh xc cc nhm v gn
nhn cho cc nhm bng phng php th cng.

4.2. Hin thc bi ton

4.2.1. Mi trng
Bng 4.2: Mi trng thc nghim
Thnh phn

Ch s

CPU

Core 2 Duo T7300 2.0 Ghz

RAM

2Gb

HDD

160Gb

OS

Window 7 Ultimate

4.1.2. Cng c s dng

Cng c m ngun m c s dng trong chng trnh:
Bng 4.3: Cng c m ngun m s dng
Tn cng c

Cng dng v ngun

74

Cng c rt trch c trng ca tc gi Guoshen Yu, JeanMichel Morel.

Asift
http://www.cmap.polytechnique.fr/~yu/research/ASIFT/de
mo.html

Chng trnh c xy dng trn nn tng .Net Framework 4 vi cng c

h tr lp trnh Visual studio 2010 (C# 2010).
Ngoi cc cng c trn, tc gi xy dng cc module x l sau:

Module my hc. Dng cho vic gom nhm cc c trng.

Module phn loi. Tin hnh phn loi nh.
4.1.3. D liu
D liu bao gm 2000 bc nh thu thp t internet phc v cho vic my
hc v 100 bc nh khc cng thu thp t internet phc v cho vic kim th.
4.1.4. Chng trnh

Module phn
loi nh.

Module my
hc.

Hnh 4.5: giao din chng trnh.

Module my hc:

75

Hnh 4.6: Cng on rt trch c trng.

Hnh 4.7: mt phn gc nhn ca tp c trng.

Module phn loi:

76

Hnh 4.8: Cng on phn cm cc c trng.

S nhm mun phn loi.

c trng cc nhm.
nh tham gia hc my

Hnh 4.9: Sau khi phn thnh 2 cm.

77

Hnh 4.10: c trng nhm 1 (class1.lhu).

Kim th:

Ch s tng
ng

Kt lun.

Hnh 4.11: Kt qu kim th.

4.1.5. nh gi.
o Recall-Precision:
Gi R l tp cc hnh nh thuc vo mt nhm nh nht nh, nhm nh
ny do chnh tay con ngi tp hp. y l tp nh tr v ca chng trnh ng
l ra phi tr v sau khi tr v kt qu nu chng trnh hot ng tt nht. Gi A
l tp cc nh tr v trong thc t m chng trnh chy v cho ra kt qu, v R a

78

l tp hp giao ca A v R (ngha l R a cha cc hnh nh tr v ca chng

trnh c nh gi trn l thuyt l ng so vi ln chy ca chng trnh).
Recall =

| |
||

Precision =

| |
||

Sau khi tin hnh thc nghim trn b d liu khong 2000 nh cho vic
my hc. Trong c:

500 nh ng vt.
600 nh hoa.
400 nh hong hn.
500 nh phong cnh.

v 200 nh cho vic test th nghim trong c:

50 nh ng vt.
50 nh hoa.
50 nh hong hn.
50 nh phong cnh.
Bng 4.4: 4 nhm nh v s lng mu dng trong thc nghim.

Tn nhm
Hoa
Hong hn
ng vt
Phong cnh

S mu hun
luyn.
600
400
500
500

S mu kim
chng.
50
50
50
50

Tng s mu
(hnh nh).
650
450
550
550

79

Bng 4.5: Kt qu kim chng sau khi chy chng trnh.

Tn nhm
Hoa
Hong hn
ng vt
Phong cnh

Kt qu tr v (trn l
thuyt)
35
40
30
35

S nh thc
ng
23
28
20
22

S nh nhn din
sai
12
12
10
13

Bng 4.6: Xc sut ca chng trnh.

Tn nhm
Hoa
Hong hn
ng vt
Phong cnh
Kt qu trung bnh

Precision
82.85%
70.00%
83.33%
77.14%
78.33%

Recall
58.00%
56.00%
50.00%
54.00%
54.50%

80

KT LUN V KIN NGH.

Lun vn tin hnh nghin cu gii quyt bi ton phn loi nh da vo c
trng cc b bt bin SIFT. Bi ton l nn tng cho nhiu ng dng quan trng
thc t nh h thng khuyn co ngi dng, ci thin tm kim nh, lc web
Phng php gii quyt ca lun vn tp trung vo qu trnh rt trch c trng

nh cho c d liu hc my v d liu cn phn loi da vo c trng cc b bt

bin SIFT, v biu din nh di dng vector. Tip n dng thut ton K-mean
gom nhm cc c trng li.
a ra v s dng o tng ng nh gi phn loi.
Mt m hnh phn loi cng c a ra t cc bc tin x l cho ti khi a
gi tr cui cng t kt qu kh quan, cho thy tnh ng n ca vic la chn
cng nh kt hp cc phng php.
Tuy bc u t mt s kt qu kh quan, nhng vn tn ti mt s
vn cn khc phc:
+ Mt nh u vo cn phn loi sau qu trnh phn loi cho kt qu thuc
vo mt th loi duy nht.
+ Hn ch s lng v cht lng ca kho d liu nh hng n cht lng
phn loi ca h thng.
Hng pht trin ca lun vn

Trong khun kh lun vn s lng nhm cn hn ch, thi gian thc thi
cn lu cn phi khc phc do cn phi ci tin cc quy trnh x l tng tc
cho h thng.

81

TI LIU THAM KHO.

Ting Anh:
[1] A flexible scheme for representation, matching, and retrieval of
images. C. V. Jawahar, P. J. Narayanan, and S. Rakshit(2000). ICVGIP 2000,
pages 271277. Allied Publishers Ltd., 2000.
[2] Beyond Bags of Features: Spatial Pyramid Matching for Recognizing
Natural Scene Categories ca ng tc gi Svetlana Lazebnik, Cordelia Schmid,
Jean Ponce. c pht hnh vo 08-2009.
[3] Boosting Image Classification with LDA-based Feature Combination
for Digital Photograph Management ca ng tc gi Xuezheng Liu, Lei Zhang,
Mingjing Li, Hongjiang Zhang, Dingxing Wang. c pht hnh vo 07-2008.
[4] Combining Local and Global Image Feature for Object Class
Recognition ca tc gi Dimitri A. Lisin, Marwan A. Mattar, Matthew B.
Blaschko, Mark C. Benfield, Erik G. Learned-Miller. c pht hnh vo nm
2010.
[5] Content Based Image Retrieval by K-Means Clustering Algorithm ca
tc gi Vanita G. Tonge, Department of Computer Technology, RCERT,
Chandrapur (M.S.) pin:442403, India. Match 25, 2009.
[6] Distinctive Image Features from Scale-Invariant Keypoints. David G.
Lowe, Computer Science Department University of British Columbia
Vancouver, B.C., Canada lowe@cs.ubc.ca January 5, 2004.
[7] Face Recognition using SIFT Features. Mohamed Aly(2006),
AlyCNS186 Term Project Winter.
[8] Feature Selection in Example-Based Image Retrieval Systems. V. Shiv
Naga Prasad. A.G. Faheema, Subrata Rakshi(2002), Indian Conference on
Vision Graphics and Image Processing.
[9] Image Classification using Super-Vector Coding of Local Image
Descriptors ca tc gi XiZhou, Kai Yu, Tong Zhang, Thomas S. Huang. c
n phm vo nm 2008.
[9] Object Recognition from Local Scale-Invariant Features ca tc gi
David G. Lowe, thuc khoa khoa hc my tnh, trng i hc British Columbia.
Pht hnh vo nm 2005.

82

[10] Object Recognitionusing Local Descriptors ca tc gi Javier Ruiz v

Patricio Loncomila thuc trung tm nghin cu khoa hc Chile. 12/2004.
[11] Online feature Selection based on Generalized Feature Contrast
Model. W. Jiang. M. Li, H. Zhang, J. Gu. (2004. IEEE International Conference
on Multimedia and Expo(ICME). pp. 1995-1998
[12] Recognizing Indoor Scenes ca tc gi Ariadna Quattoni, Antonio
Torralba. 01/2004.
[13] Similarity-Based Online Feature Selection In Content-Based Image
Retrieval. W. Jiang, G. Er, Q. Dai and J. Gu. (2006). IEEE Trans. Image
Processing, 15 (3), pp.702-712.
[14] Speeded-up Robust Features (SURF), Herbert Bay, Andreas Ess,
Tinne Tuytelaars, Luc Van Gool, 12/2007.
[15] SVM-KNN: Discriminative Nearest Neighbor Classification for
Visual Category Recognition ca ng tc gi Hao Zhang, Alexander C. Berg,
Michael Maire, Jitendra Malik thuc khoa khoa hc my tnh trng i hc
Berkeley, California. Nm n hnh 2006.
[16] Texture classification of aerial image based on bayesian network
augmanted nave bayes ca ng tc gi YU Xin, ZHENG Zhaobao, ZHANG
Haitao, YE Zhiwei. 03/2008.
[17] Unsupervised real-time constrained linear discriminant analysis to
hyperspectral image classification ca tc gi Qian Du, Department of Electrical
and Computer Engineering, Missisippi State University, MS 39762, USA.
Accepted 14 August 2006.
[22] A Comparative Study of Three Image Matcing Algorithms: Sift, Surf,
and Fast. Ca tc gi Maridalia Guerrero thuc Utah State University, n hnh
vo ngy 01-01-2011.
[23] Viola P. and Jones M. 2001, Rapid object detection using a boosted
cascade of simple features, In: CVPR (1).
Ting Vit:
[18] Gii thiu ng dng phng php phn loi da trn i tng
(Object-based classification) trong thnh lp bn rng t nh v tinh ca tc
gi Ts. V Anh Tun. 11/2009.

83

[19] Nghin cu phng php kt hp cc c trng mu sc hnh dng v

v tr truy vn nh, lun vn thc s ca tc gi Trn Sn Hi, nm 2007.
[20] phng php trch chn c trng nh trong thut ton hc my tm
kim nh p dng vo bi ton tm kim sn phm. Kha lun tt nghip ca tc
gi Nguyn Th Hon nm 2010.
[21] Xc nh cm xc mt ngi ca tc gi Trn Ngc Phm. 12/2009.
Web tham kho
http://bis.net.vn/forums/t/374.aspx Thut ton K-Means vi bi ton phn
cm d liu.