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

Wenjie Cai, Seiichi Uchida, Hiroaki Sakoe

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

6 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルProceedings - 18th International Conference on Pattern Recognition, ICPR 2006
ページ986-989
ページ数4
DOI
出版物ステータス出版済み - 12 1 2006
イベント18th International Conference on Pattern Recognition, ICPR 2006 - Hong Kong, 中国
継続期間: 8 20 20068 24 2006

出版物シリーズ

名前Proceedings - International Conference on Pattern Recognition
2
ISSN(印刷物)1051-4651

その他

その他18th International Conference on Pattern Recognition, ICPR 2006
中国
Hong Kong
期間8/20/068/24/06

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture

フィンガープリント An efficient radical-based algorithm for stroke-order-free online kanji character recognition' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Cai, W., Uchida, S., & Sakoe, H. (2006). An efficient radical-based algorithm for stroke-order-free online kanji character recognition. : Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006 (pp. 986-989). [1699372] (Proceedings - International Conference on Pattern Recognition; 巻数 2). https://doi.org/10.1109/ICPR.2006.241