Osv 3 PDF

Online-Signature Verification
Gio vin hng dn:

TS. L Hong Thi
Mn hc:
CC H C S TRI THC
Thc hin:
V Ngc Thch 10 12 039
Nguyn c Tm 10 12 037
Nguyn Lan Hng 10 12 012
Hong Th Phng Thanh 10 12 041
11/2010
(OSV)
10 20, 2010
MC LC
1
Tng quan v Online-Signature Verification (OSV)

1.1 Gii thiu
1.2 Th trng OSV
1.2.1
ng dng ca OSV ................................................................................. 6
1.2.2
Cc h thng thng mi ........................................................................ 7
1.3 H thng chng thc ch k online
1.3.1
Thu nhn d liu v tin x l (Data Acquisition and Preprocessing)...... 7
1.3.2
Trch chn c trng (Feature extraction) ............................................... 8
1.3.3
ng k ch k mu (Enrollment) .......................................................... 9
1.3.4
So khp (Matching) .............................................................................. 10
1.3.5
Tnh ton tng t (Similarity degree calculating) ........................... 10
Thut ton so khp DTW (Dynamic Time Warping)
11
2.1 Gii thiu
11
2.2 Gii thut
12
2.2.1
Pht biu bi ton.................................................................................. 12
2.2.2
Thut ton DTW ................................................................................... 13
2.3 Cc rng buc
15
2.3.1
iu kin lin tc (Continuity Condition) ............................................. 15
2.3.2
iu kin gii hn bin (Boundary Condition) ...................................... 16
2.3.3
iu kin tnh n iu (Monotonicity condition) ................................. 16
Hi qui tuyn tnh n gin (Simple Linear Regression)
17
3.1 Gii thiu
17
3.2 Phng trnh ng hi qui
19
3.3 H s tng quan R2
19
3.4 M rng R2 (ER2)
20
Kt hp DTW v ER2
20
ng dng Demo
20
5.1 c t
20
5.1.1
M hnh i tng ................................................................................ 21
5.1.2
M hnh x l ....................................................................................... 21
Nhm 5: V Ngc Thch | Nguyn c Tm | Nguyn Lan Hng | Hong Th Phng Thanh
(OSV)
10 20, 2010
5.1.3
S Use-Case..................................................................................... 22
5.1.4
M hnh cc component ........................................................................ 24
5.1.5
Lc Sequence ................................................................................. 24
5.2 Ci t
26
5.2.1
Thut ton DTW ................................................................................... 26
5.2.2
Thut ton Enroll .................................................................................. 27
5.3 Hng dn s dng
28
5.3.1
Mn hnh chnh ca chng trnh .......................................................... 28
5.3.2
Chc nng ng k ch k mu (Registration) ...................................... 28
5.3.3
Chc nng xc nhn ch k (Verification) ............................................ 30
5.3.4
Chc nng ci t ngng xc nhn (Threshold)................................... 31
5.3.5
Chc nng g b ch k mu (Remove) ............................................... 31
(OSV)
10 20, 2010
DANH SCH HNH

Hnh 1: ng dng SignDoc ca SOFTPRO ................................................................ 6
Hnh 2: M hnh h thng chng thc ch k online .................................................. 7
Hnh 3: Cc thit b ch k in t ............................................................................. 8
Hnh 4: Trch chn c trng t ch k mu ............................................................... 9
Hnh 5: S mapping ............................................................................................. 10
Hnh 6 - M hnh DTW mapping .............................................................................. 11
Hnh 7 - ng warp c khong cch nh nht trn ma trn chi ph ......................... 14
Hnh 8 - iu kin lin tc........................................................................................ 16
Hnh 9 - iu kin gii hn bin ............................................................................... 16
Hnh 10 - iu kin tnh n iu. Cc gch cho b cm bi iu kin ny .......... 16
Hnh 11: ng hi qui tuyn tnhPhng trnh ng hi qui ................................ 18
Phng trnh ng hi qui ...................................................................................... 19
Hnh 12: M hnh i tng ..................................................................................... 21
Hnh 13: M hnh x l ............................................................................................ 22
Hnh 14: S Use-Case .......................................................................................... 23
Hnh 15: M hnh cc component ............................................................................. 24
Hnh 16: Lc sequence Chc nng xc nh ch k ........................................ 24
Hnh 17: Lc sequence Chc nng to ch k mu ......................................... 25
Hnh 18: Lc sequence Xc nh ch k ......................................................... 26
Hnh 19: Mn hnh chnh .......................................................................................... 28
Hnh 21: Mn hnh xc nhn ch k ......................................................................... 30
Hnh 22: Mn hnh ci t ........................................................................................ 31
Hnh 23: Mn hnh g b ch k mu ....................................................................... 32
(OSV)
10 20, 2010
1 Tng quan v Online-Signature Verification (OSV)

