i

I HC QUC GIA H NI
TRNG I HC CNG NGH


Nguyn Th Hon



PHNG PHP TRCH CHN C TRNG NH
TRONG THUT TON HC MY TM KIM NH P
DNG VO BI TON TM KIM SN PHM





KHO LUN TT NGHIP I HC H CHNH QUY
Ngnh: Cng Ngh Thng Tin







H Ni 2010

ii



I HC QUC GIA H NI
TRNG I HC CNG NGH



Nguyn Th Hon



PHNG PHP TRCH CHN C TRNG NH
TRONG THUT TON HC MY TM KIM NH P
DNG VO BI TON TM KIM SN PHM



KHO LUN TT NGHIP I HC H CHNH QUY
Ngnh: Cng Ngh Thng Tin




Cn b hng dn: PGS.TS. H Quang Thy
Cn b ng hng dn: Ths. Nguyn Cm T




H Ni - 2010
iii

Li cm n

Trc tin, ti xin gi li cm n v lng bit n su sc nht ti Ph Gio
s Tin s H Quang Thy v Thc s Nguyn Cm T, ngi tn tnh ch bo v
hng dn ti trong sut qu trnh thc hin kho lun tt nghip.
Ti chn thnh cm n cc thy, c to nhng iu kin thun li cho ti hc
tp v nghin cu ti trng i hc Cng ngh.
Ti cng xin gi li cm n ti cc anh ch, cc bn v cc em sinh vin trong
phng nghin cu SIS-KTLab gip ti rt nhiu trong vic h tr kin thc chuyn
mn hon thnh tt kho lun.
Cui cng, ti mun gi li cm v hn ti gia nh v bn b, nhng ngi thn
yu lun bn cnh v ng vin ti trong sut qu trnh thc hin kha lun tt nghip.
Ti xin chn thnh cm n !



Sinh vin
Nguyn Th Hon
iv

Tm tt

S pht trin mnh m ca cng ngh nh s lm lng nh lu tr trn web tng
ln mt cch nhanh chng i hi phi c cc cng c h tr tm kim nh hiu qu v
tin li. Mc d cc cng c tm kim nh theo vn bn i km nh ra i cho php
ngi dng tm kim nh vi thi gian p ng kh nhanh, tuy nhin, cc cng c ny
vn cn hn ch trong vic gii quyt nhp nhng gia ni dung cu truy vn v ni
dung hin th ca nh tr v. S ra i ca cc cng c tm kim nh theo ni dung nh
gii quyt c nhng nhp nhng trn.
Mc tiu ca kha lun l nghin cu cc phng php biu din c trng nh
nng cao cht lng tm kim nh. u tin, kha lun kho st phng php trch
chn c trng nh trong tm kim v xp hng nh. Tip , da theo phng php
lng t ha tch ca Herv Jgou v cng s [12], kha lun a ra mt m hnh tm
kim k lng ging gn nht kt hp o tng ng v khong cch gia cc vector
c trng v tin hnh thc nghim m hnh. Thc nghim ban u cho thy, t mt
nh truy vn u vo h thng tr v 10 nh tng ng nht i vi mi truy vn vi
chnh xc 80.4% v y l mt kt qu kh quan.

v

Mc lc

M u ....................................................................................................... 1
Chng 1. Khi qut v trch chn c trng nh v tm kim theo c
trng nh ....................................................................................................... 3
1.1. t vn ....................................................................................................... 3
1.2. c trng vn bn i km nh v tm kim nh theo vn bn i km nh. ....... 3
1.3. c trng ni dung nh v tm kim theo c trng ni dung. ......................... 5
Tng kt chng 1 ................................................................................................... 8
Chng 2. Cc phng php la chn c trng v o tng ng
gia cc nh .................................................................................................... 10
2.1. t vn ..................................................................................................... 10
2.2. c trn g mu sc ........................................................................................ 11
2.2.1. c trng mu sc ................................................................................ 11
2.2.2. o tng ng cho mu sc ............................................................. 11
2.3. c trng kt cu .......................................................................................... 12
2.3.1. c trng kt cu .................................................................................. 12
2.3.2. o tng ng cho kt cu .............................................................. 12
2.4. c trng hnh dng ...................................................................................... 13
2.4.1. c trng hnh dng.............................................................................. 13
2.4.2. o tng ng cho hnh dng .......................................................... 13
2.5. c trng cc b bt bin .............................................................................. 13
2.5.1. c trng cc b bt bin ..................................................................... 14
2.5.2. o tng ng cho c trng cc b bt bin .................................. 18
2.6. La chn c trng ....................................................................................... 18
Tng kt chng 2 ................................................................................................. 20
Chng 3. Mt s phng php tm kim nh theo ni dung .................... 21
3.1. Phng php PageRank cho tm kim nh sn phm ..................................... 21
3.2. CueFlik: Mt phng php xp hng li nh da trn lut ca ngi dng ... 22
vi

3.3. Phng php tm kim nh da trn mu sc, hnh dng, kt cu ca nh ..... 24
3.3.1. Li ...................................................................................................... 25
3.3.2. Tch hp cc i snh nh ..................................................................... 25
3.3.3. Hnh dng: ............................................................................................ 26
3.4. Phng php tm kim nh da vo ni dung s dng cc phn vng nh nh
mu truy vn .......................................................................................................... 26
Tng kt chng 3 ................................................................................................. 27
Chng 4. M hnh k lng ging gn nht s dng b lng t ha ......... 28
4.1. t vn ..................................................................................................... 28
4.2. C s l thuyt .............................................................................................. 28
4.2.1. Cc k hiu v khi nim ...................................................................... 28
4.2.2. Tm kim s dng lng t ha ............................................................ 30
4.2.3. Tm kim khng ton b ....................................................................... 31
4.3. M hnh bi ton ........................................................................................... 33
4.3.1. Trch chn c trng nh ...................................................................... 33
4.3.2. Tm kim K lng ging gn nht ........................................................... 34
Tng kt chng 4 ................................................................................................. 35
Chng 5. Thc nghim v nh gi ........................................................... 36
5.1. Mi trng v cc cng c s dng cho thc nghim .................................... 36
5.2. Xy dng tp d liu nh .............................................................................. 37
5.3. Quy trnh, phng php thc nghim ............................................................ 38
5.4. Kt qu thc nghim ..................................................................................... 38
Tng kt chng 5 ................................................................................................. 41
Kt lun ..................................................................................................... 42
Ti liu tham kho ......................................................................................... 43

vii

Danh sch cc bng
Bng 1. Cu hnh phn cng s dng trong thc nghim ................................................ 36
Bng 2. Cng c phn mm s dng trong thc nghim ................................................. 36
Bng 3. Mt s th vin s dng trong thc nghim ....................................................... 37
Bng 4. Kt qu chnh xc trung bnh ca 10 truy vn ............................................... 40
Bng 5. chnh xc mc k ca mt s truy vn ........................................................... 40

Danh sch cc hnh v
Hnh 1. V d hin th mt nh .......................................................................................... 4
Hnh 2. V d truy vn ca Google.................................................................................... 5
Hnh 3. V d truy vn ca Google.................................................................................... 5
Hnh 4. V d v mt s lai kt cu ................................................................................. 6
Hnh 5. Mt kt qu tr v ca Google Image Swirl .......................................................... 7
Hnh 6. Mt kt qu tr v ca Tiltomo............................................................................. 7
Hnh 7. Mt kt qu tr v ca Byo Image Search ............................................................ 8
Hnh 8. Biu m phng vic tnh ton cc DoG nh t cc nh k m ....................... 15
Hnh 9. Mi im nh c so snh vi 26 lng ging ca n......................................... 16
Hnh 10. Qu trnh la chn cc im hp dn ................................................................ 17
Hnh 11. Biu din cc vector c trng ......................................................................... 18
Hnh 12. V d cc nh sn phm tr v t h thng ca Jing ......................................... 22
Hnh 13. Tng quan v m hnh ca h thng tm kim theo mu sc, kt cu v hnh
dng ................................................................................................................................ 25
Hnh 14. M hnh h thng IVFADC .............................................................................. 33
Hnh 15. M hnh gii quyt bi ton .............................................................................. 34
Hnh 16. 10 kt qu tr v u tin ca h thng vi truy vn Apple ............................... 41


viii

Danh sch cc t vit tt

STT T vit tt T vit y
1 ADC Asymmetric distance computation
2 AP Average Precision
3 BDA Biased Discriminant analysis
4 CBIR Content Based Images Retrieval
5 DoG Difference of Gaussian
6 IVFADC Inverted file asymmetric distance Computation
7 JSD Jensen-Shannon divergence
8 MAP Mean Average Precision
9 MDA Multiple Discriminant analysis
10 QBIC Query Based Image Content
11 SDC Symmetric distance computation
12 SIFT Scale Invariant feature transform
13 SMMS Symmetric maximized minimal distance in subspace

ix

Danh sch tham chiu thut ng Anh Vit

STT Thut ng ting Anh Thut ng ting Vit
1 Asymmetric distance Khong cch bt i xng
2 Biased Discriminant analysis Phn tch bit thc khng i xng
3 Boosting manner Tng khuych i
4 Content Based Images Retrieval Tm kim nh theo ni dung
5 Co-occurrence matrix Ma trn ng xut hin
6 Cotourlet transform Bin i ng vin
7 Discriminant analysis Phn tch bit thc
8 Distribution based method Phng php da vo phn phi
9 Feature contrast Model M hnh tng phn c trng
10 Feature selection La chn c trng
11 Gabor Wavelet transform Bin i sng Gabor
12 Global texture descriptor t t kt cu ton cc
13 Image Segment Phn vng nh
14 Interest point im hp dn
15 Inverted file asymmetric distance
computation
Tnh ton khong cch bt i xng file
ch mc ngc
16 Inverted list Danh sch ch mc ngc
17 Local features c trng cc b
18 Local interest Point im hp dn cc b
19 Local scale invariant feature c trng cc b bt bin
20 Mean Average Precision chnh xc trung bnh
21 Metadata Siu d liu
22 Non exhausitive search Tm kim khng ton b
23 Product quantization Lng t ha tch
24 Quantization code M lng t ha
25 Query Based Image Content Truy vn theo ni dung nh
26 Similarity measurment o tng ng
27 Symmetric distance Khong cch i xng
28 Texture Kt cu
29 The complex directional fillter B lc nh hng phc tp
30 The steerable pyramid Kim t thp c th li c
31 Visual hyperlinks Siu lin kt trc quan

