Degraded Text Recognition Using Word Collocation and Visual Inter-Word Constraints

Given a noisy text page, a word recognizer can generate a set of candidates for each word image. A relaxation algorithm was proposed previously by the authors that uses word collocation statistics to select the candidate for each word that has the highest probability of being the correct decision. Because word collocation is a local constraint and collocation data trained from corpora are usually incomplete, the algorithm cannot select the correct candidates for some images. To overcome this limitation, contextual information at the image level is now exploited inside the relaxation algorithm. If two word images can match with each other, they should have same symbolic identity. Visual inter-word relations provide a way to link word images in the text and to interpret them systematically. By integrating visual inter-word constraints with word collocation data, the performance of the relaxation algorithm is improved.

• Type: Conference
• Year: 1994
• Where: ANLP
• Authors: Tao Hong, Jonathan J. Hull
• Keywords: ANLP 1994, Relaxation Algorithm, Word Collocation, Word Images