Context driven text segmentation and recognition

Abstract We present an algorithm for text segmentation and recognition mainly suited for complex problems where many merged characters are present. The basic idea is to define a distance, between lines of text and strings, which allows us to postpone the final decision about text segmentation and character classification until the contextual analysis is performed. The distance takes into account both the hypotheses about segmentation generated by a text segmentation module and the hypotheses about character classification produced by a probabilistic classifier. The algorithm has been tested by reading text on books' covers; the experimental results highlight the quality of the solution proposed.

[1]  Lawrence D. Jackel,et al.  Reading handwritten digits: a ZIP code recognition system , 1992, Computer.

[2]  Karen Kukich,et al.  Techniques for automatically correcting words in text , 1992, CSUR.

[3]  Marcello Federico,et al.  An Optimum Classifier Approximation for Network-Based Handwritten Character Recognition , .

[4]  W. W. Bledsoe,et al.  Pattern recognition and reading by machine , 1959, IRE-AIEE-ACM '59 (Eastern).

[5]  Eleanor J. Gibson,et al.  Perceptual learning and the theory of word perception , 1971 .

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

[7]  Sargur N. Srihari,et al.  A word shape analysis approach to lexicon based word recognition , 1992, Pattern Recognit. Lett..

[8]  Tomaso Poggio,et al.  A project for an intelligent system: Vision and learning , 1992 .

[9]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[10]  Jonathan J. Hull,et al.  A COMPUTATIONAL THEORY AND ALGORITHM FOR FLUENT READING , 1987 .

[11]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[12]  Ian H. Witten,et al.  The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression , 1991, IEEE Trans. Inf. Theory.

[13]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[14]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

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

[16]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.