Optimal stroke-correspondence search method for on-line character recognition

Authors:
Jung-pil Shin
Affiliations:
Department of Computer Software, The University of Aizu, Tsuruga Ikki-machi Aizu-Wakamatsu City, Fukushima, Japan
Venue:
Pattern Recognition Letters
Year:
2002

Citing 3
Cited 1

Non-keyboard input of Japanese text on-line recognition of handwritten characters as the most hopeful approach

Journal of Information Processing
The State of the Art in Online Handwriting Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
On-Line Cursive Kanji Character Recognition Using Stroke-Based Affine Transformation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Online Recognition of Chinese Characters: The State-of-the-Art

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

This paper describes an optimal stroke-correspondence search method that makes possible stroke-order-free on-line character recognition. During the stroke-correspondence search process, conventional individual stroke-information regarding the shape and position of each stroke, and interstroke-information regarding the mutual relationships among strokes are both employed. The optimal path search for stroke-correspondence, being based on an optimal criterion including both intra- and interstroke-information, is systematically carried out. The reasonable level stroke-correspondence search is achieved partially by using the information regarding the actually occurring stroke-order, which does not hinder the framework of stroke-order-free recognition due to its use of statistically stable information. A large improvement in both computational time and recognition-accuracy were achieved in the current experiments.