Trch chn c trng wavelet Haar kt hp vi SVM cho vic nhn dng ch vit tay ting Vit

Vietnamese Handwritten Character Recognition By Combining SVM and Haar Wavelet Features
Phm Anh Phng, Ng Quc To, Lng Chi Mai Abstract: This paper proposes a recognition model for
isolated Vietnamese handwritten character recognition. Based on connected regions of image we try to determine character image that belongs to a group of characters which has either diacritical mark or not. In our model, character part and its diacritical mark part could be separately defined and they come independently for recognition. Hence, we apply SVM (Support Vector Machines) classification where Haar wavelet features from a mark part and a character part are extracted independently. Finally, we join classified results together to have recognition outcome. Our test results over Vietnamese handwriting with 50,000 character samples collecting from 655 individuals show that the accuracy of our recognition model is over 88%. Keywords: Vietnamese handwritten character recognition, SVM.

I. GII THIU Nhn dng ch vit tay ang l vn thch thc ln i vi cc nh nghin cu, bi ton ny cha th gii quyt trn vn c v n ph thuc qu nhiu vo ngi vit v s bin i qu a dng trong cch vit v trng thi tinh thn ca tng ngi vit. Cho n nay, bi ton nhn dng ch vit tay cng c mt s kt qu kh quan, yu tp trung trn cc tp d liu ch s vit tay nh USPS v MNIST [4,5,6], mt s kt qu khc m rng i vi cc ch ci h La tinh, Hy lp... [2,7]. c bit i vi vic nhn dng ch vit tay ting Vit li cng gp nhiu kh khn

hn do b k t ting Vit c nhiu ch c hnh dng rt ging nhau, ch khc nhau cht t v phn du. Do c rt t kt qu nghin cu v nhn dng ch vit tay ting Vit v cc kt qu nghin cu ch yu cng ch tp trung vo ch vit tay online [9]. Bi ton chng ti t ra y l xy dng mt m hnh nhn dng ch Vit vit tay hn ch. Chng ti gii hn phm vi ca bi ton theo mt s qui nh nh: cc ch vit phi c mt khong cch tng i, gia phn ch v phn du phi tch ri nhau. B k t ting Vit bao gm tp k t khng du {A, B, C, D, , E, G, H, I, K, L, M, N, O, P, Q, R, S, T, U, V, X, Y} v cc k t c du {, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , }. SVM (Support Vector Machines) l mt phng php my hc tin tin c nhiu thnh cng khng ch trong cc lnh vc khai ph d liu m cn trong lnh vc nhn dng. Trong nhng thp nin gn y, SVM c nh gi l mt trong nhng phng php phn lp c chnh xc rt cao v n cng c p dng nhiu trong cc bi ton nhn dng ch vit tay [3,4,5,6]. V vy chng ti xut mt m hnh nhn dng ch Vit vit tay hn ch trn c s phng php phn lp SVM. Trch chn c trng phc v cho cng vic hun luyn v nhn dng l

mt bc rt quan trng trong mt h thng nhn dng. C rt nhiu phng php trch chn c trng hiu qu c th p dng cho ch vit tay nh: ma trn trng s, ton t Kirsch, cc biu chiu...[4,5,7], trong bi bo ny chng ti s dng tng ca phng php trch chn c trng wavelet Haar [8] cho m hnh nhn dng ch vit tay ting Vit. Da trn c s cc thnh phn lin thng ca nh, chng ti phn tp k t ting Vit thnh 3 nhm v tch cc k t c du thnh cc phn ri nhau. Sau chng ti xy dng cc my phn lp SVM nhn dng cho tng phn ch v du. Cc kt qu thc nghim cho thy m hnh nhn dng ca chng ti c chnh xc tng i cao. Phn cn li ca bi bo ny c cu trc nh sau: Phn 2 tm tt nhng tng c bn ca phng php phn lp SVM nh phn. Phn 3 pht ha kin trc ca m hnh nhn dng, thut ton trch chn c trng Haar wavelet v xy dng cc my phn lp SVM phc v cho vic nhn dng. Phn 4 l cc kt qu thc nghim trn tp d liu vit tay ting Vit m chng ti thu thp c. Cui cng l phn kt lun. II. PHNG PHP PHN LP SVM Hm mc tiu ca mt my phn lp SVM nh phn c th c pht biu nh sau: g(x) = w.(x) + b (1) tha mn:

Hnh 1. Siu phng tch vi khong cch l cc i.

Khong cch l gia hai lp l

2 w.w

2 w 2

. ni

lng iu kin phn lp, thm vo mt s yu t cn bng v vic hun luyn SVM chnh l gii bi ton ti u c rng buc:
min
w,b

1 2

w.w + C

i=1

(2)

sao cho: yi(w. (xi) + b) 1-i i 0, i, trong C l tham s ni lng iu kin phn lp [1]. Thay v gii bi ton (2), ta gii bi ton i ngu ca n bng cch gii bi ton qui hoch ton phng (QP-Quadratic programming):

1 max 1 T H 2
0iC, i v

(3)

trong , vc t u vo x R D , w l vc t chun ca siu phng phn cch trong khng gian c trng c sinh ra t nh x (x): R D R F (F > D, (x) c th tuyn tnh hoc phi tuyn) v b l lch so vi gc ta . Ban u, SVM c thit k cho bi ton phn lp nh phn, do du ca g(x) cho bit vc t x thuc lp +1 hay lp -1. Cho tp mu {(x1,y1),...,(xN,yN)} trong xiRD v yi{1}, mc tiu ca phng php phn lp SVM l tm mt siu phng phn cch sao cho khong cch l (margin) gia hai lp t cc i (Hnh 1).

y
i =1 i

= 0,

trong =[1,..., N]T v H l ma trn kch thc NN c gi l ma trn nhn (kernel matrix) vi mi phn t H(i,j) = yiyj(xi).(xj). Gii bi ton QP (3) ta thu c:
w=
N

i yi (x i )
i =1

(4)

Mi mu hun luyn xi tng ng vi mt h s Lagrange i. Sau khi hun luyn, cc mu c i>0 c gi l vc t h tr.

Th (4) vo (1), ta c :
g(x) =

i yi (x i ). (x) + b
i =1

(5)

thun tin cho vic x l sau ny, chng ti bin i nh u vo t nh a cp xm thnh nh nh phn.

Gi s (xi).(xj) = K(xi,xj). Ngha l, tch v hng trong khng gian c trng tng ng vi mt hm nhn K ca khng gian u vo. V vy, ta khng cn phi tnh trc tip cc gi tr (xi), (xj) m ch cn tnh tch v hng <(xi).(xj)> gin tip thng qua hm nhn K(xi,xj). Nu s dng hm nhn l hm tuyn tnh th SVM c gi l SVM tuyn tnh, ngc li th gi l SVM phi tuyn. Nh vy, hm mc tiu cho bi ton phn lp SVM nh phn c dng:

g(x) = i yi K(x i , x) + b
i =1

(6)

Ch c cc vc t h tr tham gia vo vic xy dng siu phng phn cch, do mt mu x s c phn lp theo hm quyt nh:

NSV f (x) = sgn i yi K(x i , x) + b i =1

trong , NSV l s vc t h tr.

(7)

Hnh 2. Kin trc ca m hnh nhn dng

III. M HNH NHN DNG CH VIT VIT TAY HN CH Trong phn ny, chng ti s trnh by chi tit kin trc ca m hnh nhn dng ch Vit vit tay hn ch (Hnh 2). 1. Tin x l Mc ch ca giai on tin x l nhm tng chnh xc ca h thng nhn dng. Khi qut nh thng gp cc loi nhiu, v vy chng ti s dng mt s k thut lc nhiu kh cc nhiu m v nhiu vt di. i vi nhiu m, s dng cc b lc trung bnh v lc trung v, cn vi cc nhiu vt di th chng ti s dng phng php kh cc vng lin thng nh (Hnh 3). (a) Nhiu m (b) Nhiu vt di
Hnh 3. Mt s nhiu thng gp khi qut nh

Chun ha nh theo vng lin thng Chun ha nh nhm mc ch to iu kin thun tin cho cng on tch nh thnh tng phn ch v du. Bc 1: Xc nh cc vng lin thng trn nh (Hnh 4).

thc chun 88 v chun ha vng lin thng 3 v kch thc chun 1616 (Hnh 5c). 2. Phn nhm s b Da vo s thnh phn lin thng chng ti tch b k t ting Vit thnh 3 nhm: Nhm 1: Nhm c 1 vng lin thng {A, B, C, D, , E, G, H, I, K, L, M, N, O, P, Q, R, S, T, U, V, X, Y, , }. Nhm 2: Nhm c 2 vng lin thng {, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , }. Nhm 3: Nhm c 3 vng lin thng { , , , , , , , , , , , , , , , , , , , } 3. Trch chn c trng Chng ti s dng tng ca phng php trch chn c trng wavelet Haar [8] chn tp c trng cho mi nh k t u vo. (a) (b) (c)

