Investigation on a structural solution of merged characters segmentation in OCR

One of the major remaining problems in OCR is the processing of merged characters. In this paper we describe the current state of our investigation towards the possibility of a solution which takes advantage of information available in a structural recognition system. Examples are given and some heuristic rules referring to a second level segmentation by means of curve partitioning are discussed. Finally, an OCR model involving multiple level distinction and segmentation is suggested.

[1]  Gabriella Sanniti di Baja,et al.  A thinning algorithm based on prominence detection , 1981, Pattern Recognit..

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

[3]  Roy L. Hoffman,et al.  Segmentation Methods for Recognition of Machine-Printed Characters , 1971, IBM J. Res. Dev..

[4]  Theodosios Pavlidis,et al.  On the Recognition of Printed Characters of Any Font and Size , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Alberto Sanfeliu,et al.  Report of working group on document analysis and line-graphics processing , 1990 .

[6]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[7]  George Nagy,et al.  29 Optical character recognition - Theory and practice , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

[8]  Richard G. Casey,et al.  A Processor-Based OCR System , 1983, IBM J. Res. Dev..

[9]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[10]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .