Science & Technology Development, Vol 14, No.

K2- 2011

Trang 62
NHN DNG CH VIT TAY DNG RT TRCH THNG TIN
THEO CHIU V MNG NRON
Hunh Hu Lc, Lu Quc Hi, inh c Anh V
Trng i hc Bch Khoa, HQG-HCM
(Bi nhn ngy 07 thng 12 nm 2010, hon chnh sa cha ngy 20 thng 04 nm 2011)
TM TT: Nhn dng ch vit tay l mt ti rt quan trng, n c nhng ng dng khc nhau
trong tnh bo, k thut robot,.... Bi bo co ny trnh by k thut nhn dng k t vit tay dng
phng php nhn dng da trn thng tin tnh. Phng php gm hai bc: lm mng nt k t gi
li b khung ca chng v nhng thng tin c trng c rt trch da trn b khung ny bng
phng php rt trch thng tin theo chiu. Mt khc, chng ta xy dng mng n-ron nhn to nhm
to ra c s d liu tri thc cho qu trnh nhn dng. Trong th nghim ca mnh, chnh xc ca gii
thut t trn 84% c ghi nhn da trn cc mu thu c trong thc t. Vi k thut ny, chng ta
c th thay th hoc kt hp vi cc phng php nhn dng trc tuyn thng c dng trn cc
thit b di ng v m rng vic nhn dng ln cc b mt khc nh giy vit, bng, bin s xe, cng
nh kh nng c ch cho robot.
T kha: nhn dng ch vit tay, mng nron
1. GII THIU
Nhn dng ch vit tay l mt ti rt
quan trng, n c nhng ng dng khc nhau
trong tnh bo, k thut robot,.... Cc nghin
cu v nhn dng ch vit tay c pht
trin t hn na thp k qua v t c nhiu
thnh qu thit thc.
mc khi nim, k thut nhn dng ch
vit tay c chia thnh hai phng php chnh
[1, 2]: nhn dng ch vit gin tip da trn
thng tin tnh (off-line handwriting
recognition)- chng trnh s thng dch cc k
t, cc ch hay cc on vn c vit trn cc
mu giy hoc cc cc b mt khc m chng
ta c th thu thp thng tin v chng thng qua
hnh nh thu c t cc b mt bng cch
chp li hnh nh v nhn dng ch vit trc
tip da trn thng tin ng (online
handwriting recognition)- nhn dng k t hoc
ch vit da trn thng tin thu c trong thi
gian thc ngay lc ngi dng thc hin hnh
ng vit, nhng thng tin l tc vit, p
lc khi vit v hng vit.
Hng tip cn ca ti l nhn dng
da trn thng tin tnh. Mc d phng php
nhn dng trc tip ang c p dng rng ri
trn cc thit b di ng, nhng nhn dng tnh
li c nhng u im khc. Phng php ny
khng dng li vic ng dng v hon thin
trn cc thit b di ng, m cn c kh nng
m rng sang cc ng dng khc nh c cc
vn bn vit trn giy cng nh ng dng vo
kh nng c v hiu ch ca robot.
TAP CH PHAT TRIEN KH&CN, TAP 14, SO K2 - 2011
Trang 63
u tin chng ta dng gii thut lm
mng nt k t gi li b khung k t, loi
b cc thng tin d tha v hnh dng ca k t.
Sau , nhng thng tin c trng c rt
trch da trn b khung ny bng phng php
rt trch thng tin theo chiu v kt hp nhng
vct c im cc b vi cc thng tin v cu
trc ton cc s nhn dng ch vit. Tip theo,
chiu ca cc phn on thng to nn cc k
t c d tm, cc pixel c thay th bng
cc gi tr chiu thch hp. Cui cng, cc c
im ca k t c hun luyn v phn loi
bi mng n-ron. Cc phn cn li trong bi
bo co c t chc nh sau: phn hai, chng
ta khi qut mt s bc thng thng ca mt
h thng nhn dng ch vit tay. Thut gii s
c th hin trong phn ba. Phn bn trnh
by nhng th nghim v kt qu thu c.
Nhng tho lun v nh gi hiu qu ca gii
thut s c trnh by phn nm.
2. NHNG NT C TRNG CA H
THNG NHN DNG CH VIT TAY
Nhn dng ch vit tay thng bao gm
nm giai on: tin x l (preprocessing), phn
mnh (segmentation), biu din
(representation), hun luyn v nhn dng
(training and recognition), hu x l
(postprocessing) [1, 3, 5].
(i) Tin x l: gim nhiu cho cc li trong
qu trnh qut nh, hot ng vit ca con
ngi, chun ha d liu v nn d liu.
(ii) Phn mnh: chia nh vn bn thnh
nhng thnh phn nh hn, phn mnh cc t
trong cu hay cc k t trong t.
(iii) Biu din, rt trch c im: giai
on ng vai tr quan trng nht trong nhn
dng ch vit tay. trnh nhng phc tp ca
ch vit tay cng nh tng cng chnh xc,
ta cn phi biu din thng tin ch vit di
nhng dng c bit hn v c ng hn, rt
trch cc c im ring nhm phn bit cc k
t khc nhau.
(iv) Hun luyn v nhn dng: phng
php in hnh so trng mu, dng thng k,
mng n-ron tr tu nhn to hay dng phng
php kt hp cc phng php trn.
(v) Hu x l: s dng cc thng tin v
ng cnh gip tng cng chnh xc,
dng t in d liu.

