Segmentation of handwritten numerals by graph representation

A new algorithm is proposed for segmenting simply and multiply connected digits. It also removes ligatures. After thinning the pattern, the edges and vertices are extracted and the pattern is represented as a connected graph. Then the matrices relating to the graph are calculated. To determine the segmentation path, both graph theory techniques and heuristic rules are used. The boundaries of digits are calculated to make the width of touching strokes uniform. The separated digits thus have a more natural shape than can be achieved using algorithms that split patterns using straight lines or line segments.

[1]  Daniel S. Yeung,et al.  A fuzzy substroke extractor for handwritten Chinese characters , 1996, Pattern Recognit..

[2]  Hsi-Jian Lee,et al.  Off-line recognition of handwritten Chinese characters by on-line model-guided matching , 1992, Pattern Recognit..

[3]  Ashraf Elnagar,et al.  Segmentation of connected handwritten numeral strings , 2003, Pattern Recognit..

[4]  Yasuaki Nakano,et al.  Segmentation methods for character recognition: from segmentation to document structure analysis , 1992, Proc. IEEE.

[5]  Fatos T. Yarman-Vural,et al.  A new scheme for off-line handwritten connected digit recognition , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).

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

[7]  Venu Govindaraju,et al.  Segmentation and recognition of connected handwritten numeral strings , 1997, Pattern Recognit..

[8]  Misako Suwa.  Segmentation of touching handwritten Japanese characters using the graph theory method , 2000, IS&T/SPIE Electronic Imaging.

[9]  Sargur N. Srihari,et al.  A system for segmentation and recognition of totally unconstrained handwritten numeral strings , 1997, Proceedings of the Fourth International Conference on Document Analysis and Recognition.

[10]  Pengfei Shi,et al.  A background-thinning-based approach for separating and recognizing connected handwritten digit strings , 1999, Pattern Recognit..

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Malayappan Shridhar,et al.  Recognition of isolated and simply connected handwritten numerals , 1986, Pattern Recognition.

[13]  Vinod Chachra,et al.  Applications of graph theory algorithms , 1979 .

[14]  Xueping Li.  Recognition of connected numeral strings using partial boundary features , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.

[15]  Fumitaka Kimura,et al.  Improvements of a lexicon directed algorithm for recognition of unconstrained handwritten words , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[16]  Shaowei Xia,et al.  A new method for segmenting unconstrained handwritten numeral string , 1997, Proceedings of the Fourth International Conference on Document Analysis and Recognition.

[17]  C. J. Hilditch,et al.  Linear Skeletons From Square Cupboards , 1969 .

[18]  Adam Krzyzak,et al.  Segmentation of handwritten digits using contour features , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[19]  Jhing-Fa Wang,et al.  Segmentation of Single- or Multiple-Touching Handwritten Numeral String Using Background and Foreground Analysis , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Mohamed Cheriet,et al.  Background region-based algorithm for the segmentation of connected digits , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.

[21]  James Westall,et al.  Vertex directed segmentation of handwritten numerals , 1993, Pattern Recognit..