1.1 Gii thiu
Ngy nay chng thc ch k t ng l mt lnh vc nghin cu quan trng,
bi vic s dng ch k tay c x hi cng nh lut php cng nhn l mt
phng php chng thc c nhn v ngy cng c s dng rng ri. Mt u im
khc ca ch k tay (c xem nh l mt phng thc nhn trc hc) l chng ta
c th thu nhn n bng cch s dng bt mc k ln cc t giy hoc l bng cc
phng tin in t vi mt s thit b cm ng hin c trn th trng nh l bng
bt, PDA, Tablet PC, mn hnh cm ng, vv
Mc d phng thc ch k tay c rt nhiu u im nhng vic trin khai
thc t ca cng ngh ny cn chm v nhn trc hc ch k vn cn l mt vn
nghin cu y thch thc v cn mt s hn ch sau:
- Khi xem xt ch k gi mo, c rt nhiu bin th bn trong ln bin th bn
ngoi.
- Nhn trc hc ch k cn cha ph bin, khng phi tt c mi ngi u c
th thc hin c cng vic k tn
- Ch k tay c xu hng bin i theo thi gian v rt d b tn cng trc tip
bi cc k gi mo ch k.
Tng t mt s phng thc nhn trc hc khc (nh nhn trc hc ging
ni), k mo danh c th bit mt s thng tin v khch hng nhm lm gim hiu
sut chng thc ch k, chng hn nh hnh dng ca ch k. Kt qu l, c 2 loi
mo danh ph bin trong chng thc ch k, l: Mo danh thng thng v mo
danh thc s. Mo danh thng thng cung cp nhng ch k mo danh ngu nhin,
khi nhng k mo danh khng bit thng tin g v ch k xc thc. Mo danh thc s
cung cp nhng ch k mo danh chuyn nghip, khi nhng kh mo danh bit c
mt s thng tin lin quan ti ch k ca khch hng.
Da vo thng tin ch k u vo m chng thc ch k c phn thnh 2
loi: On-line v Off-line. Phng thc chng thc ch k trc tuyn lin quan n
vic s dng mt s hm thi gian ca tin trnh k kt ng. Off-line thng lin
quan n hnh dng ch k tnh.
(OSV)
10 20, 2010
1.2 Th trng OSV

1.2.1 ng dng ca OSV
Cc ng dng quan trng nht ca nhn trc hc ch k trc tuyn l trong
cc lnh vc nh php lut (xc minh ti liu), y hc (bo mt h s bnh n), v giao
dch ngn hng (kim tra sc v th tn dng). Cc ng dng chnh bao gm:
-
Kim tra php l ch k:
Chng thc ch k: S dng ch k ng nhp h thng, m ha ti liu,

truy cp web vv
Gim st ch k: So snh t ng cc ch k trc tuyn theo di v pht

hin ngi k (v d: danh sch en cc c nhn), hay dng cnh bo nhng
hot ng ca con ngi ti cc im bn hng cng nh ti cc dch v s
dng th tn dng khc.
H thng bo mt nhn trc hc: S dng cc hm thi gian ca ch k trc

tuyn to kha cho h thng bo mt.
Hnh 1: ng dng SignDoc ca SOFTPRO
(OSV)
10 20, 2010
1.2.2 Cc h thng thng mi

Bn bo co v th trng nhn trc hc nm 2006-2010 ca IBG ch ra rng:
trong tt c cc phng thc nhn trc hc da theo hnh vi th chng thc ch k
ng vai tr quan trng th 2 i vi cc h thng thng mi, ch sau nhn trc hc
ging ni. N chim th phn xp x 1,7%. Mc d nhn trc hc ch k hin nay pht
trin ngy cng tng cng vi s pht trin vi cc thit b di ng mn hnh cm ng,
nhng n vn cn chim mt th phn kh nh trong th phn nhn trc hc. Trong khi
, cc phng thc nhn trc hc khc nh nhn dng vn tay (chim 43,6% th
phn) v nhn dng khun mt (19%).
Hin nay mt s cng ty ang phn phi nhiu sn phm chng thc ch k
c xy dng trn nhiu nn tng khc nhau, nh:
-
Hng CIC (Communication Intelligence Corportation) c mt s cc sn phm

chng thc ch k, bao gm SignatureOne v Sign-it. Nhng phn mm ny
cho php ngi dng ng nhp vo h thng da vo thng tin ch k ng.
SOFTPRO phn phi mt s phn mm chng thc c ch k tnh v ch k
trc tuyn.
Cyber-SIGN bn mt s ng dng chng thc ch k trc tuyn.
1.3 H thng chng thc ch k online
Hnh 2: M hnh h thng chng thc ch k online

1.3.1 Thu nhn d liu v tin x l (Data Acquisition and
Preprocessing)
Vic thu nhn trc tuyn cc hm thi gian ca ch k tay c th c thc
hin bng cc thit b s ha hay mn hnh cm ng, hoc nhng thit b c tch
hp trong Tablet PCs v PDAs. Nhng thit b thu nhn ny cung cp thng tin v ta
(nh v tr honh x, tung y ca bt), v p lc ca bt, gc k, vvNgoi ra,
cn c cc thit b thu nhn ch k trc tuyn khc na. Chng l nhng loi bt
chuyn dng c gn km vi mt thit b phn cng no cung cp mt s d
liu ch k trc tuyn nh ta hay tc .
(OSV)
10 20, 2010
Cc thit b thu nhn ch k trc tuyn thng hot ng t 100 n 200

mu/s.
Hnh 3: Cc thit b ch k in t
Sau khi c thu nhn t cc thit b in t th ch k s c tin x l trc
khi n c chuyn n tin trnh trch chn c trng. Mt s bc tin x l quan
trng l lc nhiu v ti to mu. Vic ti to mu ny thng c thc hin trong
mt s h thng t c mt i din hnh dng bao gm cc im nh cch u.
Mt s h thng khc trnh bc ti to mu, bi v n c th lm mt mt s c
im v tc ri rc.
1.3.2 Trch chn c trng (Feature extraction)
trch chn ra nhng c trng c bn ca ch k online, ngi ta s dng 2
phng thc c bn, l: feature-based (da trn tnh nng) v function-based (da
trn chc nng).
-
Phng thc feature-based l phng thc m t qu o ca ch k c th

xy dng c mt vc t i din bao gm nhng c trng chung ca n.
Phng thc function-based l phng thc m trong chui thi gian m t

cc c trng cc b ca ch k c s dng nhn dng, v d: qu o v
tr, tc , gia tc, lc, hay p sut.
(OSV)
10 20, 2010
Hnh 4: Trch chn c trng t ch k mu

Mc d nhng cng trnh nghin cu gn y ch ra rng cch tip cn da trn
chc nng c th cnh tranh vi phng thc da vo tnh nng, nhng phng thc
th 2 vn cho chng ta kt qu cao hn.
Tp hp c trng ca ch k c th l kt qu ca tin trnh trch chn c
trng trong giai on pht trin hoc c th l kt qu ca vic ng k ban u ca
ngi dng. Cch tip cn funtion-based ph hp hn trong vic chng thc ch k l
do ni dung thng tin khc nhau v phc tp gia nhng ngi k.
1.3.3 ng k ch k mu (Enrollment)
Ty theo tin trnh i snh m vic ng k c th c chia thnh 2 loi:
reference-based hoc model-based.
Trong phng thc ng k reference-based, nhng c trng m c trch
chn t mt tp cc ch k hun luyn s c lu tr nh l mt tp cc ch k mu.
Mi mt ch k mu s tng ng vi mt ch k hun luyn. Sau , tin trnh i
snh c thc hin bng cch so snh ch k u vo vi tp ch k mu v s dng
k thut hp nht mc im kt hp cc im s thu c li vi nhau.
Trong phng thc ng k model-based, tp cc ch k hun luyn ca mt
i tng cho trc c s dng c lng mt m hnh thng k trong m t
hnh vi ca mt ngi k c th.
Khi tp ch k hun luyn nh th ng k da vo tham chiu ph hp hn so
vi ng k da vo m hnh. S d nh vy l v t c hiu sut cao th m
hnh thng k i hi phi c t nht t 4 n 6 ch k hun luyn.
(OSV)
10 20, 2010
1.3.4 So khp (Matching)

Trong cch tip cn feature-based vi vic ng k reference-based, tin trnh
i snh thng c thc hin bng cch so snh mt s kiu o lng khong cch
gia ch k u vo vi ch k mu (bao gm khong cch Euclit, khong cch
Euclit c trng s v khong cch Mahalanobis), hoc s dng b phn lp c
hun luyn (nh h thng mng n ron). Cn i vi phng thc featured-based kt
hp vi vic ng k model-based, ngi ta s dng cc m hnh thng k nh c
lng mt khng tham s da trn Parazen Window.
Hnh 5: S mapping
Trong cch tip cn function-based, th ty thuc vo chin lc so khp m
ngi ta phn thnh 2 loi: cc b v min.
- Phng thc local s dng cch thc o lng khong cch n hi nh thut
ton DTW (Dynamic Time Warping) i snh cc hm thi gian.
-
Phng thc regional, cc hm s thi gian c chuyn thnh mt tp cc vc

t. Mi mt vc t nh th biu din cho mt tp cc thuc tnh min ca mt
phn on ch k. Mt trong nhng thut ton ph bin cho phng php ny
l HMM (Hidden Markov Models- M hnh Markov n).
1.3.5 Tnh ton tng t (Similarity degree calculating)

Sau qu trnh so khp chng ta c c s so khp ti u gia ch k th
(test signature) v ch k mu (template signature).
Tip n, chng ta s tnh ton tng t gia 2 ch k trn bng 1 s
phng php no , chng hn vi thut ton Hi qui tuyn tnh (Linear
Regression). Thng gi tr tng t c gi tr thc trong min [0,1] vi 0 c ngha
l hon ton sai lch v 1 l hon ton khp tuyt i.
10
(OSV)
10 20, 2010
Vic nh gi gi tr ca tng t c so snh vi ngng ca h thng

(system threshold). Nu gi tr tng t ln hn hay bng Threshold th chp nhn
(Accept), ngc li th t chi (Reject). Vic thit k gi tr ca Threshold ph thuc
vo tnh cht h thng cng nh mc bin i ca ch k theo thi gian.
2 Thut ton so khp DTW (Dynamic Time Warping)

2.1 Gii thiu
Vo nm 1983, Joseph Kruskal v Mark Liberman gii thiu mt k thut
mi cho php tm ra ng chun ho ti u da trn vic so snh hai mu d liu
c vector ho c trng (tc l tnh khong cch gia chng). K thut ny c
gi l time warping, c th so khp hai vector c c trng khc nhau v thi gian v
tc . V d, c th so snh da vo dng i ca mt ngi i chm v ngi khc i
nhanh hn hay thm ch c s tng, gim tc quan st i tng dc ng i. Mt
trong nhng c im ca DTW rt hu ch trong lnh vc nhn dng ch k l kh
nng x l nhng ng ch k c di khng bng nhau (tc l ng cong c
mt s lng cc im to x,y khc nhau). iu ny cho php so snh m khng
cn phi ly li mu. Bi vic ly li mu thng xo bt thng tin hay thm thng tin
sai (ng cong bao gm nhiu im cha ng nhiu thng tin hn nhng ng
cong t im, v vy vic ly mu l khng cn thit), cho nn tt hn l khng s
dng.
Kruskal v Liberman ngh s dng k thut ny trong nhn dng ging
ni, bi c im ging ni l chui tn hiu bin thin lin tc theo thi gian. Ngoi
ra k thut ny cho thy kh hu ch trong nhiu ng dng khc nh nhn dng dng
i, ngi my, khai thc d liu v xc thc ch k online.
V d sau y cho ta bit lm th no mt chui d liu theo thi gian c
warp vi mt chui khc.
Thi gian
Hnh 6 - M hnh DTW mapping
11
(OSV)
10 20, 2010
Trong hnh trn, mi ng thng ni mt im trn chui thi gian ny vi

cc im tng ng trn chui thi gian kia. Cc ng c gi tr ging nhau trn
trc y, nhng c tch ra cc ng thng ng gia chng c th d dng
nhn thy. Nu c chui thi gian trong hnh ging ht nhau th tt c cc ng s l
thng ng v lc ny khng cn phi dng k thut time warping na. Khong
cch ng warp l o s khc nhau gia hai chui thi gian sau khi c warp
vi nhau, c tnh bng tng cc khong cch gia mi cp im c ni vi nhau
bng cc ng thng ng trong hnh trn. Nh vy, hai chui thi gian m ging
ht nhau ngoi tr vic ko dn cc b ca cc trc thi gian s c khong cch DTW
bng 0.
2.2 Gii thut
Vic tnh ton khong cch gia cc mu vector l bc cn thit cho vic xc
nh ng dng gia cc mu v cho vic phn lp mu. Mt trong cc phng
php tnh khong cch hiu qu l khong cch Euclidean. Khong cch Euclidean
n gin c tnh bng tng bnh phng khong cch t mi im trong mu vector
ny n mi im trong mu vector khc. Tuy nhin vic s dng khong cch
Euclidean cho cc mu vector ch k c nhc im ln l khng trc quan. Nu hai
mu vector ch k ging nhau, tuy nhin mt trong cc mu hi lch trn trc th
khong cch Euclidean cho rng hai mu ny l hon ton khc nhau. K thut DTW
c xut loi b nhc im trn v a ra cch tnh khong cch trn hai mu
vector mt cch trc quan bng cch b qua nhng im khc nhau khng cn thit
trn trc thi gian.
2.2.1 Pht biu bi ton
Cho hai vector ch k X, Y c chiu di ln lt l |X| v |Y|
X = x1, x2, .., xi, .., x|X|
Y = y1, y2, .., yj, .., y|Y|
t W l ng warp, vi:
W = w1, w2, .., wk tho iu kin max(|X|, |Y|) K |X| + |Y|
Trong K l chiu di ca ng warp v phn t th k ca W l wk = (i, j).
Vi i l ch s trn trc to ca vector X v j l ch s trn trc to ca vector Y.
ng warp W phi bt u v tr u tin ca hai vector tc l w1=(1, 1) v kt
thc ti im cui cng ca hai vector wk=(|X|, |Y|). iu ny m bo rng mt v tr
trn hai vector u c s dng trong ng warp. y cng l mt trong cc rng
buc trong khi xy dng ng warp rng i v j phi tng tun t, iu ny l gii ti
sao nhng ng i din cho ng warp trong hnh (..) trn khng chng lp ln
nhau. Ni mt cch hnh thc nh sau:
12
(OSV)
10 20, 2010
Wk = (i, j), wk+1=(i, j) vi i i i+1, j j j+1

