Length estimation of digit strings using a neural network with structure-based features

Accurate length estimation is very helpful for the suc- cessful segmentation and recognition of connected digit strings, in particular, for an off-line recognition system. However, little work has been done in this area due to the difficulties involved. A length es- timation approach is presented as a part of our automatic off-line digit recognition system. The kernel of our approach is a neural network estimator with a set of structure-based features as the in- puts. The system outputs are a set of fuzzy membership grades reflecting the degrees of an input digit string of having different lengths. Experimental results on National Institute of Standards and Technology (NIST) Special Database 3 and other derived digit strings shows that our approach can achieve an about 99.4% cor- rect estimation if the best two estimations are considered. © 1998 SPIE and IS&T. (S1017-9909(98)00901-5)

[1]  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.

[2]  J. Simon,et al.  From Pixels to Features III: Frontiers in Handwriting Recognition , 1992 .

[3]  Jin Hyung Kim,et al.  Modeling and recognition of cursive words with hidden Markov models , 1995, Pattern Recognit..

[4]  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..

[5]  Jian Zhou,et al.  Off-Line Handwritten Word Recognition Using a Hidden Markov Model Type Stochastic Network , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Xinhua Zhuang,et al.  Image Analysis Using Mathematical Morphology , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Rainer Hoch,et al.  On Virtual Partitioning of Large Dictionaries for Contextual Post-Processing to Improve Character Recognition , 1996, Int. J. Pattern Recognit. Artif. Intell..

[8]  Theodosios Pavlidis,et al.  Character Recognition Without Segmentation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Theodosios Pavlidis,et al.  A solution to the problem of touching and broken characters , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[10]  Malayappan Shridhar,et al.  Context-directed segmentation algorithm for handwritten numeral strings , 1987, Image Vis. Comput..

[11]  Edward J. Delp,et al.  The analysis of morphological filters with multiple structuring elements , 1990, Comput. Vis. Graph. Image Process..

[12]  E.E. Pissaloux,et al.  Image Processing , 1994, Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing.

[13]  Torsten Caesar,et al.  Sophisticated topology of hidden Markov models for cursive script recognition , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[14]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[15]  A. Kundu,et al.  Recognition of handwritten script: a hidden Markov model based approach , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

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

[17]  Kjersti Aas,et al.  Text page recognition using Grey-level features and hidden Markov models , 1996, Pattern Recognit..

[18]  Anil K. Jain,et al.  Feature extraction methods for character recognition-A survey , 1996, Pattern Recognit..