18th International Conference on Pattern Recognition (ICPR'06) Volume 2 An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition Hong Kong August 20-August 24 ISBN: 0-7695-2521-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.241
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.
Citation:
Wenjie Cai, Seiichi Uchida, Hiroaki Sakoe, "An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition," icpr, vol. 2, pp.986-989, 18th International Conference on Pattern Recognition (ICPR'06) Volume 2, 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||