By Topic

A probabilistic stroke-based Viterbi algorithm for handwritten Chinese characters recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen-Chiung Hsieh ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Hsi-Jian Lee

This paper presents a probabilistic approach to recognize handwritten Chinese characters. According to the stroke writing sequence, strokes and interleaved stroke relations are built manually as a 1D string, called online models, to describe a Chinese character. The recognition problem is formulated as an optimization process in a multistage directed graph, where the number of stages is the length of the modelled stroke sequence. Nodes in a stage represent extracted strokes. The Viterbi algorithm, which can handle stroke insertion, deletion, splitting, and merging, is applied to compute the similarity between each modelled character and the unknown character. The unknown character is recognized as the one with the highest similarity. Experiments with 500 characters uniformly selected from the database CCL/HCCR1 are conducted, and the recognition rate is about 94.3%

Published in:

Pattern Recognition, 1992. Vol.II. Conference B: Pattern Recognition Methodology and Systems, Proceedings., 11th IAPR International Conference on

Date of Conference:

30 Aug-3 Sep 1992