Recognition of handwritten Chinese characters via short line segments
作者:
Highlights:
•
摘要
A system to recognize handwritten Chinese characters is presented. In the first stage, short line segments are extracted, where a new efficient algorithm is proposed, based on accumulated chain codes, for line approximation. In the feature extraction stage, features of each character are computed, which are further defined by the features of its composing line segments. In the matching stage, dynamic programming is first used to calculate the similarity between a segment of the input character and a segment of the reference character, and then the similarity between the two characters is computed. In order to reduce the number of candidates, a coarse classification algorithm is proposed. The recognition rate for 150 characters is about 90%, excluding the error in coarse classification.
论文关键词:Structural matching,Dynamic programming,Thinning,Line approximation,Optical character recognition
论文评审过程:Received 10 January 1991, Revised 15 July 1991, Accepted 10 September 1991, Available online 19 May 2003.
论文官网地址:https://doi.org/10.1016/0031-3203(92)90052-K