ng warp ti u chnh l ng warp c khong cch nh nht. Khong
cch ca ng warp W c tnh bng:
Trong , Dist(W) l khong cch Euclidean ca ng warp W, v Dist(wki,

wkj) l khong cch gia hai im th i v th j tng ng trn hai vector X, Y ca
phn t th k ca ng warp W.
2.2.2 Thut ton DTW
M hnh lp trnh ng c dng tm khong cch nh nht ca ng
warp. Thay v c gng gii ton b bi ton cng lc, ta s gii nhng bi ton con
tm li gii cho bi ton ln hn, c nh vy cho n khi tm ra c li gii cho ton
b bi ton trn hai vector. Gi D l ma trn chi ph hai chiu |X|x|Y|, gi tr D(i, j) l
ng warp c khong cch nh nht trn hai vector X = x1, .., xi v Y = y1,.., yj. Gi
tr ti D(|X|,|Y|) cha khong cch nh nht ca ng warp gia vector X v Y. Hai
trc to ca D i din cho trc thi gian. Vi trc x l trc ca vector X, y l trc
ca vector Y. Hnh sau a ra mt v d v ma trn chi ph v ng warp c khong
cch nh nht nh du t D(1,1) n D(|X|, |Y|).
13
(OSV)
10 20, 2010
Hnh 7 - ng warp c khong cch nh nht trn ma trn chi ph

Ma trn chi ph v ng warp trn Hnh 2 biu din cho hai vector Hnh 1.
ng warp W = {(1,1); (2,1); (3,1); (4,2); (5,3); (6,4); (7,5); (8,6); (9,7); (9,8); (9,9);
(9,10); (10,11); (10,12); (11,13); (12,14); (13,15); (15,15); (16,16)}. Nu mt im
D(i,j) c mt trong ng warp th c ngha l im th i trn vector X s c warp
vi im th j trn vector Y. rng, ti nhng on thng ng ca ng warp
th mt im trn vector X c warp vi nhiu im trn vector Y v ngi li ti
nhng on nm ngang. Do mt im c th ni n nhiu im trong vector khc
nn cc vector ny khng cn c chiu di bng nhau. Nu X v Y l hai vector ging
nhau, th ng warp trn ma trn chi ph s l ng cho thng.
tm ra tng thch ti u nht (tc l ng warp c khong cch nh
nht) th mi im trn ma trn chi ph phi c gi tr. tng chnh ca DTW i
vi bi ton ny l vic tnh ton da trn sai bit nh nht ca cc v tr trc
(tc l ng warp nh nht trc ). C th:
D(i,j) = cost(xi, yj) + min{D(i-1,j); D(i-1,j-1); D(i,j-1)}
14
(OSV)
10 20, 2010
Trong , (i,j) l v tr cn tnh, cc im (i-1,j), (i-1,j-1), (i,j-1) l cc v tr

trc v cost(xi,yj) l khong cch Euclidean tnh t v tr th i trn vector X n
v tr th j trn vector Y.
Sau khi ton b ma trn tnh ton gi tr, ng warp ti u chnh l ng

bt u t D(1,1) n D(|X|,|Y|). Tht ra, vic tm ng warp ti u c tnh bt u
v tr cui cng trn ma trn D(|X|,|Y|). V tr tip theo c t vo ng warp l
v tr c gi tr nh nht trong ba v tr ng st bn v tr ang xt ( bn tri, st
bn di v lin k cho bn tri). C nh th cho n khi tin n v tr D(1,1) v
kt thc vic tm kim.
2.3 Cc rng buc
Thut gii DTW xy dng mt ng so khp theo cch phc tp hn. N da
trn vic so khp tuyn tnh nhng km theo ba iu kin cn phi tho mn. l,
tnh lin tc, gii hn bin v tnh n iu.
2.3.1 iu kin lin tc (Continuity Condition)
iu kin ny quyt nh mc khc nhau c th chp nhn c gia vic
so khp dng DTW so vi so khp tuyn tnh. y l iu kin bt buc trong DTW
c Vouri ET. Al a ra. Nu N1 v N2 ln lt l s im trong hai vector, tng
ng im th i ca vector u tin vi im th j ca vector th hai c th c so
khp vi nhau nu:
( ) cN2 j ( ) + cN2
Trong , c l s lng so khp khc vi so khp tuyn tnh. Do , nu c =1