(a)

(b)

Hnh 4. Chun ha nh. (a) nh gc (b) Xc nh cc vng lin thng v nh th t cc vng lin thng.

Bc 2: Sp xp cc vng lin thng theo th t t trn xung (Hnh 4b). Bc 3: - Nu nh ch c 1 vng lin thng: Chun ha nh v kch thc chun 1616 (Hnh 5a).

Hnh 5. Chun ha cc vng lin thng.

- Nu nh c 2 vng lin thng: Gi S(i) l din tch vng lin thng th i. Nu S(1)>S(2) th du ca phn lin thng 2 l du nng (.) v ch cn chun ha vng lin thng 1 v kch thc chun 1616. Ngc li: Tch nh thnh 2 phn: phn ch v phn du. Chun ha phn ch v kch thc chun 1616 v phn du v kch thc chun 88 (Hnh 5b). - Nu nh c 3 vng lin thng: Nu S(3) = Min{S(i)} th du ca phn lin thng ny l du nng (.). Do ch cn chun ha thnh phn lin thng 1 v kch thc chun 88 v thnh phn lin thng 2 v kch thc chun 1616. Ngc li: Tch nh thnh 3 phn t cc vng lin thng. Chun ha cc vng lin thng 1 v 2 v kch
Hnh 6. Qu trnh trch chn c trng

T nh nh phn kch thc 2n2n (Hnh 6), qu trnh trch chn c trng c m t theo thut ton sau: Procedure HaarFeature Input Ma trn vung (A,n) cp 2n. Output Tp cc c trng {F1, F2,..., F2n 2n }. Method 1. Khi to: Queue = ; i = 1;

2. - Tnh Fi= Tng cc im en trong ton b ma trn (A,n); - PUSH((A,n), Queue); 3. While Queue Do { - POP(Queue, (A,n)); - if (n>1) { n = n DIV 2; Chia nh thnh 4 phn: A1, A2, A3, A4; for (j=1; i 4; j++) PUSH((Aj,n), Queue); } - Gi S, S1, S2, S3, S4 l tng cc im en tng ng vi cc khi A, A1, A2, A3, A4; - Tnh Fi+1 = S1 + S2; Fi+2 = S2 + S3; Fi+3 = S4; - i = i + 3; } Phng php tnh nhanh tng cc im en trong trong thut ton trn c th tham kho trong [8]. Mnh (tnh bt bin ca c trng): Cho ma trn vung A cp 2n, n nguyn dng. Theo phng php trch chn c trng ca thut ton HaarFeature th ma trn A bt bin i vi cc c trng c trch chn. Chng minh Dng phng php quy np. Ta chng minh mnh ng vi n=1. Tht vy, gi s x1, x2, x3, x4 l 4 phn t ca ma trn vung cp 2. Theo phng php trch chn c trng trn ta c h phng trnh:

do h phng trnh c nghim duy nht. V vy, theo cch trch chn c trng ca thut ton HaarFeature th ma trn A bt bin vi n=1. Gi s mnh ng vi n=k. Ta s chng minh mnh ng vi n=k+1. R rng ma trn vung cp 2k+1 c kch thc gp 4 ln ma trn vung cp 2k. Ta s chng minh rng nu mi mt phn t ca ma trn vung A cp 2k+1 bt bin th ma trn vung A cng bt bin theo phng php trch chn c trng ca thut ton HaarFeature. Tht vy, gi s ma trn vung A cp 2k+1 c chia thnh 4 khi con A1, A2, A3, A4 kch thc 2k c tng cc im en tng ng l S1, S2, S3, S4. Vi cch chia thnh 4 khi nh vy th ma trn A s c nghim duy nht X1=S1, X2=S2, X3=S3, X4=S4 tng ng vi cc phn t A1, A2, A3, A4. M mi khi Ai, i=1..4 l bt bin theo phng php trch chn c trng ca thut ton HaarFeature nn ma trn A cng bt bin theo phng php trch chn c trng trn . Trong thc nghim, vi phn ch chng ti chn n=4, nh vy ta c: 1 + 3 + 43 + 443 + 4443 = 256 c trng, cn vi phn du chng ti chn n=3, nh vy c tt c 64 c trng. Vi phng php trch chn c trng ny th s to ra mt dy s cc c trng gim dn. Vi cng mt ch th cc gi tr ln u dy tng i n nh, c th i din cho hnh dng khi qut ca ch; cn cc gi tr cui dy nh dn v khng n nh, th hin s a dng trong tng chi tit ca ch. 4. Xy dng cc my phn lp SVM Trong phn ny, chng ti s xy dng 3 my phn lp SVM, s dng tp c trng c trch chn trn hun luyn phn lp v nhn dng. i vi phn ch c kch thc 1616, c tt c 256 c trng. Cn phn du vi kch thc 88, nh vy c 64 c trng c trch chn. SVM1: phn lp i vi nhm k t c 1 vng lin thng {A, B, C, D, , E, G, H, I, K, L, M, N, O, P, Q, R, S, T, U, V, X, Y, , }.

1 1 x1 + x2 + x3 + x4 = S x +x 1 1 = S1 + S 2 1 2 v 0 1 x2 + x3 = S 2 + S3 0 0 x4 = S 4

1 1 0 0 =1 0 1 0 0 1

SVM2: i vi cc k t c du th phn ch u l cc nguyn m, v vy my ny ch phn lp cc nguyn m {A, E, I, O, U, Y}. SVM3: phn lp cc du {/, \, ?, ~, ^, } (sc, huyn, hi, ng, du , du ). Cc my phn lp SVM1, SVM2, SVM3 c xy dng t cc SVM nh phn. Chng ti chn thut ton SMO [1] hun luyn cc my phn lp nh phn theo chin lc mt chng mt (OVO One verus One) vi cc tham s C=100 v s dng hm nhn l hm Gaussian vi =0.5. IV. KT QU THC NGHIM Cc kt qu thc nghim ca chng ti c tin hnh ci t v chy th nghim trn my PC Pentium 4 tc 2.66 Ghz, 512Mb Ram. D liu ch vit tay ting Vit ca chng ti c thu thp t 655 ngi vit khc nhau, i tng ch yu l sinh vin. Mi ngi vit khong 200 ch in hoa, cc k t c vit ri rc. Chng ti chn lc ra 50000 mu tin hnh thc nghim (khng k cc du), trong 13782 mu ch khng du c s dng hun luyn, phn cn li phc v cho vic nhn dng. Chng ti xy dng 3 tp d liu phc v cho vic hun luyn: TrainData1: Tp cc du ting Vit {/, \, ?, ~, ^, }, vi 2485 mu. TrainData2: Tp cc ch ci nguyn m ting Vit {A, E, I, O, U, Y}, vi 4128 mu. TrainData3: Tp cc ch ci ting Vit khng du {A, B, C, D, , E, G, H, I, K, L, M, N, O, P, Q, R, S, T, U, V, X, Y, , }, vi 13782 mu. Chng ti xy dng 4 tp d liu phc v cho vic nhn dng, kt qu thc nghim th hin bng 1: TestData 1: Tp cc k t ting Vit c 1 vng lin thng, vi 7143 mu. TestData 2: Tp cc k t ting Vit c 2 vng lin thng, vi 16856 mu.

TestData 3: Tp cc k t ting Vit c 3 vng lin thng, vi 12219 mu. TestData 4 = TestData 1 TestData 2 TestData3.

Hnh 7. Cc mu trch t tp k t vit tay ting Vit. BNG 1. KT QU NHN DNG TRN D LIU TING VIT VIT TAY HN CH.

Tp mu TestData 1 TestData 2 TestData 3 TestData 4

S mu 7143 16856 12219 36218

chnh xc 82.24% 90.69% 87.78% 88.04%

Cc kt qu thc nghim bng 1 cho thy m hnh nhn dng ch Vit vit tay hn ch t chnh xc tng i cao. V. KT LUN Bi bo xut mt m hnh nhn dng ch Vit vit tay hn ch da trn c s SVM kt hp vi phng php trch chn c trng wavelet Haar. Chng ti da vo tnh lin thng ca nh xc nh xem nh k t thuc nhm k t c du hay khng du, trn c s s tin hnh tch nh thnh phn ch v phn du phn lp c lp, cui cng ghp ni cc kt qu phn lp ca phn ch v phn du c c kt qu nhn dng cui cng. Cc kt qu thc nghim ca chng ti cho thy vic p dng phng php phn lp SVM kt hp vi cc c trng Haar vo bi ton nhn dng ch vit tay ting Vit t chnh xc tng i kh quan v c trin vng.

