An efficient radical-based algorithm for stroke-order-free online kanji character recognition

Wenjie Cai, Seiichi Uchida, Hiroaki Sakoe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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 infra-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.

Original languageEnglish
Title of host publicationProceedings - 18th International Conference on Pattern Recognition, ICPR 2006
Pages986-989
Number of pages4
DOIs
Publication statusPublished - 2006
Event18th International Conference on Pattern Recognition, ICPR 2006 - Hong Kong, China
Duration: Aug 20 2006Aug 24 2006

Publication series

NameProceedings - International Conference on Pattern Recognition
Volume2
ISSN (Print)1051-4651

Other

Other18th International Conference on Pattern Recognition, ICPR 2006
Country/TerritoryChina
CityHong Kong
Period8/20/068/24/06

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'An efficient radical-based algorithm for stroke-order-free online kanji character recognition'. Together they form a unique fingerprint.

Cite this