Hnh 2.1. H thng nhn dng

Hnh 2.2.Lm mng hnh nh
Hnh 2.1 m t qu trnh trong h thng
nhn dng. S gm hai phn chnh: ng
lin nt m t cc bc hun luyn cho my
Science & Technology Development, Vol 14, No.K2- 2011

Trang 64
hc, ng t nt m t cc bc trong qu
trnh nhn dng:
(i) Ban u cc hnh nh ny i qua giai on
chuyn nh v dng nh nh phn (giai on
tin x l). nh s c lu tr di dng ma
trn im, v tr pixel c nt v s mang gi tr
1, ngc li c gi tr 0. Sau , nh c ct
xn k t nm trn trong mt khung ch
nht, cc vng khng gian khng c nt v
c loi b i. Gii thut ct xn hin thc
n gin da trn nh nh phn v thu gim nh
c ct xn v mt nh c kch thc
chung c quy nh trc.
(ii) Tip theo, nh c ct xn v thu nh
c lm mng. Qu trnh lm mng ny gip
ta ch ly nhng thng tin cn thit v hnh
dng ca k t v loi b cc pixel d tha.
Hnh 2.2 minh ha cho kt qu lm mng ca
gii thut. Cc chm nh trn hnh biu th cc
pixel c gi tr 1 ban u. Sau khi lm mng,
ch nhng pixel c ngha c gi li, v
chng c biu din bng cc chm to trong
hnh.
(iii) nh sau qu trnh lm mng cha hu ht
cc thng tin v hnh dng ca k t. Nhng
thng tin ny s c phn tch rt trch ra
cc c im gip vic phn loi cc k t vi
nhau. Phng thc ny da trn thng tin v
hnh dng ca k t nh s chuyn v tr v s
chuyn chiu. Kt qu qu trnh ny l cc vc-
t c im cha thng tin v k t. Cc thng
tin ny gip my ly c cc c im ca
tng k t, phn loi chng v to ra cc thng
tin cn thit nhn dng cc k t c chung
ngha. Do ch vit mi ngi mi khc nn ta
khng th thu thp tt c cc nt ch ca tng
ngi my hc c th nhn din m ch c
th da trn mt s mu no nhn ra cc
nt ch ca nhng ngi vit khc nhau. Mng
n-ron nhn to (Artificial neural networks) c
th gii quyt vn ny.
(iv) Xy dng mng n-ron ng ngha vi
vic thit lp cc thng s thch hp trong
mng gip mng c th phn bit c cc
k t c trong v ngoi mu. Cc thng s ca
mng n-ron s c lu li v gip cho qu
trnh nhn dng. Sau mt lot cc giai on
trn, chng ta s thu c nhng thng s cn
thit ca mng n-ron, v n gip h thng
phn bit c cc k t vit tay. V qu trnh
nhn dng c trnh by phn sau s dng
nhng kt qu t qu trnh my hc gip h
thng phn bit cc k t.
3. GII THUT NHN DNG CH VIT
TAY
Trong khun kh ti nghin cu ny,
thay v s dng nh trong tp hp mu cho
trc, chng ta s dng nh thu c t ngi
dng chng trnh v. nh ny qua cc bc
tin x l cng nh rt trch c im trong
qu trnh hun luyn. Mt khc, thay v cc
vc-t c im c a vo giai on hun
luyn, cc vc-t ny s c a vo giai
on nhn dng. Giai on ny s dng cc
thng s ca mng n-ron, cc vc-t c im
s c a qua mng n-ron v tr v vc-t
xut. Vc-t xut ch ra bit k t va v c
ngha g.
TAP CH PHAT TRIEN KH&CN, TAP 14, SO K2 - 2011
Trang 65
Trong phng php ny, chng ta chia cu
trc ca gii thut thnh hai qu trnh vi cc
giai on theo trnh t sau:
- Qu trnh hun luyn: nh mu, nh nh
phn, ct xt v thu nh, lm mng nh, rt
trch c im, xy dng mng n-ron.
- Qu trnh nhn dng: nh k t, nh nh
phn, ct xt v thu nh, lm mng nh, rt
trch c im, nhn dng.
3.1.Gii Thut Lm Mng Nt V Ca K
T
Nh trnh by phn 2, gii thut lm
mng nm trong giai on tin x l vi mc
ch loi b cc thng tin d tha v hnh dng
ca k t. Cc nt v c lm mng thng i
km vi s mo m v bin dng. S mo m
cng t cng tt. Chng ta dng gii T.Y.
Zhang [4] lm gim s mo m v tng tc
tnh ton. Gii thut ny ch ti cc pixel ln
cn ca mt pixel bt k. Bng 3.1 m t cc
pixel ln cn ca pixel P
1
(i, j).
Bng 3.1.Cc pixel ln cn ca mt pixel
P
9
(i-1, j-1) P
2
(i-1, j) P
3
(i-1, j+1)
P
8
(i, j-1) P
1
(i, j) P
4
(i, j+1)
P
7
(i+1, j-1) P
6
(i+1, j) P
5
(i+1, j+1)
Mc tiu ca gii thut l loi b cc im
bao quanh hnh v gi li cc im nm trong
b khung. gi gn lin kt gia cc im
trong b khung, chng ta chia vng lp ln
thnh hai vng lp nh (vng lp qua tng
im mt).
Vng lp th nht s xa cc im bao
quanh tha cc iu kin sau:
(a) 2 B(P
1
) 6
vi B(P
1
): s cc im ln cn khc 0 ca
im P
1
.
B(P
1
) = P
2
+ P
3
+ P
4
+ P
5
+ P
6
+ P
7
+ P
8
+
P
9