1

M u

Cng vi s bng n thng tin trn web v s pht trin ca cng ngh k thut
s, lng nh lu tr trn Web cng tng mt cch nhanh chng. V vy, vic xy
dng cc h thng tm kim v xp hng nh l rt cn thit v thc t c nhiu
cng c tm kim nh thng mi xut hin. Cc cng c tm kim nh thng da
vo hai c trng chnh l vn bn i km nh hoc ni dung nh. Mt s cng c tm
kim nh theo vn bn i km nh Google Image Search, Yahoo!, MSN,Mt s
cng c tm kim nh da vo ni dung nh nh Google Image Swirl, Bing, Tiltomo,
Tineye,Tuy nhin, vic tm kim ch da vo vn bn i km cn c nhiu nhp
nhng gia ni dung hin th nh v ni dung vn bn i km nh trong qu tnh tm
kim. V d, vi truy vn Apple, my tm kim kh phn bit c ngi dng
mun tm hnh nh qu to hay logo ca hng Apple. Nhng cng c tm kim nh
theo ni dung ca cc bc nh ra i t ra u th v hn ch c nhng nhp nhng
trn.
Tm kim nh theo ni dung nhn c nhiu s quan tm ca cc nh khoa
hc. Nhiu cng trnh nghin cu v tm kim nh theo ni dung c ng trn cc
tp ch nh International Journal of Computer Vision, IEEE conference Nhm
nghin cu chng ti tin hnh mt s nghin cu bc u lin quan n xp hng
nh da vo tng ng theo ni dung nh trong cng tc sinh vin nghin cu
khoa hc.
Kha lun Phng php trch chn c trng nh trong hc my tm kim nh v
ng dng trong trong tm kim sn phm nhm kho st, phn tch mt s phng
php trch chn c trng nh ph bin v tm kim nh theo nh mu, th nghim h
thng trong ng dng tm kim sn phm.
Ngoi phn M U ny, kha lun bao gm cc ni dung sau:
- Chng 1. Khi qut v la chn c trng cho tm kim nh. Cc c trng v
v vn bn i km nh v c trng v ni dung nh.
- Chng 2. Cc phng php la chn c trng v o tng t gia nh.
Trnh by mt s c trng v ni dung nh v mt s o tng ng tng
ng vi cc c trng.

2

- Chng 3. Mt s phng php tm kim v xp hng nh da trn ni dung
ca nh. Gii thiu mt s cng trnh nghin cu lin quan n tm kim nh
theo ni dung nh.
- Chng 4. M hnh tm kim K lng ging gn nht. Gii thiu m hnh tm
kim K lng ging gn nht, phng php lu tr v nh ch mc trong tm
kim.
- Chng 5. Thc nghim. Trnh by qu trnh thc nghim, kt qu, nhn xt,
nh gi khi p dng m hnh K lng ging gn nht vi cc c trng trch
chn trong tm kim nh sn phm.
- Cui cng l phn KT LUN. Tng kt cc kt qu chnh ca kha lun v
phng hng nghin cu tip theo.

3

Chng 1. Khi qut v trch chn c trng nh v tm kim
theo c trng nh

1.1. t vn
S pht trin mnh m ca cng ngh nh s lm lng nh lu tr trn web tng
ln mt cch nhanh chng. Mi ngy, c hng triu bc nh c ng ti trn cc
trang nh trc tuyn nh: Flickr
1
, Photobucket
2
, Facebook
3
,. Theo thng k, c 10
t nh trn Facebook (tnh n thng 10/2008), 3 t nh trn Flickr (tnh n thng
11/2008), 6.2 t nh trn Photobucket(tnh n thng 10/2008) [36].
Cng vi nhu cu tm kim vn bn, nhu cu tm kim nh cng nhn c nhiu
quan tm ca ngi s dng. Tuy nhin, vi mt s lng nh qu ln trn Internet
cng vic tm kim tr nn v cng kh khn. gii quyt vn ny, cc h thng
tm kim nh ra i nh: Yahoo, MSN, Google Image Search, Bing,. Cc h
thng ny cho php ngi s dng nhp truy vn v cc nh cn quan tm. Thng qua
vic phn tch cc vn bn i km nh, h thng gi tr cc nh tng ng vi truy
vn ca ngi dng. Mt s cng c tm kim nh thng mi khc nh Tiltomo,
ByoImageSearch, cho php ngi dng nhp cu hi di dng nh. y l mt
hng nghin cu mi nhn c nhiu s quan tm ca nhiu cng trnh khoa hc
trn th gii. Mt s sn phm th nghim ca cc cng ty ln v tm kim nh nh:
Google Image Swirl, Like, Tineye, Tiltomo. ra i.
Chng 1 trnh by v cc c trng ca nh gm c trng vn bn i km nh
v c trng v ni dung nh( mu sc, kt cu, hnh dng, c trng cc b) v mt
s vn v tm kim nh.
1.2. c trng vn bn i km nh v tm kim nh theo vn bn i km
nh.
Mi nh trn web thng c cc vn bn i km nh l tn nh (title), cc th
(tags), bnh lun (comment), m t cc thng tin v nh, y l cc siu d liu

1
Flickr: http://www.flickr.com
2
Photobucket: http://www.photobucket.com
3
Facebook: http://www.facebook.com

4

(metadata) v nh. Cc d liu ny thng do ngi dng to nh gn cho mi nh, v
vy chng u mang mt ngha nht nh. quan trng ca cc loi siu d liu
khc nhau cng khc nhau. V d, cc th thng quan trng hn tn nh, tn nh quan
trng hn bnh lun. Di y l mt v d v vn bn i km mt nh:
- Title: Red_Rose Flower
- Tags: redRoseflower, hongkongflowershow, 2009, bokeh, causewaybay,
hongkong, jonnoj, jonbinalay, nikond80, interestingness50
- Description: HEAVEN SCENT"...FOR THE LOVE OF THE RED RED
ROSE...
- Content:

Hnh 1. V d hin th mt nh

V vn bn i km nh mang ng ngha v ni nh cho nn hai bc nh c ni
dung ging nhau thng c tn ging nhau v cc th tng t nhau. V vy, cc cng
c tm kim nh theo vn bn i km thng tp trung khai thc ni dung ca cc vn
bn ny tm kim v xp hng nh. Phng php ny cho kt qu kh quan cng
nh p ng nhanh nhu cu ca ngi s dng. Tuy nhin, vi cc cu truy vn mang
ngha nhp nhng c th cc kt qu tr v s khng ng vi yu cu t ra. V d
khi truy vn l d-80, mt my nh ph bin ca Nikon, th cc h thng tr v kt
qu kh tt (hnh 2). Tuy nhin, vi truy vn apple, nu ngi dng mun tm qu
to th kt qu tr v u tin khng tha mn (logo ca hng Apple) (hnh 3):

5


Hnh 2. V d truy vn ca Google
Kt qu vi truy vn d-80

Hnh 3. V d truy vn ca Google
Kt qu vi truy vn Apple
Mt khc, cc albumn c nhn thng khng c cc th hoc vn bn i km nh.
Cng vi s lng nh s c chp thm mi ngy, vic gn th cng cc th cho
nh rt tn km. Mt hng nghin cu nhm khc phc vn trn l tm kim theo
chnh cc c trng trch xut t ni dung ca nh.
1.3. c trng ni dung nh v tm kim theo c trng ni dung.
Tm kim nh theo ni dung (Content Based Images Retrieval CBIR) hay truy vn
theo ni dung nh (Query Based Image Content QBIC) l mt ng dng ca th gic
my tnh i vi bi ton tm kim nh [30][35]. Da vo ni dung nh (Content-
Based) ngha l vic tm kim s phn tch ni dung thc s ca cc bc nh. Ni
dung nh y c th hin bng mu sc, hnh dng, kt cu (texture), cc c
trng cc b (local features), hay bt c thng tin no c t chnh ni dung nh.
Cm t CBIR c T.Kato a ra vo nm 1992 trong qu trnh thu thp nh mt cch
t ng t c s d liu da trn biu din mu sc v hnh dng ca nh. Tee Cheng
Siew gii thiu mt s c trng ni dung nh[23]:
- c trng mu sc: Mu sc l mt c trng ni bt v c s dng ph bin
nht trong tm kim nh theo ni dung. Mi mt im nh (thng tin mu sc)
c th c biu din nh mt im trong khng gian mu sc ba chiu. Cc
khng gian mu sc thng dng l: RGB, Munsell, CIE, HSV. Tm kim nh
theo mu sc tin hnh tnh ton biu mu cho mi nh xc nh t trng
cc im nh ca nh m cha cc gi tr c bit (mu sc). Cc nghin cu
gn y ang c gng phn vng nh theo cc mu sc khc nhau v tm mi
quan h gia cc vng ny.

6

- c trng kt cu: Trch xut ni dung nh theo kt cu nhm tm ra m hnh
trc quan ca nh v cch thc chng c xc nh trong khng gian. Kt cu
c biu din bi cc texel m sau c t vo mt s cc tp ph thuc
vo s kt cu c pht hin trong nh. Cc tp ny khng ch xc nh cc kt
cu m cn ch r v tr cc kt cu trong nh. Vic xc nh cc kt cu c
bit trong nh t c ch yu bng cch m hnh cc kt cu nh nhng bin
th cp xm 2 chiu. V d v mt s loi kt cu[41]

Hnh 4. V d v mt s lai kt cu

- c trng hnh dng: Hnh dng ca mt nh hay mt vng l mt c trng
quan trong trong vic xc nh v phn bit nh trong nhn dng mu. Mc tiu
chnh ca biu din hnh dng trong nhn dng mu l o thuc tnh hnh hc
ca mt i tng c dng trong phn lp, so snh v nhn dng i tng.
Thc t, c nhiu my tm kim cho php tm kim nh theo ni dung nh, tuy
nhin, cc my tm kim ny thng ch khai thc vo mt phn ni dung ca nh.
- Google Image Swirl: L mt th nghim tm kim hnh nh theo ni dung ca
Google, trong , kt qu tm kim c s c t chc li da vo hin th trc
quan v tng ng ng ngha gia cc nh. Google Image Swril phn cm tp
u cc kt qu tr v cho trn 200.000 cu truy vn v cho php hin th hnh nh
di dng cc cm v mi quan h gia cc nh.

7


Hnh 5. Mt kt qu tr v ca Google Image Swirl


- Tiltomo: L mt cng c da trn Flickr v duy tr chnh c s d liu nh ca
Flickr. N cho php tm kim nh da vo tng ng v ch , mu sc
hay kt cu.