th iu kin ny khng cn tc dng (tng im trn vector ny so khp vi tt c cc
im trn vector kia), nu c =0 th kt qu ging so khp tuyn tnh.
15
(OSV)
10 20, 2010
Hnh 8 - iu kin lin tc

Hnh 3 cho bit iu kin lin tc to ra rng buc trn ng so khp nh th no.
C th, cc im so khp tng ng cc gch cho khng c tnh (khi c = 0.4).
2.3.2 iu kin gii hn bin (Boundary Condition)
Gii hn bin nu c bt ln, bt buc cp im u (1,1) v cp im cui
(|X|,|Y|) ca hai vector phi nm trong tp cc im cn so khp.
Hnh 9 - iu kin gii hn bin

2.3.3 iu kin tnh n iu (Monotonicity condition)
Tnh n iu gip ngn chn vic quay lui (going back in time). Ti mt im
(i,j) (im th i trn vector u tin v im th j trn vector th hai) no c
thm vo ng so khp, th im (i,j) no c kh nng phi cc im m ch s
i > i, j<j v cc im m ch s i<i, j>j (xem hnh 4).
Hnh 10 - iu kin tnh n iu. Cc gch cho b cm bi iu kin ny

16
(OSV)
10 20, 2010
3 Hi qui tuyn tnh n gin (Simple Linear Regression)

3.1 Gii thiu
Phn tch hi qui tuyn tch n gin l tm s lin h gia 1 bin s c
lp(bin d on) trn trc honh x vi 1 bin s ph thuc (bin kt cc) trn trc
tung y. Sau v 1 ng thng hi qui v t phng trnh ng thng ny ta c th
d on c bin y (v d: cn nng) khi c x (v d: tui)
17
(OSV)
10 20, 2010
V d :
tui
Cn nng
10
12
14
16
18
20
Hnh 11: ng hi qui tuyn tnh
18
(OSV)
10 20, 2010
Phng trnh ng hi qui

-
Cho 2 tp hp:
X(x1,x2,x3, , xn)
Y(y1,y2,y3, , yn)
m hnh ha quan h tuyn tnh trong din t s thay i ca bin Y theo

bin X cho trc ngi ta s dng m hnh hi qui tuyn tnh n gin.
M hnh hi qui tuyn tnh n gin c dng sau:
Yi = A + BXi + ei (m hnh hi qui tuyn n gin Y theo X)
Trong :
o Xi : gi tr th i trong tp X
o Yi : gi tr th i trong tp Y
o A,B : h s
o ei : sai s
Nh vy nu sai s ei cng nh s lin h gia x,y cng ln v ngc li.
3.2 H s tng quan R2

- Cho 2 tp hp:
o X(x1,x2,x3, , xn)
o Y(y1,y2,y3, , yn)
-
H s tng quan l mt ch s thng k o lng mi lin h tng quan gia

2 tp X v Y.
H s tng quan c gi tr t 0 n 1. H s tng quan bng 0 ngha l 2 bin

s khng c quan h g vi nhau; ngc li nu h s bng 1 hay ngha l 2
bin s c mi quan h tuyt i.
H s tng quan c cng thc sau:
R2
[ ( xi X )( yi Y )]2
i 1
i 1
i 1
( xi X ) 2 ( yi Y ) 2
Trong :
o
X : gi tr trung bnh trong tp X
o Y : gi tr trung bnh trong tp Y

-
R2 c cc tnh cht sau:
19
(OSV)
10 20, 2010
o Phn x: R2(X,X) = 1
o i xng: R2(X,Y) = R2(Y,X)
o R2 = [0,1]
3.3 M rng R2 (ER2)
- M hnh hi qui tuyn tnh n gin ch p dng cho cc tp hp 1 chiu (1dimension). Tuy nhin vi cc tp l a chiu (multi-dimension) th khng p
dng c. V d vi cc tp d liu ca m hnh OSV l cc tp a chiu bao
gm ta (x,y), cao , nghin
-
p dng cc tp a chiu, ta s dng cng thc sau, gi l ER2:
ER 2
j 1
n
i 1
[ ( ( xij X j )( yij Y j ))]2

M
j 1 i 1
( xij X j ) 2 ( yij Y j ) 2
j 1 i 1
Trong :
o
X : gi tr trung bnh trong tp X
o Y : gi tr trung bnh trong tp Y

o M : s chiu ca tp hp
o n : s phn t
4 Kt hp DTW v ER2
Qu trnh so khp ch k c thc hin theo 2 bc:
-
p dng thut ton DTW tm s mapping vi chi ph nh nht.
p dng qui hi tuyn tnh tm h s tng quan gia 2 ch k
Vic kt hp gia DTW v ER2 mc ch l lm tng chnh xc ca vic so khp.

Sau khi c c gin tr ca h s tng quan ta s so snh vi ngng cho php(ty
vo ng cnh) m ra quyt nh v vic so khp l tht hay gi.
5 ng dng Demo
5.1 c t
20
(OSV)
10 20, 2010
5.1.1 M hnh i tng
Hnh 12: M hnh i tng