(b) A(P
1
) = 1
vi A(P
1
): s mu (P
i
, P
j
) = (0, 1) theo th
t c sp xp nh sau P
2
, P
3
, P
4
, , P
9
.
Chn hn, chui P
2
, , P
9
= 00100100 th
ta c A(P
1
) = 2.
(c) P
2
* P
4
* P
6
= 0
(d) P
4
* P
6
* P
8
= 0
Trong vng lp th hai, chng ta xa cc
im tha hai iu kin a) v b) ca vng lp
th nht v tha thm hai iu kin na:
(c) P
2
* P
4
* P
8
= 0
(d) P
2
* P
6
* P
8
= 0
Trong hai iu kin (c) v (d) ca vng lp
th nht, ch xa cc ng bin pha ng
Nam hay cc gc pha Ty Bc, c th quan
st qua hnh 3.1:











Science & Technology Development, Vol 14, No.K2- 2011

Trang 66
Bc
P
2

P
3
P
1
P
4


Ty
P
6


ng
Nam
Hnh 3.1. Biu din cc pixel ln cn
Tng t, cc im b xa vng lp th
hai, iu kin (c) v (d) l cc im ng
bin pha Ty Bc hoc cc gc pha ng
Nam.
iu kin (a) s gi li cc im l im
kt thc ng khung. iu kin (b) gip ta
trnh khi xa cc im nm gia cc im kt
thc.
3.2.Phng Php Rt Trch c im
K thut rt trch c im (modified
direction feature- MDF) da trn c im v
cu trc ca ch vit tay [4]. K thut ny kt
hp nhng vc-t c im cc b vi cc
thng tin v cu trc ton cc v cung cp c
im tch hp cho mng n-ron hun luyn v
kim tra. Hng tip cn ny x l da vo
ng bin ca k t. Trong phng php,
chng ta xut s dng b khung, kt qu ca
qu trnh lm mng, thay cho ng bin. u
im ca ci tin ny khng nhng lm gim
thi gian thi hnh ca gii thut m cn a ra
cc c im chnh xc hn. Tip theo, chiu
ca cc phn on thng to nn cc k t
c d tm v cc pixel c thay th bng
cc gi tr chiu thch hp. Cui cng, cc c
im ca k t c hun luyn v phn loi
bi mng n-ron. Gii thut gm hai bc
chnh: ly gi tr v chiu v cc c im v
chiu c thay i.
3.2.1.Ly Gi Tr Chiu
[3] xut mt phng php ly gi tr
chiu (Obtaining Direct Values). D liu a
vo bc ny l nh nh phn c lm
mng. Cc gi tr v chiu c quy nh nh
sau: value = 2 cho chiu dc, value = 4 cho
chiu ngang, value = 3 cho ng cho phi,
value = 5 cho ng cho tri v value = 1 cho
im bt u nh hnh 3.2.