Hnh 6. Mt kt qu tr v ca Tiltomo


8

- Byo Image Search: Tm kim nh theo tng ng v mu sc vi mu nh
m ngi dng ti ln t my tnh hoc t mt a ch URL. Cng c tm kim
ny khng h tr tnh nng tm kim nh da vo tng ng v ch .



Hnh 7. Mt kt qu tr v ca Byo Image Search

Tm kim nh theo mu (example-based image search): Tm kim nh theo
mu l mt dng ca tm kim nh da vo ni dung. Trong h thng , u vo l
mt nh, h thng tm kim v tr li cho ngi dng nhng nh tng ng vi nh
mu.
Trong ni kha lun ny, chng ti tp trung vo bi ton tm kim nh da theo
mu, tm hiu cc phng php trch chn c trng ni dung cng nh cc o
tng ng tm kim tp nh sn phm gn vi nh mu nht trong tp c s d
liu cc nh sn phm.
Tng kt chng 1
Trong chng ny, chng ti trnh by khi qut c trng vn bn i km nh
v c trng ni dung ca nh, v gii thiu mt s cng c tm kim da vo ni
dung nh. Phng php tm kim nh theo ni dung khc phc c mt phn

9

nhc im ca phng php tm kim nh theo vn bn i km nh v cho ra nhng
kt qu kh quan. Chng 2, kha lun s trnh by mt s cng trnh nghin cu khoa
hc lin quan n bi ton tm kim nh theo ni dung.

10

Chng 2. Cc phng php trch chn c trng v o tng
ng gia cc nh

2.1. t vn
Trong tm kim nh theo ni dung, vic la chn cc c trng thch hp vi
tng loi truy vn v min ng dng cng vi cc o tng ng tong ng l
thnh phn quan trng v then cht nht[31]. Vic la chn cc c trng v o
thch hp s gip tng c tc v mc chnh xc ca cc h thng. J.V.Jawahe v
cng s [32] nu ra cc yu cu c bn i vi thnh phn la chn c trng cho
nh:
- Thnh phn la chn c trng phi la chn c mt tp cc c trng cung
cp u vo tt nht cho h thng tm kim nh. Nu s lng cc c trng
qu nhiu s lm che khut cc tn hiu (gim cc tn hiu i vi t l
nhiu), mt khc, nu s lng cc c trng qu t s kh phn bit c nh
trong tm kim.
- N phi gim bt c phc tp trong lc tnh ton tng th bng gim a
chiu ca bi ton phn lp.
- Khi ngi dng mun s dng cc c trng cho mi truy vn, th vic s
dng cc c trng ny phi hiu qu. V s lng cc c trng c th l hng
ngn, d thi gian x l ca module phi tuyn tnh vi s lng c trng.
- V thi gian x l ca thnh phn la chn c trng tuyn tnh vi s lng
c trng, do vic la chn cc c trng cng nn tuyn tnh da trn phn
lp.
- Thnh phn la chn c trng c th x l c vi kch thc tp mu nh
(khong 5 mu).
Trong chng ny, chng ti s trnh by s b v cc vn v c trng ca
nh(mu sc, kt cu, hnh dng, c trng cc b SIFT), mt s o tng ng
tng ng vi cc c trng v phng php la chn c trng nh tng cht
lng tp c trng.




11

2.2. c trng mu sc
2.2.1. c trng mu sc
Tm kim nh theo lc mu l phng php ph bin v c s dng nhiu
nht trong cc h thng tm kim nh theo ni dung. y l phng php n gin, tc
tm kim tng i nhanh tuy nhin kt qu tm kim c chnh xc khng cao.
y c th xem l bc lc u tin cho nhng bc tm kim sau. Mt s lc
mu c s dng nh: lc mu RGB, lc mu HSI, lc HSI ci tin.
Trong , lc mu RGB c s dng ph bin nht[18][20].
- Lc mu RGB:
i vi nh 256 mu, lc mu ca nh tng ng vi lc mu ca nh
xm. i vi nh 24 bit mu, lc miu t kh nng kt ni v cng ca ba
knh mu R, G, B. Luc mu ny c nh ngha nh sau:
| | { }
, ,
, , Pr , ,
R G B
h r g b N ob R r G g B b = - = = = (1)
Trong N l s lng im c trong nh.
Lc mu ny c tnh bng cch ri rc ha tng mu trong nh, sau
m s im nh ca mi mu. Khi m s lng mu l c hng, thun tin hn,
ngi ta thng chuyn i ba knh mu thnh mt bin gi tr duy nht. Mt cch
khc tnh lc mu ca nh RGB l ta phn ra lm 3 lt ring bit []
R
h ,
[]
G
h , []
B
h . Khi , mi lc c tnh bng cch m knh mu tng ng trong
mi im nh.
2.2.2. o tng ng v mu sc
Mt s o tng ng c s dng nh: o khong cch clit, o
Jensen-Shannon divergence (JSD).
Gi h(I) v h(M) tng ng l 2 lt mu ca hai nh I v nh M. Khi
cc loi o mu c nh ngha l mt s nguyn (hoc s thc) theo cc loi
o tng ng nh sau:
- Khong cch clit:
y l khong cch clit thng thng gia cc K bin:
( )
2
1
er sec ( ( ), ( )) ( ) ( )
K
j
Int tion h I h M h I h M
=
=

(2)


12

Hoc:
1
er sec ( ( ), ( )) ( ) ( )
K
j
Int tion h I h M h I h M
=
=

