An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition

Author

Cai, Wenjie ; Uchida, Seiichi ; Sakoe, Hiroaki

Author_Institution

Graduate Sch. of Inf. Sci. & Electr. Eng., Kyushu Univ., Fukuoka

Volume

2

fYear

0

fDate

0-0 0

Firstpage

986

Lastpage

989

Abstract

This paper investigates improvements of an online handwriting stroke-order analysis algorithm - cube search, based on cube graph stroke-order generation model and dynamic programming (DP). By dividing character into radicals, the model is decomposed into intra-radical graphs and an inter-radical graph. This decomposition considerably reduces the time complexity of stroke-order search DP. Experimental results showed an significant improvements in operational speed. Additionally, recognition accuracy was also improved by prohibiting unnatural stroke-order

Keywords

dynamic programming; handwritten character recognition; cube graph stroke-order generation model; cube search; dynamic programming; intra-radical graphs; online handwriting stroke-order analysis algorithm; radical-based algorithm; stroke-order search; stroke-order-free online Kanji character recognition; Algorithm design and analysis; Character generation; Character recognition; Dynamic programming; Information analysis; Information science; Joining processes; Search methods; Search problems; Speech recognition;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2006. ICPR 2006. 18th International Conference on

Conference_Location

Hong Kong

ISSN

1051-4651

Print_ISBN

0-7695-2521-0

Type

conf

DOI

10.1109/ICPR.2006.241

Filename

1699372