Third International Conference on Document Analysis and Recognition (ICDAR'95) - Volume 2 On-line cursive Kanji character recognition as stroke correspondence problem Montr?al, Canada August 14-August 15 ISBN: 0-8186-7128-9
This paper describes a stroke-number and stroke-order free on-line Kanji character recognition method by a joint use of two complementary algorithms of optimal stroke correspondence determination: one dissolves excessive mapping and the other dissolves deficient mapping. Also, three kinds of inter-stroke distances are devised to deal with stroke concatenation or splitting and heavy shape distortion. Only a single reference pattern for each of 2,980 Kanji character categories is generated by using training data composed of 120 patterns written with the correct stroke-number and stroke-order. Recognition tests are made using the training data and two kinds of resting data in the square style and in the cursive style written by 36 different people; recognition rates of 99.5%, 97.6%, and 94.1% are obtained.
Index Terms:
optical character recognition; image segmentation; online cursive Kanji character recognition; stroke correspondence problem; complementary algorithms; optimal stroke correspondence determination; deficient mapping; inter-stroke distances; stroke concatenation; single reference pattern; training data
Citation:
T. Wakahara, A. Suzuki, N. Nakajima, S. Miyahara, K. Odaka, "On-line cursive Kanji character recognition as stroke correspondence problem," icdar, vol. 2, pp.1059, Third International Conference on Document Analysis and Recognition (ICDAR'95) - Volume 2, 1995 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||