5.1.2 M hnh x l
21
(OSV)
10 20, 2010
Hnh 13: M hnh x l

5.1.3 S Use-Case
22
(OSV)
10 20, 2010
Hnh 14: S Use-Case
23
(OSV)
10 20, 2010
5.1.4 M hnh cc component
Hnh 15: M hnh cc component

5.1.5 Lc Sequence
5.1.5.1
Chc nng xc nh ch k
Hnh 16: Lc sequence Chc nng xc nh ch k
24
(OSV)
5.1.5.2
10 20, 2010
Chc nng to ch k mu
Hnh 17: Lc sequence Chc nng to ch k mu
25
(OSV)
5.1.5.3
10 20, 2010
Chi tit module xc nh ch k
Hnh 18: Lc sequence Xc nh ch k

5.2 Ci t
M t m gi mt s thut ton chnh ch yu trong ng dng
5.2.1 Thut ton DTW
5.2.1.1 M t cc k hiu
S1(P1,P2, , PN) : tp N cc ta (x,y) trn ch k 1
S2(P1,P2, , PM) : tp M cc ta (x,y) trn ch k 2
u[i] : vector th i trn S1 (1 < i < N)
u[j] : vector th j trn S2 (1 < j < M)
d[NxM] : ma trn khon cch
DTW[NxM] : ma trn khon cch tch ly
K : s ng warp ti u gia S1 v S2
w[Kx2] : ma trn lu cc cp (i,j) tng ng ng warp gia S1(i) v S2(j)
5.2.1.2 Xy dng ma trn DTW
Khi to ma trn khon cch
o d[i,j] = (u[i] v[j])2
Khi to phn t [0,0] ca ma trn DTW
o DTW[0,0] = d[0,0]
Tnh tch ly cc phn t dng 0 trn ma trn DTW
o DTW[0,j] = d[0,j] + DTW[0,j-1] (for j = 1 to M)
26
(OSV)
10 20, 2010
Tnh tch ly cc phn t ct 0 trn ma trn DTW

o DTW[i,0] = d[i,0] + DTW[i-1,0] (for j = 1 to N)
Tnh tch ly cc phn t cn li trn ma trn DTW
o for i =1 to N , j=1 to M
DTW[i,j] = d[i,j] + min(DTW[i-1,j], DTW[i,j-1], DTW[i-1,j-1])
o end for
5.2.1.3 Tm warp-path vi khon cch nh nht
Khi to 3 bin
o K=1
o i = N (chiu di ca S1)
o j = M (chiu di ca S2)
while(i,j > 1)
o Nu (i = 1)
j = j -1;
o Ngc li, nu (j = 1)
i = i -1;
o Ngc li
x = min(DTW[i-1,j], DTW[i,j-1], DTW[i-1,j-1])
Nu (x == DTW[i-1,j])
i = i -1;
Nu (x == DTW[i,j-1])
j = j -1;
Nu (x == DTW[i-1,j-1])
i = i -1;
j = j -1;
o Gn w[K,0] = i v w[K,1] = j;
o Gn K = K + 1;
o end while
5.2.2 Thut ton Enroll
Thc hin tin x l d liu. Thut ton thc hin vic dch chuyn cc im
trong S1 v S2 v h trc ta gc v scale vi vector n v.
Tm minx trong cc im Pi.x
Tm maxx trong cc im Pi.x

Tm miny trong cc im Pi.y
Tm maxy trong cc im Pi.y
Lp vi i < N:
o Pi.x = (Pi.x - minx) / (maxx - minx)
27
(OSV)
10 20, 2010
o Pi.y = (Pi.y - miny) / (maxy - miny)

5.3 Hng dn s dng
5.3.1 Mn hnh chnh ca chng trnh
Hnh 19: Mn hnh chnh

Mn hnh chnh thc hin:
1. M ra ca s ng k ch k mu bng cch nhn nt Signature Registration
2. M ra ca s xc nhn ch k bng cch nhn nt Signature Verification
3. Ci t thng s Threshold bng cch v menu Application Setting
5.3.2 Chc nng ng k ch k mu (Registration)
28
(OSV)
10 20, 2010
Hnh 20: Mn hnh ng k ch k mu
Cc bc tin hnh ng k ch k mu cho mt ngi dng nh sau:

1. Nhp m ngi dng trong User ID
2. Nhn nt Register ng k v h thng
3. To ch k mu 1:
a. K vo vng trng trn trong khung Sign Here
b. Lu ch k vo h thng bng cch nhn nt Save Signature 1
4. Tng t cho vic to ch k mu 2
29
(OSV)
10 20, 2010
5. Nhn nt Clear xa v k li
6. Nhn nt Quit hon tt v thot ra ngoi
5.3.3 Chc nng xc nhn ch k (Verification)
Hnh 21: Mn hnh xc nhn ch k

Cc bc tin hnh xc nhn ch k nh sau:
1. Nhp m ngi dng trong User ID
2. Nhn nt Accept chp nhn. Nu UserID khng tn ti, ng dng s
thng bo.
3. K vo vng trng trong khung Signature Area
4. Nhn nt Verify xc nhn ch k
30
(OSV)
10 20, 2010
5. ng dng s thng bo kt qu bn di gm: phn trm(%) chnh xc ca

ch k v kt lun ch k l tht(Genuine) hay gi(Fake) da trn ch s % ca
Threshold
a. Nu chnh xc ln hn hoc bng Threshold Genuine
b. Ngc li l Fake
5.3.4 Chc nng ci t ngng xc nhn (Threshold)
Hnh 22: Mn hnh ci t
Cc bc tin hnh ci t Threshold

1. Ko thanh trt vi kt qu nh mong mun.
2. Nhn nt Quit lu v thot ra ngoi
5.3.5 Chc nng g b ch k mu (Remove)
31
(OSV)
10 20, 2010
Hnh 23: Mn hnh g b ch k mu
32

Osv 3 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Osv 3 PDF

Uploaded by

Copyright:

Available Formats

Online-Signature Verification

Gio vin hng dn:

Tng quan v Online-Signature Verification (OSV)

1.2 Th trng OSV

ng dng ca OSV ................................................................................. 6

Cc h thng thng mi ........................................................................ 7

1.3 H thng chng thc ch k online

Thu nhn d liu v tin x l (Data Acquisition and Preprocessing)...... 7

Trch chn c trng (Feature extraction) ............................................... 8

So khp (Matching) .............................................................................. 10

Tnh ton tng t (Similarity degree calculating) ........................... 10

Thut ton so khp DTW (Dynamic Time Warping)

2.1 Gii thiu

2.2 Gii thut

Pht biu bi ton.................................................................................. 12

Thut ton DTW ................................................................................... 13

2.3 Cc rng buc

iu kin lin tc (Continuity Condition) ............................................. 15

iu kin gii hn bin (Boundary Condition) ...................................... 16

iu kin tnh n iu (Monotonicity condition) ................................. 16

Hi qui tuyn tnh n gin (Simple Linear Regression)

3.1 Gii thiu

3.2 Phng trnh ng hi qui

3.3 H s tng quan R2

3.4 M rng R2 (ER2)

M hnh i tng ................................................................................ 21

M hnh cc component ........................................................................ 24

Thut ton DTW ................................................................................... 26

Thut ton Enroll .................................................................................. 27

5.3 Hng dn s dng

Mn hnh chnh ca chng trnh .......................................................... 28

Chc nng ng k ch k mu (Registration) ...................................... 28

Chc nng xc nhn ch k (Verification) ............................................ 30

Chc nng ci t ngng xc nhn (Threshold)................................... 31

Chc nng g b ch k mu (Remove) ............................................... 31

DANH SCH HNH

1 Tng quan v Online-Signature Verification (OSV)

1.2 Th trng OSV

Kim tra php l ch k:

Chng thc ch k: S dng ch k ng nhp h thng, m ha ti liu,

Gim st ch k: So snh t ng cc ch k trc tuyn theo di v pht

H thng bo mt nhn trc hc: S dng cc hm thi gian ca ch k trc

Hnh 1: ng dng SignDoc ca SOFTPRO

1.2.2 Cc h thng thng mi

Hng CIC (Communication Intelligence Corportation) c mt s cc sn phm

1.3 H thng chng thc ch k online

Hnh 2: M hnh h thng chng thc ch k online

Cc thit b thu nhn ch k trc tuyn thng hot ng t 100 n 200

Phng thc feature-based l phng thc m t qu o ca ch k c th

Phng thc function-based l phng thc m trong chui thi gian m t

Hnh 4: Trch chn c trng t ch k mu

1.3.4 So khp (Matching)

Phng thc regional, cc hm s thi gian c chuyn thnh mt tp cc vc

1.3.5 Tnh ton tng t (Similarity degree calculating)

Vic nh gi gi tr ca tng t c so snh vi ngng ca h thng

2 Thut ton so khp DTW (Dynamic Time Warping)

Trong hnh trn, mi ng thng ni mt im trn chui thi gian ny vi

Wk = (i, j), wk+1=(i, j) vi i i i+1, j j j+1

Trong , Dist(W) l khong cch Euclidean ca ng warp W, v Dist(wki,

Hnh 7 - ng warp c khong cch nh nht trn ma trn chi ph

Trong , (i,j) l v tr cn tnh, cc im (i-1,j), (i-1,j-1), (i,j-1) l cc v tr

Sau khi ton b ma trn tnh ton gi tr, ng warp ti u chnh l ng

Trong , c l s lng so khp khc vi so khp tuyn tnh. Do , nu c =1