TP CH KHOA HC, i hc Hu, S 53, 2009

MT S PHNG PHP TRCH CHN C TRNG HIU QU

CHO BI TON NHN DNG CH VIT TAY RI RC

ng

Tr

Ph m Anh Ph ng
i h c Khoa h c, i h c Hu

TM TT
Trch ch n c tr ng l m t m t xch r t quan tr ng nh h ng tr c ti p n ch t
l ng c a m t h th ng nh n d ng. Bi bo ny so snh m t s ph ng php trch ch n c
tr ng n gi n nh ng hi u qu , c th p d ng cho bi ton nh n d ng ch vi t tay r i r c.
Cc k t qu th c nghi m trn t p d li u ch s vi t tay MNIST cho th y m t s
c tr ng m
c cng b
[9].
chng ti l a ch n cho chnh xc cao h n so v i cc k t qu

I. Gii thiu

Nhn dng ch vit tay ang l vn thch thc ln i vi cc nh nghin cu.

Cho n nay, bi ton nhn dng ch vit tay vn cha c c mt gii php tng th.
Cc kt qu ch yu ch tp trung trn cc tp d liu ch s vit tay chun nh USPS
v MNIST [4,5,8,9], bn cnh cng c mt s cng trnh nghin cu trn cc h ch
ci ting La tinh, Hy Lp, Trung Quc, Vit Nam... tuy nhin cc kt qu cng ch gii
hn trong mt phm vi hp [2,7,10].

Trong lnh vc nhn dng, vn trch chn c trng l mt bc rt quan

trng, n c nh hng ln n cht lng cng nh tc ca mt h thng nhn dng.
Trch chn c trng nh th no vn m bo khng mt mt thng tin v/hoc thu
gn kch thc ca d liu u vo l iu m nhiu nh nghin cu ang quan tm.
Trong bi bo ny, chng ti ci t th nghim v so snh mt s phng php trch
chn c trng cho bi ton nhn dng ch vit tay ri rc. M hnh nhn dng ca
chng ti c xy dng trn c s phng php vc t ta (SVM Support Vector
Machines), y l mt phng php my hc tin tin c nhiu thnh cng trong cc
lnh vc khai ph d liu cng nh nhn dng [3,6].
Phn cn li ca bi bo ny c cu trc nh sau: Phn 2 trnh by kin trc ca
m hnh nhn dng ch vit tay ri rc. Phn 3 trnh by mt s phng php trch chn
c trng c th p dng cho ch vit tay. Phn 4 trnh by mt s kt qu thc nghim
trn tp d liu ch s vit tay MNIST. Cui cng l phn kt lun.
II. Kin trc ca m hnh nhn dng

Trong m hnh nhn dng (hnh 1), cng on tin x l bao gm cc chc nng
lc nhiu v chun ha nh u vo. Vic chun ha nh bao gm cc bc sau:
73

Bc 1: Chuyn i nh u vo sang nh trng en.

Bc 2: Tm hnh ch nht R b nht cha cc im en trn nh.

Bc 3: Ly vng nh I nm trong vng hnh ch nht R.

Bc 4: Chun ha kch thc nh I thnh 1616.

Hu n
luy n

M hnh
hu n luy n
SVM

Nh n
d ng

K t qu
nh n
d ng

Trch
ch n c

D li u
nh n
d ng

Ti n
x l

D li u
hu n
luy n

Hnh 1: M hnh nh n d ng ch vi t tay r i r c

M hnh phn lp c xy dng t cc SVM 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 [9].
Trong m hnh nhn dng hnh 1, bi bo ny ch tp trung vo giai on trch
chn c trng nh gi mt s loi c trng c s dng cho bi ton nhn ch
vit tay. Phn tip theo, chng ti s trnh by mt s phng php trch chn c trng
n gin, c th p dng cho vic nhn dng k t vit tay ri rc.
III. Mt s phng php trch chn c trng

Trong phn ny, chng ti s gii thiu mt s phng php trch chn c trng
n gin nhng hiu qu, c th p dng cho cc tp d liu ch vit tay ri rc.
3.1. Trng s vng (Zoning)

c tr ng tr ng s vng

74

Hnh 2. Trch ch n

nh k t c chia thnh NN vng (zones). Tng s im en ca mi vng

s c chn to thnh vc t c trng.

Trong thc nghim, vi nh kch thc 1616, chng ti chn N=8, nh vy c

88 = 64 c trng.
3.2. Biu chiu (Projection histograms)

tng c bn ca phng php trch chn c trng ny l chiu cc im en

trn nh 2 chiu theo cc hng ngang, dc v hai ng cho thnh mt dy cc tn
hiu 1 chiu. u im ca cc c trng ny l khng ph thuc vo nhiu, tuy nhin
n vn ph thuc vo nghing ca ch.

chi u ngang, d c v 2

ng cho

Hnh 3. Trch ch n cc bi u

Trong thc nghim, vi nh kch thc 1616, chng ti chn 16 ngang + 16

dc + 231 cho = 94 c trng.
3.3. Trch chn chu tuyn (Contour profiles)

Hnh 4. Trch ch n cc kh i bn ngoi c a ch

Phn c trch chn l khong cch t bin ca khung cha nh ti im en

u tin ca ch trn cng 1 dng qut. Phng php trch chn ny m t tt cc khi
bn ngoi ca ch v cho php phn bit mt s lng ln cc k t.

Trong thc nghim, vi nh kch thc 1616, c 16 tri + 16 phi + 16 trn +

16 di = 64 c trng.
75

3.4. Trch chn c trng wavelet Haar

Chng ti s dng tng ca phng php trch chn c trng wavelet Haar
[1] chn tp c trng cho mi nh k t u vo.