(3)
- o Jensen-Shannon divergence (JSD) :
o Jensen-Shannon divergence s dng lc mu RGB tnh ton
tng ng v mu sc gia 2 nh :
1
2 2 '
( , ') log ' log
' '
M
m m
JSD m m
m m m m m
H H
d H H H H
H H H H
=
= +
+ +

(4)
Trong : H v H l 2 biu mu c so snh,
m
H l bin th m ca biu H.
2.3. c trng kt cu
2.3.1. c trng kt cu
Hin ti, vn cha c mt nh ngha chnh thc c th v kt cu. Kt cu l mt
i tng dng phn hoch nh ra thnh nhng vng quan tm phn lp nhng
vng [27][24][18][23].
Kt cu cung cp thng tin v s sp xp v mt khng gian ca mu sc v cng
mt nh. Kt cu c c trng bi s phn b khng gian ca nhng mc cng
trong mt khu vc lng ging vi nhau. Kt cu gm cc kt cu gc hay nhiu kt
cu gp li i khi gi l texel.
Mt s phng php dng trch xut cc c trng kt cu nh[18]:
- Kim t thp "c th li c" (the steerable pyramid)
- Bin i ng vin (the cotourlet transform)
- Bin i sng Gabor (The Gabor Wavelet transform)
- Biu din ma trn ng hin (co-occurrence matrix)
- H thng b lc nh hng phc tp (The complex directional fillter bank)
2.3.2. o tng ng cho kt cu nh
o tng ng theo kt cu gia cc nh, ngi ta thng s dng o
clit. Kt cu c trch xut t cc bc nh s c biu din thnh cc vector nhiu
chiu v khong cch clit c dng o tng ng gia cc c trng ca
nh truy vn vi c trng ca nh trong c s d liu.


13

2.4. c trng hnh dng
2.4.1. c trng hnh dng
Mu sc v kt cu l nhng thuc tnh c khi nim ton cc trong mt nh.
Trong khi , hnh dng khng phi l mt thuc tnh ca nh. Ni ti hnh dng
khng phi l nhc n hnh dng ca mt nh. Thay v vy, hnh dng c khuynh
hng ch n mt khu vc c bit trong nh, hay hnh dng ch l bin ca mt i
tng no trong nh.
Trong tm kim nh theo ni dung, hnh dng l mt cp cao hn so vi mu sc v
kt cu. N i hi s phn bit gia cc vng tin hnh x l v o ca hnh
dng. Cc h thng tm kim nh theo ni dung thng khai thc hai nhm biu din
hnh dng sau :
- Biu din hnh dng theo ng bin (cotour-based descriptor) : Biu din cc
ng bin bao bn ngoi
- Biu din theo vng (region-based descriptor): Biu din mt vng ton vn
2.4.2. o tng ng cho hnh dng
o v hnh dng rt nhiu trong phm vi l thuyt ca b mn x l nh.
Chng tri rng t nhng o ton cc dng th vi s tr gip ca vic nhn
dng i tng, cho ti nhng o chi tit t ng tm kim nhng hnh dng c
bit. Lc hnh dng l mt v d ca o n gin. K thut dng ng
bin hiu qu hn phng php trc, chng tm kim nhng hnh dng i tng
gn ging vi ng bin nht. Phng php v phc ha l phng php c nhiu
c trng r rng hn, khng ch tm kim nhng ng bin i tng n, m
cn i vi tp nhng i tng c phn on trong mt nh m ngi dng
v hay cung cp.
2.5. c trng cc b bt bin
Ngi ta thng chia c trng c b thnh 2 loi l nhng im trch xut c
t im "nh ra" (salient points) ca nh v c trng SIFT c trch chn t cc
im hp dn Haris (interest points). Trong phn ny, chng ti s trnh by chi tit v
vic trch chn cc c trng cc b bt bin (Scale Invariant Feature Transform SIFT)
ca nh.

14

2.5.1. c trng cc b bt bin
Phn ny trnh by phng php trch rt cc c trng cc b bt bin SIFT
ca nh. Cc c trng ny bt bin vi vic thay i t l nh, quay nh, i khi l
thay i im nhn v thm nhiu nh hay thay i cng chiu sng ca nh.
Phng php c la chn c tn l Scale-Invariant Feature Transform (SIFT) v c
trng trch rt c gi l c trng SIFT (SIFT Feature). Cc c trng SIFT ny
c trch rt ra t cc im hp dn cc b (Local Interest Point) [17][30][16].
im hp dn (Interest Point (Keypoint)): L v tr (im nh) "hp dn" trn
nh. "Hp dn" y c ngha l im c th c cc c trng bt bin vi vic
quay nh, co gin nh hay thay i cng chiu sng ca nh.
Phng php trch rt cc c trng bt bin SIFT c tip cn theo phng php
thc lc, theo phng php c thc hin ln lt theo cc bc sau:
- Pht hin cc im cc tr Scale-Space (Scale-Space extrema detection):
Bc u tin ny tin hnh tm kim cc im hp dn trn tt c cc t l v v
tr ca nh. N s dng hm different-of-Gaussian xc nh tt c cc im
hp dn tim nng m bt bin vi quy m v hng ca nh.
- nh v cc im hp dn (keypoint localization): Mt hm kim tra s c
a ra quyt nh xem cc im hp dn tim nng c c la chn hay
khng?
- Xc nh hng cho cc im hp dn (Orientation assignment): Xc nh
hng cho cc im hp dn c chn
- M t cc im hp dn (Keypoint descriptor): Cc im hp dn sau khi
c xc nh hng s c m t di dng cc vector c trng nhiu
chiu.
2.5.1.1. Pht hin im cc tr Scale-space
Cc im hp dn vi c trng SIFT tng thch vi cc cc tr a phng
ca b lc difference of-Gaussian (DoG) cc t l khc nhau. nh ngha khng
gian t l ca mt hnh nh l hm (x,y,k ) L c m t nh sau:
(x,y, ) G(x,y,k )* I(x,y) L = (5)
Vi ( , , ) G x y k : bin t l Gaussian (variable scale Gaussian)
( , ) I x y : nh u vo
* l php nhn chp gia x v y

15

V
2 2 2
( )/ 2
2
1
( , , )
2
x y
G x y e

+
=
(6)

pht hin c cc im hp dn, ta i tm cc cc tr ca hm DoG c nh
ngha:
( , , ) ( ( , , ) ( , , )) * ( , ) D x y G x y k G x y I x y =
( , , ) ( , , ) ( , , ) D x y L x y k L x y = (7)
Gi tr hm DoG c tnh xp x da vo gi tr scale-normalized Laplacian of
Gaussian
2 2
( ) G V thng qua cc phng trnh (5)(6)(7)

2
G
G

c
= V
c
(8)
2
( , , ) ( , , ) G G x y k G x y
G
k

c
V = ~
c
(9)
2 2
( , , ) ( , , ) ( 1) G x y k G x y k G ~ V (10)

Nh vy, bc u tin ca gii thut SIFT pht hin cc im hp dn vi b
lc Gaussian cc t l khc nhau v cc nh GoG t s khc nhau ca cc nh k m.


Hnh 8. Biu m phng vic tnh ton cc DoG nh t cc nh k m

Cc nh cun c nhm thnh cc octave (mi octave tng ng vi gi tr
gp i ca ). Gi tr ca k c chn sao cho s lng nh m (blured images) cho

16

mi octave l c nh. iu ny m bo cho s lng cc nh DoG cho mi octave
khng thay i.
Cc im hp dn c xc nh l cc cc i hoc cc tiu ca cc nh DoG
qua cc t l. Mi im nh trong DoG c so snh vi 8 im nh lng ging ca n
cng t l v 9 lng ging k cc t l ngay trc v sau n. Nu im nh
t gi tr cc tiu hoc cc i th s c chn lm cc im hp dn ng vin.

Hnh 9. Mi im nh c so snh vi 26 lng ging ca n

2.5.1.2. nh v im hp dn:
Mi im hp dn ng vin sau khi c chn s c nh gi xem c c gi
li hay khng:
- Loi b cc im hp dn c tng phn thp
- Mt s im hp dn dc theo cc cnh khng gi c tnh n nh khi nh b
nhiu cng b loi b.
Cc im hp dn cn li s c xc nh hng.


17


Hnh 10. Qu trnh la chn cc im hp dn
a. nh gc, b. Cc im hp dn c pht hin, c. nh sau khi loi b cc im hp dn c tng
phn thp, d. nh sau loi b cc im hp dn dc theo cnh.

2.5.1.3. Xc nh hng cho im hp dn:
xc nh hng cho cc im hp dn, ngi ta tnh ton biu hng
Gradient trong vng lng ging ca im hp dn. ln v hng ca cc im hp
dn c xc nh theo cng thc:

(11)
(12)

2.5.1.4. Biu din vector cho im hp dn
im hp dn sau khi c xc nh hng s c biu din di dng cc
vector 4x4x8=128 chiu.

2 2
( , ) ( ( 1, ) ( 1, )) ( ( , 1) ( , 1)) m x y L x y L x y L x y L x y = + + +
1
( , ) tan (( ( , 1) ( , 1)) / ( ( 1, ) ( 1, ))) x y L x y L x y L x y L x y

= + +

18


Hnh 11. Biu din cc vector c trng
2.5.2. o tng ng cho c trng cc b bt bin
Mt s o tng ng cho nh s dng c trng SIFT nh[33] :
- o Cosin :
.
( , )
.
x y
d x y
x y
= (13)
- Khong cch gc :
1
( , ) os ( . ) d x y c x y

= (14)
- o Euclide :
2
1
( , )
n
i i
i
d x y x y
=
=

(15)
- o Jensen-Shannon divergence :
1
2 2 '
( , ') log ' log
' '
M
m m
JSD m m
m m m m m
H H
d H H H H
H H H H
=
= +
+ +

(16)
Vi H, H l 2 biu biu din cc vector c trng SIFT.
2.6. 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

19

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.
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 [25]. Mingjing Li[26] 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)
Mt s phng php la chn c trng[23]:
STT Phng php M t, nhn xt
1 Phng php da vo
phn phi (Distribution
based approaches)
Khng xt n yu cu v tnh bt i xng trong
h thng 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.
2 Phng php khuych i
thng thng
(conventional Boosting
method)
Khng xt n yu cu v tnh bt i xng trong
h thng CBIR.
Khng c nh gi tt v kh nng tng qut ha
thp do tiu ch la chn c trng da trn li
hun luyn.
3 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 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

20

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.
4 Phng BiasMap (BDA
ht nht)
nh x mu hun luyn n mt khng gian nhiu
chiu hn gii quyt vn gi thuyt mt cm.
5 Phng php khuych i
(Boosting manner)
Tng cc c trng c hc 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 .
Tng kt chng 2
Trong chng 2, kha lun trnh by tm tt phng php trch chn cc c
trng ni dung nh(mu sc, kt cu, hnh dng v c trng cc b SIFT) v mt s
o tng ng tng ng vi cc c trng. Mt s phng php la chn c
trng ti u ha tp c trng. Trong chng 3, chng ti s trnh by mt s cng
trnh nghin cu khoa hc lin quan n tm kim nh theo ni dung nh trch chn
c.

21

Chng 3. Mt s phng php tm kim nh theo ni dung

3.1. Phng php PageRank cho tm kim nh sn phm
Yushi Jing v cng s gii thiu h thng xp hng li cc kt qu tm kim hnh
nh ca Google da trn ni dung ca cc bc nh. H thng xy dng mt th
tng ng vi mi nh l mt nh, cc nh c lin kt vi nhau theo tng
ng gia chng v p dng phng php PageRank xp hng li cc nh. H
thng cho kt qu tt vi 2000 truy vn v nhng sn phm ph bin nht[30].
H thng xy dng mt th t tp d liu nh v sau xp hng cc nh
da trn cc siu lin kt trc quan (visual hyperlinks) gia cc nh. Nhn nh trc
quan ca vic s dng cc siu lin kt trc quan ny l nu mt ngi dng xem mt
nh, th ngi c th cng s quan tm n mt nh khc gn ging vi nh va
xem. c bit, nu nh u c siu lin kt trc quan n nh v, th s c mt xc sut
ngi dng chuyn t u sang v. Bng trc gic, ta c th thy cc nh c lin quan ti
truy vn s c nhiu nh khc tr ti chng v do s c thm thng xuyn. Cc
nh m c thm thng xuyn thng c cho l quan trng. Hn na, nu mt
nh v l quan trng v n c lin kt ti nh w, th n s gp quan trng ca n cho
quan trng ca w v bn thn v l quan trng;
Hng ca mt bc nh c nh ngha li nh sau:
*
IR IR S = (17)
Trong , S
*
l ma trn k ct gim theo ct ca S, vi S
u,v
l tng ng
gia 2 nh u v v. Bng cch lp i lp li php nhn IR vi S
*
ta s thu c vc t
c trng ni bt (dominant eigenvector) ca ma trn S
*
.
ImageRank (IR) hi t ch khi ma trn S
*
khng tun hon hoc ti gin. iu
kin khng tun hon thng ng i vi Web cn iu kin ti gin thng yu cu
mt th lin thng mnh. Do , nh ngha mt h s hm d to mt th lin
thng mnh, tha mn iu kin hi t v lm gim hng ca cc nh, trnh trng
hp mt s trang c th hng qu cao.
Vi mt tp n nh, IR c nh ngha:
( )
*
+ 1 IR dS IR d p = vi
1
1
n
p
n

(
=
(

(18)

22

Mt cch trc quan, iu ny to mt xc sut nh cho vic duyt ngu nhin
n cc nh trong th, mc d n c th khng c lin kt ti nh hin ti. Trong
thc nghim, h s hm d thng c chn gi tr d > 0.8.
Trong h thng ca mnh, Jing v cng s s dng c trng SIFT (2.6) v
biu din c trng nh di dng biu hng c trng. Sau khi biu din nh
thnh cc vector c trng tng ng, tng ng hai nh c tnh mt cch n
gin bng s im hp dn chung chia cho s im hp dn trung bnh ca hai nh.
H thng th nghim vi cc nh tr v t Google cho 2000 cu truy vn ca
nhng sn phm ph bin nht. Kt qu cho thy tp10 kt qu u tin, t l nh
khng ph hp ca h thng ch l 0.47 trong khi ca Google l 2.82 v top 3 ca h
thng l 0.2 so vi 0.81 ca Google. Xt v hiu xut tng th trn cc truy vn, c
762 truy vn ca h thng cha t nh khng hp l hn so vi Google v ch 70 truy
vn cho kt qu km hn Google.

Hnh 12. V d cc nh sn phm tr v t h thng ca Jing

3.2. CueFlik: Mt phng php xp hng li nh da trn lut ca ngi
dng
Tm kim nh trn web l mt nhim v gp nhiu kh khn v t kha thng
khng c t c ht cc c trng trc quan ca nh. Mt s cng c tm kim ph
bin bt u cung cp cc th da trn mt s c im c bn ca nh v d nh

23

nh en, trng, nh c cha khun mt,Tuy nhin, phng php ny cn hn ch
trong vic xc nh r rng th m ngi dng mong mun c s dng trong kt qu
tp nh tm kim t web. gii quyt vn ny, James Fogarty v cng s cng
b phng php CueFlik[14], mt ng dng tm kim nh trn web, cho php ngi
dng to nhanh cc lut ring ca h xp hng li cc nh da trn cc c trng
trc quan ca chng. Sau , ngi dng c th xp hng li bt k kt qu tm kim
nh no da trn cc lut m h a ra. Phng php ny c th nghim, cho
php ngi dng to nhanh cc lut ca cc khi nim nh: product photos,
portraits of people, clipart.
CueFlik k tha vic tm kim nh da vo t kha. Tuy nhin, CueFlik cho
php ngi dng sp xp li cc nh theo cc lut c xy dng t cc c trng trc
quan ca nh. Mi lut c nh ngha nh l lp lng ging gn nht, vic tnh ton
xc nh mc tng ng ca mt nh so vi cc nh mu dng hun luyn cc
lut . Vic hun luyn cc lut nh vy yu cu hc mt hm khong cch t cc
nh mu cung cp bi ngi dng.
CueFlik xp hng cc nh c ly t truy vn n Microsofts Live (1000 bc
nh), Cc lut s tnh im cho cc nh da vo cng thc:
( ) ( )
r r
r ActiveRules
imageScore i weight score i
e
= -

(19)

Vi cc weight c gi tr t -1 n 1
Active Rules l cc lut p dng vi nh
Mi lut c nh ngha l lp lng ging gn nht gm tp cc mu tch cc
(positive examples), cc mu tiu cc (negative examples) v mt o khong
cch. Theo , mt lut tnh im cho mi bc nh da theo cng thc:

min
( ) 1
min min
P
r
p N
dist
score i
dist dist
=
+
(20)
Trong :
score(i) c gi tr t 0 n 1. score(i) c gi tr 1 khi gn vi nh mu tch cc
nht v bng 0 khi gn nh mu tiu cc nht.
min
P
dist l khong cch n nh mu tch cc gn nht, min
N
dist l khong
cch n nh mu tiu cc gn nht.

24

Khong cch gia 2 nh i, j l tng hp cc o khong cch c s dng.
tan ( , ) tan ( , )
m m
m Metrics
Dis ce i j weight dis ce i j
e
= -

(21)
CueFlik c th hc c cc khong cch o thnh phn, s dng cc o
khong cch da vo biu mu sc, bo ha mu, cng chiu sng ca cc
im nh, biu cnh, biu hnh ton cc, biu kt cu. CueFlik tnh ton
chng cho mi nh v s dng o khong cch gia cc nh vi nhau. CueFlik hc
cc lut t cc mu tch cc v tiu cc a ra c cc lut l tng ng vi bc
nh hay khng?. Vic hc cc lut ny c a v vic hc cc trng s da trn
o khong cch tng thch nht vi cc bc nh mu cung cp. Vic hc ny da trn
cc l thuyt cu Globerson v Roweis [34].
3.3. Phng php tm kim nh da trn mu sc, hnh dng, kt cu ca
nh
Mu sc, kt cu, hnh dng l nhng c trng c s dng u tin trong cc
h thng tm kim nh da vo ni dung. P.S. Hirematch v Jagadeesh Pujari [20]
trnh by phng php kt ni c ba c trng mu sc, kt cu v hnh dng t
hiu qu cao trong tm kim hnh nh.Trong phng php ny, nh v phn b tr ca
n c chia thnh cc vung (tiles) cng kch thc v khng chng lp ln nhau.
Nhng c trng c rt ra t nhng biu xy ra ng thi c iu kin gia cc
vung ca nh v vung ca cc thnh phn b tr tng ng c coi nh l nhng
c trng cc b ca mu sc v kt cu. Mt xut tch hp nguyn tc u tin
cao nht cho ci tng ng nht (most similar highest priority principle) v dng
th 2 phn (bipartite graph) s dng cc vung ca truy vn v ca nh ch, c s
dng i snh gia 2 nh. c trng theo hnh dng c trch rt nh vic tnh
ton cnh ca nh da vo Gradient Vector Flow. Vic kt ni c trng mu sc, kt
cu gia nh v thnh phn b tr ca n cng thm cc c trng v hnh dng
a ra c mt tp cc c trng mnh m trong tm kim nh theo ni dung .

25


Hnh 13. Tng quan v m hnh ca h thng tm kim theo mu sc, kt cu v hnh dng
3.3.1. Li
Mi nh c phn thnh 24 vung (4x6 hoc 6x4 nh hnh 12) khng trng
lp nhau. Cc vung ny s c x l nh c trng mu sc v kt cu cc b ca
nh. Nhng c trng rt ra t biu xy ra ng thi c iu kin gia cc vung
ca nh v vung ca cc thnh phn b tr tng ng c s dng cho tng
ng v mu sc v kt cu. Vi mi nh (kch thc 256x384 hoc 384x256) c
phn thnh vng 6x4 hoc 4x6, mi vung s c kch thc l 64x64, sau nh li
c phn r thm mt bc thnh c kch thc M/2 x N/2 vi M v N l s hng v
ct ca nh gc. Vic phn chia ny gip chng ta nm bt c cc thng tin nh
khc nhau trong qu trnh gii quyt.
3.3.2. Tch hp cc i snh nh
Trong phng php ny, mt vung t nh truy vn c cho php i snh
vi bt k vung no ca nh ch. Tuy nhin, mt vung c th ch tham gia ch
mt ln trong qu trnh i snh. Thut ton s dng ma trn k gim thiu qu
trnh tnh ton cho u tin cao nht cho tng ng ln nht. y, ma trn
khong cch c tnh nh mt ma trn k, khong cch ti thiu
ij
d c tnh trong
ma trn ny, khong cch ny c ghi li v hng tng ng vi vung i v ct
tng ng vi vung j c nh du li (thay th bng mt gi tr cao nh: 999).

26

iu ny trnh vic vung i ca nh truy vn v vung j ca nh ch tip tc tham
gia trong vic x l i snh. Khong cch gia vung i v nhng vung khc ca
nh ch v khong cch ca vung j vi nhng vung khc ca nh truy vn c
b qua. Qu trnh ny tip tc cho n khi tt c cc vung c i snh. Khong
cch i snh ti thiu gia cc nh c nh ngha bi cng thc:

ij
1, 1,
qt
i n j n
D d
= =
=

(22)
Trong :
ij
d l khong cch i snh tt nht gia vung i ca nh truy vn v
vung j ca nh ch.
qt
D l khong cch gia nh q v nh t.
3.3.3. Hnh dng:
Thng tin v hnh dng thu c t khun kh cc cnh ca nh cp xm
tng ng. Nhm tc gi s dng Gradient Vector Flow thu thp c trng cnh
ca nh.
Gii thut tnh ton cnh ca nh:
- c nh v chuyn i nh sang nh cp xm
- Lm m nh s dng b lc Gaussian
- Tnh ton cc biu Gradient ca nh b lm m
- Tnh ton Gradient Vector Flow (GVF)
- Lc ra cc phn hi cnh mnh s dng k i l lch tiu chun ca GVF
- Hi t vo cc im nh cnh tha mn iu kin cn bng sinh ra cc nh
cnh.
3.4. Phng php tm kim nh da vo ni dung s dng cc phn vng
nh nh mu truy vn
Mt phng php ph bin tm kim nh da vo ni dung l s dng nh
mu lm truy vn. Awang Iskandar James v cng s trnh by phng php tm kim
nh s dng cc mu truy vn l cc phn vng nh[4]. Nhm tc gi so snh hiu qu
khi s dng cc c trng trch chn t ton b bc nh lm truy vn vi s dng c
trng trch chn t phn vng n v nhiu phn vng. Hiu qu ca bi ton khi s
dng thm c trng hnh dng so vi vic phn lp s dng gii thut hc my cng
c nhc n trong bi.

27

Hai phng php c s dng rng ri vic miu t v biu din hnh dng
l da vo phn vng v ng bin trn. Trong phng php da vo phn vng, cc
c trng c trch xut t ton vng. Phng php da vo ng bin trn biu
din cc hnh dng bng cch ly mu th ri rc chu vi ca n. Biu din hnh dng
da vo ng bin bao gm cc vnh ai, khong cch Haus-dorff, biu din
Fourier,
Trong bi bo, tc gi kt hp c 2 phng php da vo phn vng v da vo
ng bin trn ca trch xut cc c trng hnh dng ca cc vng quan tm: Area,
mean, circularity v boundary. Area l tng s im nh c trong mt vng, mean l
gi tr cp xm trung bnh trong mt vng c tnh bng gi tr sm ca tt c cc
im nh chia cho tng s im nh.
Tp nh d liu c thu thp t cc tp truyn tranh Groat. Vi mi bc nh, s
xc nh v trch xut ra 2 phn vng. Bi bo dng 30 phn vng c trch xut
truy vn nh da vo cc mu phn vng s dng n v a vng v hun luyn d
liu cho gii thut hc my
Kt lun tc gi ch ra rng, vic s dng phn vng n lm mu truy vn hiu
qu hn so vi vic s dng ton b nh lm truy vn v s dng a phn vng li
vt tri hn so vi s dng phn vng n. Vic s dng kt hp truyn tnh trng s
bng nhau n gin hn nhng mang li hiu qu tng ng so vi s dng gii
thut hc my.
Tng kt chng 3
Chng 3 kha lun tm tt mt s cng trnh nghin cu khoa hc lin quan
n vic tm kim v xp hng nh theo ni dung bao gm: phng php pageRank
cho tm kim nh sn phm [30], phng php CueFlik xp hng li nh da trn cc
lut ngi dng [14], phng php tm kim nh da vo ni dung kt hp cc thuc
tnh mu sc, kt cu, hnh dng[4] v phng php tm kim nh vi mu truy vn l
cc phn vng ca nh [20]. Trong chng 4, kha lun s gii thiu phng php la
chn c trng ca nh v m hnh tm kim k lng ging gn nht .

28

Chng 4. M hnh k lng ging gn nht s dng b lng t
ha

4.1. t vn
Bi ton tm kim K lng ging gn nht l mt bi ton n gin v rt ph
bin. Bi ton c th c nh ngha nh sau : Cho mt tp n phn t, xy dng mt
cu trc d liu sao cho khi a vo mt truy vn, h thng tr v K phn t gn nht
vi truy vn. Cc phn t d liu thng c biu din trong khng gian clit nhiu
chiu. Tm kim K lng ging gn nht l bi ton quan trng v c p dng trong
trong nhiu lnh vc nh nn d liu, tm kim thng tin, hc my, thng k v phn
tch d liu, tm kim nh v video,
Trong kha lun ny, bi ton tm kim K lng ging gn nht c hiu l t
nh d liu u vo h thng s tm ra v tr v K nh tng ng nht vi nh u
vo t c s d liu. Trong qu trnh tnh ton tng ng, nh thng c biu
din di dng cc vector c trng nhiu chiu. Vic tnh ton tng ng gia
cc nh c quy v tnh khong cch gia cc vector c trng s dng o clit.
Tuy nhin, vic tnh ton khong cch gia cc vector c trng nhiu chiu ny tn
nhiu thi gian v ti nguyn my. Nhiu phng php nh ch mc a chiu ph
bin nh KD-tree hay nhng hng k thut khc c xut gim thi gian
tm kim. Tuy nhin cc phng php ny vn cha t c kt qu nh mong mun.
Kha lun trnh by phng php la chn cc c trng v tm kim lng ging
gn nht da trn m hnh tm kim s dng lng t ha tch ca Herv Jgou v
cng s [12] kt hp vi o tng ng v khong cch gia cc vector c trng.
4.2. C s l thuyt
4.2.1. Cc k hiu v khi nim
4.2.1.1. Lng t ha vector
V mt hnh thc, mt b lng t ha vector (quantization) l mt hm q nh x
mt vector
D
x R e thnh mt vector { } ( ) ;
i
q x C c i I e = e vi tp ch mc I c gi nh
l hu hn: I={0..k-1}, D l s chiu ca khng gian vector ang xt. Cc gi tr
i
c
gi l trng tm (centroids) v tp cc gi tr C gi l codebook. Chng ta gi thit
rng cc ch s nhn gi tr l cc s nguyn lin tip t 0 n k-1.

29

Tp cc vector
i
V c nh x ti mt ch s i c gi l mt Voronoi
(Voronoi cell), c nh ngha:
{ }
: ( )
D
i i
V x R q x c e = (23)
k "" ca b lng t xc nh mt phn vng ca
D
R . Theo nh ngha, tt c cc
vector nm trong cng mt
i
V c t trong cng mt trng tm
i
c . Cht lng
ca mt b lng t ha c o bng gi tr li bnh phng trung bnh (Mean
Square error MSE) gia vector u vo x v gi tr sau khi c lng t ha ca n
q(x):
2 2
( ) ( , ) ( ) ( ( ), )
X
MSE q E d x x p x d q x x dx ( = =
}
(24)
Vi ( , ) d x y x y = l khong cch clit gia x v y, v p(x) l hm phn phi xc
xut tng ng vi bin ngu nhin chung X.
B lng t ha ti u khi n mn hai thuc tnh cn gi l iu kin Lloyd:
- Th nht: cc vector x phi c lng t ha ti trng tm codebook gn
nht ca n, th hin qua khong cch clit:
( ) arg min ( , )
i
i I
q x d x c
e
= (25)
- Th hai: Gi tr bin i phi l mt vector nm trong Voronoi:
[ | ] ( )
i
i X
v
c E x i p x x = =
}
(26)
B lng t ha Lloyd tng ng vi gii thut phn cm K-Means. Phng php ca
Herv Jgouv cng s s dng s hc b lng t s dng K-Means.
4.2.1.2. B lng t ha tch
Vector u vo x c chia thnh m vector con phn bit nhau
{ }
1 2
, ,...,
j
x x x
1 j m s s vi s chiu
*
/ D D m = , vi D l bi s ca m. Nhng vector con ny c
c lng t ha mt cch ring bit s dng m b lng t ha khc nhau. V vy,
vector u vo x c nh x nh sau:
* *
1
1 1 1
1
( ) ( )
,..., ,..., ,..., ( ( )),..., ( ( ))
m
D m m
D D D
u x u x
x x x x q u x q u x
+


(27)
Vi
j
q l b lng t thp (low-complexity quantizier) tng thch vi vector
con th j. Vi b lng t
j
q tng ng vi tp ch mc
j
I , codebook
j
C v gi tr
bin i tng ng
, j i
c .

30

Gi tr bin i ca b lng t tch c xc nh bi mt phn t ca tp ch
mc tch
1 2
...
m
I I I I = . V vy, codebook c nh ngha nh l tch cc:

1 2
...
m
C C C C = (28)
Trng tm ca tp ny chnh l cc trng tm ca cc b lng t ha con ghp li vi
nhau. Gi s rng, tt c cc b lng t ha con c k
*
hu hn cc gi tr bin i,
nh vy, tng s trng tm s l:

*
( )
m
k k = (29)
Vi m = D, th tt c cc thnh phn ca vector x c lng t ha mt cch ring
bit, vi trng hp m=1, b lng t ha tch tr thnh codebook k-means thng
thng. u im ca b lng t ha tch l tp trng tm ln c sinh ra t tp cc
trng tm nh hn tng ng vi b lng t con. Trong khi hc b lng t con s
dng gii thut Lloyd c s dng mt tp gii hn cc vector nhng codebook vn
thch nghi c vi s phn b d liu biu din.
4.2.2. Tm kim s dng lng t ha
Vic tm kim lng ging gn nht ph thuc duy nht vo khong cch gia
vector truy vn v vector ca c s d liu, hay tng ng vi bnh phng khong
cch. Phn ny trnh by phng php tm kim s dng lng t ha (Searching with
quantization)[12] so snh khong cch gia hai vector da vo ch s lng t ha
ca chng.
4.2.2.1. Tnh ton khong cch s dng m c lng t ha
Herv Jgou v cng s[12] s dng hai phng php tnh khong cch
clit xp x gia hai vector truy vn x v vector c s d liu y : phng php tnh
ton i xng (Symmetric distance computation SDC) v phng php tnh ton bt
i xng. (Asymmetric distance computation ADC)
- Phng php tnh ton i xng : Vector x v y c biu din thnh cc trng
tm ring bit q(x) v q(y). khong cch d(x,y) c tnh xp x bng khong
cch gia q(x) v q(y) :
2
( , ) ( ( ), ( )) ( ( ), ( ))
j j
j
d x y d q x q y d q x q y = =

(30)
Vi khong cch
2
( ( ), ( ))
j j
d q x q y c ly t bng tm kim lin kt vi b lng t
ha con th j

31

- Phng php tnh ton bt i xng : Vector truy vn x c gi nguyn,
vector trong c s d liu c lng t ha thnh q(y), khong cch gia x v
y c tnh xp x bng :
2
( , ) ( , ( )) ( ( ), ( ( )))
j j j
j
d x y d x q y d u x q u y = =

(31)
Vi
2
,
( ( ), )
j j i
d u x c : j=1,,m v i=1,,k
*
c tnh trc tm kim.
4.2.3. Tm kim khng ton b
Trong phn trn trnh by phng php tm kim lng ging gn nht s dng
b lng t ha vi hai phng php tnh ton i xng v tnh ton bt i xng.
Phng php ny s dng m php tnh cng cho mi ln tnh khong cch. Tuy nhin,
vic tm kim vn phi din ra trn ton b tp vector c trng. i vi cc h thng
a truy vn, v s dng tp vector c trng cc b cho biu din nh, th s lng
vector c trng l rt nhiu, vic tm kim tn rt nhiu b nh v thi gian. Herv
Jgou v cng s gii thiu phng php tnh ton khong cch bt i xng da trn
ch mc ngc (inverted file asymmetric distance computation (IVFADC)) trnh
vic tm kim trn ton b tp vector c trng.
4.2.3.1. Lng t ha th, danh sch ch mc ngc
B lng t ha th l mt mng cc danh sch :
1 '
....
k
L L . Nu Y l tp vector
cn nh ch mc, danh sch
i
L s tng ng vi trng tm
i
c ca
c
q lu tr tp:
{ } : ( )
c i
y Y q y c e = . Vi mt danh sch ch mc ngc, truy vn c gn vo w v tr
ch mc ph hp vi w lng ging gn nht ca x trong codebook
c
q . Tt c cc danh
sch ch mc ngc ph hp c xem xt.
4.2.3.2. Xc nh cc b m lng t tch
Gi r(x) l vector d (residual vector) c lng t ha t trng tm ( )
c
q x tng ng
vi vector x, r(x) c nh ngha :
( ) ( )
c
r x x q x = (32)
Gi
p
q l b lng t ha tch m ha vector d r(x), vector x c biu din bi
tuple ( ( ), ( ( )))
c p
q x q r x , vi ( ( ))
p
q r x c lu trong danh sch ch mc ngc tng ng
vi x. Khong cch gia vector truy vn x v vector trong c s d liu y c tnh
xp x:

2
2
( , ) ( ( ( )), ( ( ( ))))
i
j c p j c
j
d x y d u x q x q u y q y =

(33)

32

Vi
i
p
q l b lng t ha con th i. Cng ging nh phng php ADC, vi mi b
lng t ha con
i
p
q , khong cch gia vector d ( ( )
j c
u x q x v tt c cc trng tm
, j i
c ca
i
p
q c tnh ton s b v lu tr li.
4.2.3.3. Cu trc ch mc v thut ton tm kim
- nh ch mc vector y :
1. Lng t ha y thnh ( )
c
q y
2. Tnh ton vector d ( ) ( )
c
r y y q y =
3. Lng t ha vector d r(y) thnh ( ( ))
p
q r y thc hin lng t ha
tch bng cch gn ( )
j
u y thnh ( ( ))
j j
q u y vi j = 1, ,m
4. Lu tr cc vector c trng v m biu din ch mc lng t ha tch
trong mt mc ca danh sch ch mc ngc.
- Tm kim cc lng ging gn nht ca truy vn x :
1. Lng t ha x thnh w lng ging gn nht trong codebook q
c

2. Tnh ton bnh phng khong cch
2
,
( ( ( )), )
j j i
d u r x c cho mi lng t
ha con j v mi trng tm
, j i
c ca n.
3. Tnh bnh phng khong cch gia r(x) v tt c cc vector ch mc
trong danh sch ch mc ngc.
4. La chn k ln cn gn nht ca x da vo nh gi khong cch s
dng gii thut Maxheap












33

M hnh h thng IVFADC :

Hnh 14. M hnh h thng IVFADC
H thng bn tri: chn mt vector vo danh sch ch mc ngc; h thng bn phi: tm kim k lng
ging gn nht.

4.3. M hnh bi ton
Trong phn (4.2), kha lun trnh by h thng tm kim k lng ging gn nht s
dng tnh khong cch bt i xng trong danh sch ch mc ngc (IVFADC) ca
Herv Jgou v cng s [12]. M hnh bi ton c xy dng da trn cch tnh ton
khong cch bt i xng ca h thng ny kt hp vi o tng ng v khong
cch gia cc vector c trng.
4.3.1. Trch chn c trng nh
c trng cc b bt bin SIFT bt bin vi vic thay i t l nh, quay nh,
i khi l thay i im nhn v thm nhiu nh hay thay i cng chiu sng ca
nh. Cc c trng SIFT ny thng c s dng trong nhn dng v tm kim i
tng[17] Yushi Jing cng dng c trng SIFT ca nh trong nghin cu v tm
kim nh sn phm s dng phng php PageRank[30].
Kha lun s dng c trng SIFT trong bi ton tm kim K lng ging gn
nht v ng dng trong tm kim nh sn phm. Mi nh c c c trng bi cc
vector c trng SIFT 128 chiu.
Qu trnh v phng php trch chn cc c trng SIFT ny c kha lun
trnh by chi tit trong phn 2.6

34

4.3.2. Tm kim K lng ging gn nht
Sau khi trch chn c trng nh, kha lun a ra m hnh tm kim k lng
ging gn nht da trn c trng va trch chn c. M hnh ny da trn phng
php tm kim k lng ging gn nht s dng b lng t ha ca Herv Jgou s
dng phng php ADC v kt hp thm o v khong cch clit gia cc vector
c trng.

M hnh gii quyt bi ton :

Hnh 15. M hnh gii quyt bi ton


M hnh bi ton gm 2 giai on chnh
Giai on 1-Tm N nh tng ng vi nh truy vn : Giai on ny tin hnh vic
trch chn cc vector c trng ca nh truy vn v nh trong c s d liu (vector c
trng SIFT), sau tm top N nh tng ng vi nh truy vn t tp nh trong c s

35

d liu theo phng php tm kim s dng b lng t ha vi phng php tnh
ton khong cch bt i xng c trnh by trong phn 4.2. Cc vector trong c s
d liu c lng t ha trong khi tp vector truy vn c gi nguyn. Khong cch
gia cc vector truy vn v vector trong c s d liu c tnh theo cng thc (30).
Tp N nh tng ng nht c tr v theo o khong cch gia cc vector truy
vn v cc vector c s d liu. Tp N nh ny l u vo cho giai on 2.
Giai on 2 Tm K lng ging gn nht vi nh truy vn: Sau khi tin hnh trch
chn cc c trng t tp N nh tng ng tr v t giai on 1, s tnh ton tng
ng gia nh truy vn v tng nh tr v da trn o clit gia cc vector c
trng ca nh. Khong cch clit gia 2 vector c trng x v y c tnh :
2
1
( , )
n
i i
i
d x y x y
=
=

(34)
Tp K lng ging gn nht vi nh truy vn c tr v da trn o tng ng
ny. nh gn nht l nh c khong cch gia cc vector c trng vi nh truy
vn ngn nht.
Tng kt chng 4
Chng 4 kha lun trnh by phng php tm kim k lng ging gn nht s
dng lng t ha ca Herv Jgou v cng s [12], ng thi a ra m hnh bi ton
tm kim k lng ging gn nht da theo m hnh trn s dng phng php tnh
khong cch bt i xng (ADC) kt hp vi o tng ng v khong cch gia
cc vector c trng. Trong chng 5, kha lun trnh by m hnh th nghim bi
ton, cc kt qu t c v nhng nhn xt, nh gi v kt qu thc nghim.

36

Chng 5. Thc nghim v nh gi

Da vo c s l thuyt v m hnh xut trong chng 4, kha lun tin hnh
thc nghim vic trch chn cc vector c trng SIFT t nh truy vn v nh trong c
s d liu, p dng m hnh k lng ging gn nht vi tp c trng va trch chn
c tm ra tp k nh gn nht vi nh truy vn.
- u vo ca h thng : Mt nh truy vn do ngi dng nhp vo
- u ra ca h thng : Tp k nh gn nht vi nh truy vn
5.1. Mi trng v cc cng c s dng cho thc nghim
- Cu hnh phn cng

Bng 1. Cu hnh phn cng s dng trong thc nghim

Thnh phn Ch s
CPU 1 Pentium IV 3.06 GHz
RAM 1 GB
OS WindowsXP Service Pack 2
B nh ngoi 80GB

- Cng c phn mm s dng

Bng 2. Cng c phn mm s dng trong thc nghim

STT Tn phn mm Tc gi Ngun
1 Matlab R2009b http://www.mathworks.com/products/




37

- Mt s th vin s dng

Bng 3. Mt s th vin s dng trong thc nghim

STT Tn phn mm Tc gi Ngun
1 SiftDemoV4 David Lowe http://people.cs.ubc.ca/~lowe/keypoints/
2 Pqsearch_matlab Herv Jgou,
Matthij Douze
http://lear.inrialpes.fr/~jegou/ann.php
3 Kmeans_fast.tar Herv Jgou,
Matthij Douze
http://lear.inrialpes.fr/~jegou/ann.php#m
atlla
4 FlickrSearcher Nguyn Cm T http://www.dais.is.tohoku.ac.jp/%7Enca
mtu/software.htm

Ngoi cc cng c trn, chng ti cn tin hnh xy dng cc module x l da
trn ngn ng Matlab bao gm cc file sau:
- Similar_Euclide: tnh ton khong cch clit gia tp vector c trng
- Pq_test: Kt hp cc module con, tm kim v tr v k lng ging gn nht
vi truy vn t tp d liu.
5.2. Xy dng tp d liu nh
Trong kha lun ny, chng ti thc nghim vi tp d liu nh lin quan n
sn phm, s dng kt qu t Flickr v Google product Search.
- nh truy vn: Do ngi dng nhp vo. Trong kha lun ny, chng ti ch
trng n mt s truy vn c s nhp nhng gia gia ni dung nh v vn bn
i km nh.
- Tp nh c s d liu: Vi mi truy vn, tp d diu nh gm 30 nh c trn
t tp cc nh ly t Google Product Search v Flickr. Chng ti tin hnh thu
thp cc nh bng truy vn text tng ng vi nh truy vn t Google Product
Search. Sau b xung nhiu bng cc nh thu thp c t Flickr theo truy
vn text tng ng vi nh truy vn.

38

- Tp nh hun luyn: Trong qu trnh lng t ha vector, cn mt tp d liu
nh hun luyn xc nh cc tham s trong b lng t ha con (4.2). Tp
nh hun luyn gm 20 nh khc nhau c ly t kt qu tr v ca Google
Product Search.
- Tp nh tr v: Gm k nh gn ging nht vi nh truy vn. Cc nh c sp
xp gim dn theo mc gn vi truy vn. Chng ti th nghim vi gi tr
k=10.
5.3. Quy trnh, phng php thc nghim
Quy trnh thc nghim c tin hnh nh sau:
Thc hin truy vn: Ngi dng nhp vo truy vn di dng tn v ng dn y
n nh truy vn.
Trch chn c trng v tm kim k nh tng ng nht: Qu trnh ny tri qua hai
giai on chnh:
Giai on 1: Giai on ny tin hnh trch chn cc c trng ca nh truy vn
v nh trong c s d liu s dng b cng c SiftDemoV4[39] v tr v N nh tng
ng nht s dng lng t ha vi phng php ADC. Tp cc c trng SIFT sau
khi c trch chn c lu di dng ma trn nx128 vi n l s vector c trng.
Sau , cc c trng ny c lng t ha s dng b cng c pqsearch_matlab[40]
v tnh khong cch gia cc vector s dng phng php ADC. N nh tng ng
nht c tr v da trn o khong cch ny. Trong , nh gn nht l nh c
khong cch nh nht n nh truy vn. N nh ny c ly lm u vo cho giai on
2.
Giai on 2: Giai on ny nhn u vo l N (N=20) nh tng ng tr v t
giai on 1. S dng cc vector c trng ca cc nh ny c trch xut trong giai
on 1 tnh ton khong cch gia cch clit gia cc vector c trng ny vi
vector c trng ca nh truy vn. K nh gn nht vi nh truy vn c tr v theo
khong cch c tnh, trong nh gn nht l nh c khong cch ngn nht n
truy vn.
5.4. Kt qu thc nghim
Chng ti s dng chnh xc trung bnh (Average Precision) [1] nh gi
kt qu xp hng ca h thng.
Gi s ta c 5 i tng l: a, b, c, d, e
Trong a, b, c l cc i tng ph hp v d, e l cc i tng khng ph hp.

39

Mt xp hng ca cc i tng cn nh gi l: c, a, d, b, e
chnh xc trung bnh c nh ngha nh sau:
1
1
@ ( )
( )
n
k
n
j
P K I K
AP
I J
=
=

(35)

Trong :
n l s i tng c xt.

@
@
Match K
P K
K
= (Match@K = s cc i tng ph hp K v tr u tin)
I(K) = 1 nu i tng v tr K, ngc li I(K) = 0
V d: P@1 = 1/1, P@2 = 2/2, P@3 = 2/3, P@4 = 3/4. Th chnh xc trung bnh l:
1 2 3
1 1 1
1 2 4
0.92
3
AP
+ +
= = (36)
Ngoi ra chng ti cn s dng Mean Average Precision (MAP) nh gi h
thng.
Gi tr trung bnh trn m xp hng:
1
m
i
i
AP
MAP
m
=
=

(37)
Chng ti th nghim h thng vi 10 truy vn trn b d liu th nghim v
nh gi kt qu tr v i vi 10 kt qu tr v u tin.
Kt qu v chnh xc trung bnh cho 10 nh tr v u tin ca 10 truy vn:











40

Bng 4. Kt qu chnh xc trung bnh ca 10 truy vn

STT Truy vn AP
1 Appl e 0.875
2 Coca col a 0.747
3 D80 0.804
4 CD- Rom 0.737
5 Iphone 0.885
6 M ouse 0.869
7 Noki a N97 0.883
8 Cooker 0.748
9 Ri ng 0.746
10 Pr i nt er 0.753


Bng 5. chnh xc mc k ca mt s truy vn



T cc kt qu thng k trn, chng ti tnh ton c chnh trung bnh i
vi 10 truy vn ca h thng l: MAP=0.804. C th thy rng, chnh xc trung
bnh i vi 10 truy vn ca h thng l kh cao, v d Iphone l 0.885, Nokia N97 l
0.883. c bit, theo kho st ca thc nghim, h thng cho kt qu rt chnh xc vi
kt qu u tin tr v. chnh xc mc 1 ca cc truy vn thng l 1. i vi tp
d liu c cha nh ging ht so vi nh truy vn, th kh nng nh th nht c tr

41

v ging ht vi nh truy vn l rt cao. Trong 10 truy vn thc nghim th 8 truy vn
tr v nh u tin ging ht so vi nh truy vn. V d tp 10 kt qu u tin vi truy
vn Iphone:

Hnh 16. 10 kt qu tr v u tin ca h thng vi truy vn Iphone
Tng kt chng 5
Chng 5, Kha lun trnh by v m hnh thc nghim ca h thng. Cc cng
c, phn mm, m ngun h thng s dng. Kha lun cng trnh by qu trnh tin
hnh thc nghim, cc kt qu t c ca h thng vi 10 truy vn v mt s nhn
xt v chnh xc ca h thng t c. T nhng kt qu ban u t c cho
thy tnh kh thi v ng n ca h thng.







42

Kt lun
Lng nh s trn web tng ln mt cch nhanh chng i hi phi c cc h
thng tm kim nh hiu qu v tin li. Tuy cc cng c tm kim nh theo vn bn i
km nh cho php ngi dng tm kim nh vi thi gian p ng nhanh nhng cha
gii quyt c vn nhp nhng gia vn bn i km v ni dung hin th ca nh
tr v. Kha lun tp trung nghin cu mt s phng php trch chn c trng nh
v xy dng h thng tm kim k lng ging gn nht vi nh truy vn da theo ni
dung nh.
Kha lun t c nhng kt qu sau :
Kha lun tm hiu cc c trng ca nh bao gm c trng vn bn i km
nh v c trng ni dung nh. ng thi, tm hiu cc phng php trch chn c
trng ni dung nh cng nh mt s o tng ng tng ng vi cc c trng.
Kha lun cng i tm hiu mt s phng php tm kim v xp hng nh theo
ni dung nh. Da theo m hnh tm kim k lng ging s dng b lng t ha ca
Herv Jgou v cng s [12], kha lun a ra m hnh tm kim k lng ging gn
nht s dng b lng t ha v phng php tnh khong cch bt i xng kt hp
vi o tng ng gia cc vector c trng.
Kha lun tin hnh th nghim m hnh vi 10 truy vn. Kt qu c chnh xc
trung bnh l 80.4% cho 10 kt qu tr v u tin ca h thng i vi 10 truy vn.
T nhng kt qu bc u cho thy tnh kh quan v ng n ca m hnh.
Mt s vn hn ch v hng nghin cu tip theo :
Do hn ch v mt thi gian v kin thc sn c, kha lun mi ch dng li
mc th nghim ca m hnh trn c trng SIFT ca nh vi tp d liu nh v t
truy vn.
Trong thi gian ti, chng ti s tin hnh th nghim m hnh vi cc c trng
ni dung khc ca nh. ng thi, m rng tp d liu v truy vn trn nhiu min
khc nhau xy dng m hnh tm kim lng ging gn nht theo ni dung nh hon
thin.

43

Ti liu tham kho
Ti liu ting Vit :
[1]. Nguyn Thu Trang (2009). Hc xp hng trong tnh hng i tng v phn
cm ti liu, Lun vn Thc s, Trng i Hc Cng Ngh.

Ti liu ting Anh :
[2]. Alex Holub, Pierre Moreels, Pietro Perona (2008). Unsupervised clustering for
google searches of celebrity images, IEEE International Conference on Automatic
Face and Gesture Recognition , 2008
[3]. Alexandre Noma, Ana Beatriz V. Graciano, Lus Augusto Consularo, Roberto
M. Cesar, Isabelle Bloch (2008). A New Algorithm for Interactive Structural
Image Segmentation, CoRR abs/0805.1854
[4]. D. N. F. Awang Iskandar James A. Thom S. M. M. Tahaghoghi (2008).
Content-based Image Retrieval Using Image Regions as Query Examples. CRPIT
Volume 75- Database technologies.
[5]. Deselaers T, Keysers D, Ney H (2005). Discriminative Training for Object
Recognition using Image Patches. IEEE Conference on Computer Vision and
Pattern Recognition (CVPR 05). 2:157-162 San Diego, CA; 2005.
[6]. Florian Schroff, Antonio Criminisi, Andrew Zisserman (2007). Harvesting
Image Databases from the Web, ICCV 2007: 1-8
[7]. G. Shakhnarovich, T. Darrell, and P. Indyk(2006). Nearest-Neighbor Methods
in Learning and Vision: Theory and Practice, MIT Press, March 2006 ISBN 0-
262-19547-X
[8]. Hao Zhang Alexander C. Berg Michael Maire Jitendra Malik (2007). SVM-
KNN: Discriminative Nearest Neighbor Classification for Visual Category
Recognition. Computer Science Division, EECS Department Univ. of California,
Berkeley, CA 94720
[9]. Herve Jgou, Matthijs Douze, and Cordelia Schmid (2008). Hamming
embedding and weak geometric consistency for large scale image search. The 10th
European Conference on Computer Vision: Part I.
[10]. Herv Jgou, Matthijs Douze, Cordelia Schmid(2009). Product quantization for
nearest neighbor search, IEEE Transactions on Pattern Analysis & Machine
Intelligence 2010

44

[11]. Herv Jgou, Matthijs Douze, Cordelia Schmid(2008). Recent Advances in
Large Scale Image Search, ETVC 2008: 305-326. (2008)
[12]. Herv Jgou, Matthijs Douze, Cordelia Schmid(2009). Searching with
quantization: approximate nearest neighbor search using short codes and distance
estimators. Technical Report RR-7020, INRIA
[13]. J. Friedman, J. L. Bentley, and R. A. Finkel(). An algorithm for nding best
matches in logarithmic expected time. ACM Transaction on Mathematical
Software, vol. 3, no. 3, pp. 209226, 1977
[14]. James Fogarty, Desney S. Tan, Ashish Kapoor, Simon A. J. Winder(2008).
CueFlik: interactive concept learning in image search. The twenty-sixth annual
SIGCHI conference on Human factors in computing system
[15]. Jun Zhao, Guo-Yin Wang, Hong Tang, Hua Li the study on technologies for
feature selection. Tthe 1st Int. Nat. Conf. On Machine Learning and Cybernetics
(ICMLC02), 2002, Beijing, 689-693.
[16]. Kamarul Hawari Ghazali(2007). Feature Extraction technique using SIFT
keypoints descriptors. The International Conference on Electrical and Engineering
and Informatics Institut technology Bandung, Indonesia, june 17-19, 2007
[17]. Lowe David(2004). Distinctive image features from scale-invariant keypoints.
International Journal of Computer Vision 2004;60(2):91110.
[18]. Michele Saad (2008). Low-Level Color and Texture Feature Extraction for
Content-Based Image Retrieval . EE 381K: Multi-Dimensional. Digital Signal
Processing
[19]. Mitsuru Ambai Denso(2009). Multiclass VisualRank: Image Ranking Method
in Clustered Subsets Based on Visual Features. SIGIR09, July 1923, 2009,
Boston, Massachusetts, USA.
[20]. P.S. Hirematch, Jagadeesh Puijari (2007). Content base image retrieval base on
color, texture and shape feature using Image and its complement. IJCSS,
International journal of computer science and security, vol 1, issue 4, Dec 2007,pp.
25-35.
[21]. Ritendra Datta, Dhiraj Joshi, Jia Li, and James Z. Wang (2008): Image
Retrieval: Ideas, Influences, and Trends of the New Age. ACM Computing Surveys,
40 (2).
[22]. Shuhui Wang, Qingming Huang, Shuqiang Jiang(2009). Visual ContextRank
for Web Image Re-ranking. The First ACM workshop on Large-scale multimedia
retrieval and mining

45

[23]. Tee Cheng Siew(2008). Feature selection for content-based image retrieval
using statistical discriminant analysis. PhD thesis Faculty of Computer Science and
Information System Universiti Teknologi Malaysia. 2008
[24]. Thomas Deselaers1, Daniel Keysers2, and Hermann Ney1: Features for Image
Retrieval: An Experimental Comparison. Information Retrieval vol 11, issue 2,
Kluwer Academic Publishers Hingham, MA, USA
[25]. W. Jiang, G. Er, Q. Dai and J. Gu. (2006). Similarity-Based Online Feature
Selection In Content-Based Image Retrieval. IEEE Trans. Image Processing, 15
(3), pp.702-712.
[26]. W. Jiang. M. Li, H. Zhang, J. Gu. (2004. Online feature Selection based on
Generalized Feature Contrast Model. IEEE International Conference on
Multimedia and Expo(ICME). pp. 1995-1998
[27]. Yossi Rubner, an Puzicha,Carlo Tomasi and Joachim M. Buhmann Empirical:
Evaluation of Dissimilarity Measures for Color and Texture. Computer Vision and
Image Understanding, vol 84, issue 1. Elsivier Science Ins.
[28]. Yushi Jing, Shumeet Baluja, Henry A. Rowley(2007). Canonical image
selection from the web, CIVR 2007: 280-287
[29]. Yushi Jing(2008). VisualRank: Applying PageRank to Large-Scale Image
Search. IEEE Trans Pattern Anal Mach Intell.
[30]. Yushi Jing(2008). PageRank for images products search. Reafered Track: Rich
media, April 21-25, 2008. Beijing, China.
[31]. V. Shiv Naga Prasad. A.G. Faheema, Subrata Rakshi(2002). Feature Selection
in Example-Based Image Retrieval Systems. Indian Conference on Vision
Graphics and Image Processing
[32]. C. V. Jawahar, P. J. Narayanan, and S. Rakshit(2000). A exible scheme for
representation, matching, and retrieval of images. ICVGIP 2000, pages 271277.
Allied Publishers Ltd., 2000.
[33]. Mohamed Aly(2006). Face Recognition using SIFT Features. AlyCNS186 Term
Project Winter
[34]. Globerson, A. and Roweis, S. (2005). Metric Learning by Collapsing Classes.
Conference on Neural Information Processing Systems (NIPS 2005), 451-458.




46

Website tham kho :
[35]. Website: http://www.searchenginejournal.com/7-similarity-based-image-search-
engines/8265/
[36]. Website: http:/www.thongtincongnghe.com/article/9703
[37]. Website: http://www.hori.ecei.tohoku.ac.jp
[38]. Website: http://www.flickr.com/search/
[39]. Website: http://people.cs.ubc.ca/~lowe/keypoints/
[40]. Website:http://lear.inrialpes.fr/~jegou/ann.php
[41]. Website: http://www.freeseamlesstextures.com/texture_gallery/index.htm