Hnh 3.2. Gi tr chiu cho MDF
u tin, chng ta i tm im bt u.
im bt u c nh ngha l pixel u tin
mu en (mang gi tr 1) c tm thy ti v tr
di nht v tri nht ca nh k t. im ny
s c gn gi tr value = 8.
TAP CH PHAT TRIEN KH&CN, TAP 14, SO K2 - 2011
Trang 67
Tip theo, ta phn bit tng phn on
thng ring bit. Gii thut thu thp tng pixel
mt v da vo chiu trc ca n, n
chuyn i gi tr ca cc pixel ny ng thi
kim tra iu kin c on thng mi. Nu mt
trong nhng iu kin sau c gp, ta xem l
mt on thng mi c tm thy. Cc iu
kin c din t nh sau:
- Tm c im gc: im ngay ti c
s thay i tc thi v chiu. C tm trng
hp im gc nh hnh 3.3:

Hnh 3.3. Cc trng hp im gc
- i chiu 3 ln.
- C s i chiu, chiu ca pixel trc
lin tc ging nhau v chiu di ca chiu
trc ca chui lin tc ny ln hn 3.
Sau khi cp nht cc gi tr chiu cho
tng pixel, cc gi tr ny s c chun ha
(chun ha cc gi tr chiu). C ba bc
chun ha cc gi tr v chiu trong mt on
thng:
(i) Tm nhng gi tr chiu no thng
xut hin nht trong on thng cn chun ha
bng cch dng phng php m thng
thng xc nh gi tr chiu no xut hin
nhiu nht trong on thng.
(ii) Thay th tt c cc gi tr chiu ca cc
pixel trong mt on thng bng gi tr chiu
c xut hin nhiu nht trong on thng .
(iii) Thay th gi tr ca im bt u
(value = 8) bng gi tr chiu c tn sut xut
hin nhiu nht trong on thng.
Hnh 3.4 biu din vic tnh gi tr chiu
v chun ha cho k t a. Trong hnh ny,
chng ta thy rng cc gi tr chiu ng vi cc
ng nt tng ng c chun ha.

