End-point preserved stroke extraction

The stroke is a very important feature for a character and is helpful for word recognition and handwriting identification. Although thinning algorithms can be applied for stroke extraction, they always suffer from the problems of bifurcation and disconnection. Moreover, since the end points of strokes cannot be preserved by thinning, the stroke length cannot be accurately determined and the start and the end parts of a stroke, which are useful for identifying the writing habit of a person, are hard to be extracted explicitly. In this paper, we proposed a very accurate stroke extraction algorithm which can well preserve the ends of strokes. Simulations on some Chinese characters show that the proposed algorithm is reliable and can precisely extract the strokes of characters.

[1]  Lei Huang,et al.  An improved parallel thinning algorithm , 2003, 2016 International Conference on Wavelet Analysis and Pattern Recognition (ICWAPR).

[2]  Xiaohui Liang,et al.  Triangular Mesh Based Stroke Segmentation for Chinese Calligraphy , 2013, 2013 12th International Conference on Document Analysis and Recognition.

[3]  Wang Qi,et al.  An Algorithm of Thinning on Character Skeleton , 2013, 2013 International Conference on Computational and Information Sciences.

[4]  Nafiz Arica,et al.  An overview of character recognition focused on off-line handwriting , 2001, IEEE Trans. Syst. Man Cybern. Syst..

[5]  Jhing-Fa Wang,et al.  A novel stroke extraction method for Chinese characters using Gabor filters , 2003, Pattern Recognit..

[6]  Yuan Yan Tang,et al.  Stroke extraction and stroke sequence estimation on signatures , 2002, Object recognition supported by user interaction for service robots.

[7]  Yan Tang,et al.  An effective stroke extraction model for Chinese characters , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[8]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[9]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[10]  Ching Y. Suen,et al.  A fast parallel algorithm for thinning digital patterns , 1984, CACM.

[11]  Jin Hyung Kim,et al.  Model-based stroke extraction and matching for handwritten Chinese character recognition , 2001, Pattern Recognit..

[12]  Bence Kovari Time-efficient stroke extraction method for handwritten signatures , 2007 .