Segmenting handwritten Chinese characters based on heuristic merging of stroke bounding boxes and dynamic programming

Abstract In handwritten Chinese characters, characters may be written to touch each other or to overlap with each other, therefore, the segmentation problem is not an easy one. In this paper, we present a novel method which uses strokes to build stroke bounding boxes first. Then, the knowledge-based merging operations are used to merge those stroke bounding boxes and, finally, a dynamic programming method is applied to find the best segmentation boundaries. A series of experiments show that our method is very effective for off-line handwritten Chinese character segmentation.

[1]  Eric Lecolinet,et al.  A Survey of Methods and Strategies in Character Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Lin-Yu Tseng,et al.  An efficient knowledge-based stroke extraction method for multi-font chinese characters , 1992, Pattern Recognit..

[3]  Gilles F. Houle,et al.  Hybrid Contextural Text Recognition with String Matching , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Yi Lu,et al.  Machine printed character segmentation --; An overview , 1995, Pattern Recognit..

[5]  Jhing-Fa Wang,et al.  A new method for the segmentation of mixed handprinted Chinese/English characters , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[6]  Paul D. Gader,et al.  Handwritten Word Recognition Using Segmentation-Free Hidden Markov Modeling and Segmentation-Based Dynamic Programming Techniques , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Yi Lu,et al.  Character segmentation in handwritten words - An overview , 1996, Pattern Recognit..