Hnh 3.4. Tnh gi tr chiu cho k t a
3.2.2.Ly Gi Tr MDF
K thut ly gi tr MDF (Obtaining
Modified Direction Feature) c xy dng
da trn k thut Direction Feature (DF) v
Transition Feature (TF). Trong k thut ny,
chng ta tnh gi tr ca vc-t c im da
trn gi tr chiu [LT, DT] v s chuyn t gi
tr pixel = 0 sang gi tr pixel = 1, trong
(i) LT (Location Transition): gi tr nh
du nhng v tr m c s chuyn t pixel = 0
sang pixel = 1. Gi tr LT c tnh bng cch
qut tng hng t tri sang phi v ngc li,
qut cc ct t trn xung di v ngc li.
LT = (v tr chuyn t 0 sang 1) / ( di
ca mi chiu)
(ii) DT (Direction Transition): tnh ton
da trn cc gi tr v chiu c phn tch.
Trong , s phn t trong vc-t DT c xc
Science & Technology Development, Vol 14, No.K2- 2011

Trang 68
nh trc, y chn l 3, v mi phn t l
gi tr chiu ti mi im c s chuyn pixel t
0 sang khc 0 (nonzero).
(iii) Chun ha vc-t: tnh gi tr trung
bnh ca ba vc-t LT hoc DT lin tip nhau.
Hnh 3.5 biu din cch tnh LT v DT in
hnh nh sau:

Hnh 3.5. Cch tnh LT v DT in hnh
3.3.S Dng Mng N-Ron Hun
Luyn V Nhn Dng
Mng n-ron cung cp mt hng tip cn
mnh cho cc gi tr thc xp x, gi tr ri rc
hay cc vc-t gi tr. Trong nhiu dng ca
vn , mng n-ron nhn to l mt trong
nhng phng php my hc hiu qu hin
nay. Trong phn nghin cu ca mnh, k thut
mng n-ron truyn ngc (back-propagation),
mt trong nhng phng php hiu qu trong
trong nhiu bi ton, thch hp bi ton nhn
dng ch vit tay ca chng ta.
Trong gii thut cp trn, mng n-ron
gip xy dng mt tp c s d liu t vic
hun luyn cc tp mu c sn. C s d liu
ny c dng trong nhn dng k t t cc
c im phn tch c.
4. KT QU TH NGHIM
Trong khun kh ca bi nghin cu,
chng ta s dng tp khng gian mu cho qu
trnh hc my bi mng n-ron c kch thc
500 mu, c ly mu t 500 ngi khc
nhau. Mi mu l 26 file tng ng vi 26 k
t Latin. Mt s k t mu c thu thp nh
sau:

K t a K t h K t i K t j K t o

K t q K t s K t t K t w K t z
Hnh 4.1. Mt s k t mu
Giao in chng trnh c th hin
trong hnh bn di (hnh 4.2)

Hnh 4.2. Giao in chng trnh
Chng ta s thi hnh phng php nhn
dng ch vit c trnh by phn 3 trn
nhiu ngi dng khc nhau. Trong bi bo co
ny, chng ta ch nu ra mt vi kt qu minh
ha. Sau y l bng kt qu khi tin hnh th
nghim trn 5 user khc nhau:


TAP CH PHAT TRIEN KH&CN, TAP 14, SO K2 - 2011
Trang 69
Bng 4.1.Mt s kt qu chnh xc ca
chng trnh
S trng
hp
User 1 User
2
User
3
User
4
User
5
ng 21 25 22 23 23
Sai 5 1 4 3 3
Cc
trng
hp sai