T nh nh phn kch thc 2n2n (Hnh 5), qu trnh trch chn c trng c
m t theo thut ton sau:
Procedure HaarFeature
Input Ma trn vung (A,n) cp 2n.

Tp cc c trng {F1, F2,..., F2n 2n }.

Output
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)
{

Chia nh thnh 4 phn: A1, A2, A3, A4;

for (j=1; i 4; j++)

PUSH((Aj,n div 2), Queue);

}

- Gi S1, S2, S3, S4 l tng cc im en tng ng vi A1, A2,

A3, A4;
- Tnh Fi+1 = S1 + S2;
Fi+2 = S2 + S3;
Fi+3 = S4;
- i = i + 3;
}

76

c tr ng wavelet Haar

Hnh 5. Trch ch n

Tnh bt bin ca c trng ny c chng minh trong [8].

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.

c tr ng wavelet Haar

Hnh 6. Dy

Phng php trch chn c trng ny 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 (Hnh 6).
IV. Kt qu thc nghim

Chng ti ci t v thc nghim trn tp d liu ch s vit tay MNIST. Tp

d liu MNIST bao gm 60.000 mu hun luyn v 10.000 mu khc nhn dng, mi
mu l mt nh xm kch thc 2828 (Hnh 7).

Hnh 7. Cc m u ch s vi t tay trch t t p d li u MNIST

77

Chng ti s dng m hnh SVM a lp theo chin lc OVO, chn hm nhn

RBF( = 0,05) vi cc phng php trch chn c trng khc nhau trn tp d liu
MNIST (xem Bng 1).

S c trng

c trng

c tr ng khc nhau

B ng 1. K t qu nh n d ng trn t p d li u MNIST v i cc

chnh xc

Ma trn nh phn [9]

256

97,2%

Zone 22

64

97,9%

Projection

94

97,0%

Contour Profile

64

95,5%

Haar wavelet

256

97,8%

Kt qu bng 1 cho thy s dng cc c trng Zone 22 v Haar wavelet t

chnh xc cao hn khi s dng c trng ma trn nh phn [9]. Vic s dng cc c
trng Projection v Contour Profile t chnh xc khng cao bng [9] nhng s dng
s lng c trng t hn nhiu, v vy tc nhn dng cng tng ln ng k.
V. Kt lun

Bi bo xut mt m hnh nhn dng ch vit tay ri rc da trn c s

phng php vc t ta kt hp vi mt s phng php trch chn c trng n gin
nhng hiu qu cho vic nhn dng ch vit tay ri rc. Cc kt qu thc nghim cho
thy cc c trng c la chn p dng vo bi ton nhn dng ch vit tay ri rc
t chnh xc tng i cao. Vic s dng cc c trng Zone 22, Projection v
Contour Profile lm gim bt kh nhiu kch thc ca d liu u vo, lm tng tc
ca h thng nhn dng.
Khi s dng phng php vc t ta th kt qu ca vic phn lp lun xp x
ngng ti u, v vy cht lng ca h thng nhn dng ph thuc rt nhiu vo vic
x l d liu u vo. Bi bo ny ch mi quan tm n cc phng php trch chn
c trng cho d liu ch vit tay. Trong tng lai, chng ti s tip tc nghin cu tip
cc cng on tin x l chun ha d liu u vo tt hn nhm nng cao chnh
xc ca h thng nhn dng.
TI LIU THAM KHO
1. 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,
(2001), 511518
2. L Hoi B c, L Hong Thi, Neural Network & Genetic Algorithm in Application to
Handwritten Character Recognition, T p ch Tin h c v i u khi n h c, T p 17, s 4,
(2001), 57- 65

78

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, 2004.
5. Cakmakov D., Gorgevik D., Handwritten Digit Recognition Using Classifier
Cooperation Schemes, Proceedings of the 2nd Balkan Conference in Informatics, BCI,
Ohrid, (2005), 23-30
6. Ph m Anh Ph ng, Ng Qu c T o, L ng Chi Mai, ng d ng SVM cho bi ton phn
l p nh n d ng, K y u H i th o khoa h c Qu c gia l n th ba v nghin c u, pht
tri n v ng d ng Cng ngh thng tin v Truy n thng (ICT.rda06), nh xu t b n
Khoa h c v K thu t, H N i, (2006), 393- 400.

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), ISBN: 978-0-88986-646-1, Innsbruck, Austria, (2007), 197-202.
8. Ph m Anh Ph ng, Ng Qu c T o, L ng Chi Mai, Trch ch n c tr ng wavelet
Haar k t h p v i SVM cho vi c nh n d ng ch vi t tay ti ng Vi t, T p ch Cng ngh
Thng tin v Truy n thng, ISSN 0866-7039, k 3, s 20, (2008), 36-42.

9. Ph m Anh Ph ng, p d ng m t s chi n l c SVM a l p cho bi ton nh n d ng

ch vi t tay h n ch , T p ch khoa h c i h c Hu , ISSN 1859-1388, s 45, (2008),
109-118.

10. Pham Anh Phuong, Ngo Quoc Tao, Luong Chi Mai, An Efficient Model for Isolated
Vietnamese Handwritten Recognition, The Fourth International Conference on
Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008),
Harbin, China, August 15 17, (2008), 358-361.

SOME EFFICIENT FEATURE EXTRACTION METHODS FOR

ISOLATED HANDWRITTEN RECOGNITION
Pham Anh Phuong
College of Sciences, Hue University

SUMMARY
The feature extraction is an important phase in a handwritten recognition system. This
paper presents some efficient feature extraction methods for isolated handwritten recognition.
Our experiments on the benchmark databases MNIST show that selected feature extraction
methods can be successfully used to handwritten recognition with high exact rates.
79