Large scale on-line handwritten Chinese character recognition using improved syntactic pattern recognition

Author(s):  
K. Kuroda ◽  
K. Harada ◽  
M. Hagiwara
Author(s):  
Ning Bi ◽  
Jiahao Chen ◽  
Jun Tan

With the outstanding performance in 2014 at the ImageNet Large-Scale Visual Recognition Challenge 2014 (ILSVRC14), an effective convolutional neural network (CNN) model named GoogLeNet has drawn the attention of the mainstream machine learning field. In this paper we plan to take an insight into the application of the GoogLeNet in the Handwritten Chinese Character Recognition (HCCR) on the database HCL2000 and CASIA-HWDB with several necessary adjustments and also state-of-the-art improvement methods for this end-to-end approach. Through the experiments we have found that the application of the GoogLeNet for the Handwritten Chinese Character Recognition (HCCR) results into significant high accuracy, to be specific more than 99% for the final version, which is encouraging for us to further research.


Author(s):  
Xuhong Xiao ◽  
Ruwei Dai

Structural matching has been recognized as a promising approach for on-line Chinese character recognition. In order to reduce its great computational complexity and improve its performance, people have been seeking for ways to direct the matching of a whole character by the result of partial matching. In this paper, the authors proposed 45 basic components for 3,755 categories of daily-used Chinese characters to direct the stroke segment matching of whole characters. Since they are always located at either the beginning or the end of the stroke segment string of characters, these components are easy to be extracted and separated from other parts of a character. Besides, in our approach, the reference templates of these components are extracted dynamically from the corresponding segment string of characters when a specific matching is carried out. This strategy avoids building multiple templates for the components of the same kind but at different places of characters. The experiments show that the segment matching computation has been reduced greatly without reducing the correctness of matching.


Sign in / Sign up

Export Citation Format

Share Document