Bi bo ny c s h tr ca ti nghin cu c bn: Khai thc mt s phng php tiu biu v trch chn c trng v kh nng ng dng trong nhn dng ch, ting ni, vn bn v hnh nh, m s 2.007.06. TI LIU THAM KHO
[1] J. Platt, Fast Training of Support Vector Machines Using Sequential Minimal Optimization, In Advences in Kernel Methods - Support Vector Learning, pp. 185-208, Cambridge, M.A, MIT Press, 1999. [2] L Hoi Bc, L Hong Thi, Neural Network & Genetic Algorithm in Application to Handwritten Character Recognition, Tp ch Tin hc v iu khin hc, Tp 17, s 4, tr. 57-65, 2001. [3] Chih-Chung Chang and Chil-Jen Lin, LIBSVM: a Library for Support Vector Machines, National Taiwan University, 2004. [4] Gorgevik D., Cakmakov D., An Efficient Three-Stage Classifier for Handwritten Digit Recognition, Proceedings of 17th Int. Conference on Pattern Recognition, ICPR2004, Vol. 4, pp. 507-510, IEEE Computer Society, Cambridge, UK, 23-26 August 2004.

[5] Cakmakov D., Gorgevik D., Handwritten Digit Recognition Using Classifier Cooperation Schemes, Proceedings of the 2nd Balkan Conference in Informatics, BCI 2005, pp. 23-30, Ohrid, November 17-19, 2005. [6] Phm Anh Phng, Nhn dng ch vit tay hn ch vi m hnh SVM, Tp ch khoa hc i hc Hu, tr. 157165, ISSN: 1859-1388, s 42, 2007. [7] G. Vamvakas, B. Gatos, I. Pratikakis, N. Stamatopoulos, A. Roniotis and S.J. Perantonis, "Hybrid Off-Line OCR for Isolated Handwritten Greek Characters", The Fourth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications (SPPRA 2007), pp. 197-202, ISBN: 978-0-88986-646-1, Innsbruck, Austria, February 2007. [8] Viola, P., Jones, M., Rapid object detection using a boosted cascade of simple features, Proc. Intl. Conf. on Computer Vision and Pattern Recognition (CVPR), Volume 1, pp. 511518 , 2001. [9] Ngo Quoc Tao, Pham Van Hung, Online Continues Vietnamese Handwritten Character Recognition based on Microsoft Handwritten Character Recognition Library, IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2006, Singapore, pp. 2024-2026.

Ngy nhn bi: 01/03/2008 S LC TC GI PGS.TS. NG QUC TO Tt nghip: Khoa Ton i hc Bch Khoa H Ni. Bo v Tin s: nm 1997 chuyn ngnh :" m bo ton hc cho cc h thng tnh ton", c phong hm Ph Gio s nm 2002. Ni cng tc: Vin Cng ngh thng tin H Ni. Lnh vc nghin cu: Nhn dng v X l nh. Email: nqtao@ioit.ncst.ac.vn PGS.TS. LNG CHI MAI Tt nghip i hc Kishinov, Lin X c nm 1981, chuyn ngnh Ton ng dng. Nhn bng Tin s chuyn ngnh Khoa hc My tnh ti vin Cng ngh thng tin nm 1991. c phong hm Ph Gio s nm 2005. Ni cng tc: Vin Cng ngh thng tin H Ni. Lnh vc nghin cu: K thut nhn dng, phn lp thng k, mng n ron, nhn dng ch quang hc v ting ni. Email:lcmai@ioit.ncst.ac.vn PHM ANH PHNG Sinh nm 1974. Tt nghip i hc S phm Hu nm 1996, chuyn ngnh Ton Tin hc. Nhn bng Thc s nm 2001, chuyn ngnh Cng ngh Thng tin ti i hc Bch Khoa H Ni. Hin ang lm nghin cu sinh ti Vin Cng ngh Thng tin H Ni. Ni cng tc: Khoa Cng ngh thng tin, trng i hc Khoa hc Hu. Lnh vc nghin cu: ha, Nhn dng v X l nh. Email: paphuong@yahoo.com