chnh
xc (%)
80,7 96,1 84.6 88.5 88.5
Qu trnh kim tra tin hnh kim nghim
trn nhiu ngi dng khc nhau. Mi ngi
dng s s dng phn mm vit 26 k t v
chng trnh chy kt qu nhn dng, chnh
xc trung bnh thu c l 84% v thi gian
nhn dng trung bnh l 0.84ms.
5. KT LUN
Trong bi bo co ny, chng ta pht trin
mt k thut nhn dng k t vit tay dng
phng php nhn dng da trn thng tin tnh.
Phng php gm hai bc: lm mng nt k
t gi li b khung ca chng v nhng
thng tin c trng c rt trch da trn b
khung ny bng phng php rt trch thng
tin theo chiu. Mt khc, chng ta xy dng
mng n-ron nhn to nhm to ra c s d
liu tri thc cho qu trnh nhn dng. Khng
ging nh nhng phng php khc, phng
php chng ta xut s dng b khung, kt
qu ca qu trnh lm mng, thay cho ng
bin. u im ca s ci tin ny khng nhng
lm gim thi gian thi hnh ca gii thut m
cn a ra cc c im chnh xc hn. Mt
khc, thay v cc vc-t c im c a vo
giai on hun luyn, cc vc-t ny s c
a vo giai on nhn dng.
Bn cnh nhng u im trn, gii thut
lm mng khng ph hp ch vit ch qu
nh, cc nt vit c th dnh t nt ny qua nt
khc. Do , gii thut c th lm mt thng tin
ca nh. Khi chun ha cc gi tr v chiu,
mt s trng hp chun ha khng tr v cc
gi tr mong mun, lm sai lch thng tin thc
v nt v. Chng trnh phi hun luyn trn
hng ngn mu k t khc nhau. Do s mu
c hun luyn qu t, khng th nh gi xc
thc c chnh xc ca chng trnh mt
cch tuyt i. Hng pht trin sp ti ca
nhm nghin cu l tng cng v b sung
thm mt s cc c im khc cn phi rt
trch tng tin cy v lu nhng thng tin
chnh xc hn v c trng ca k t. Mt
khc, nhm p dng mt s phng php ci
tin trong mng n-ron tng tin cy cho
mng.

Science & Technology Development, Vol 14, No.K2- 2011

Trang 70
MODIFIED DIRECTION FEATURE AND NEURAL NETWORK BASED
TECHNIQUE FOR HANDWRITING CHARACTER RECOGNITION
Huynh Huu Loc, Luu Quoc Hai, Dinh Duc Anh Vu
University of Technology, VNU-HCM
ABSTRACT: Handwriting character recognition is an important research topic which has
various applications in surveillance, radar, robot technology... In this paper, we propose the
implementation of the handwriting character recognition using off-line handwriting recognition. The
approach consists of two steps: to make thin handwriting by keeping the skeleton of character and reject
redundant points caused by humams stroke width and to modify direction method which provide high
accuracy and simply structure analysis method to extract characters features from its skeleton. In
addition, we build neural network in order to help machine learn character specific features and create
knowledge databases to help them have ability to classify character with other characters. The
recognition accuracy of above 84% is reported on characters from real samples. Using this off-line
system and other parts in handwriting text recognition, we can replace or cooperate with online
recognition techniques which are ususally applied on mobile devices and extend our handwriting
recognition technique on any surfaces such as papers, boards, and vehicle lisences as well as provide
the reading ability for humanoid robot.
TI LIU THAM KHO

[1]. Nafiz Arica and Fatos T. Yarman-
Vural, An Overview of Character
Recognition Focused on Off-Line
Handwriting, in IEEE Transactions on
Systems, Man, And CyberneticsPart C:
Applications And Reviews, Vol. 31, No. 2,
May 2001.
[2]. M.Blumenstein, X.Y. Liu, B. Verma,
A modied direction feature for cursive
character recognition, International Joint
Conference on Neural Networks (IJCNN
04), Budapest, Hungary, 2004, pp. 2983
2987.
[3]. M.Blumenstein, B.K.Verma, H.Basli,
A novel feature extraction technique for
the recognition of segmented handwritten
characters, Seventh International
Conference on Document Analysis and
Recognition, 2003, pp. 137141.
[4]. T.Y.Zhang and C.Y.Suen, A Fast
Parallel Algorithm for Thinning Digital
Patterns, in Image Processing and
Computer Vision. Volume 27 , March
1984, pp 236 - 239
[5]. R.M.Bozinovic and S. N. Srihari, Off-
line cursive script word recognition, IEEE
Trans. Pattern Anal. Machine Intell, Vol
11, 1989