The Community for Technology Leaders
RSS Icon
Issue No.10 - October (2005 vol.27)
pp: 1509-1522
This paper presents a novel approach for the verification of the word hypotheses generated by a large vocabulary, offline handwritten word recognition system. Given a word image, the recognition system produces a ranked list of the N-best recognition hypotheses consisting of text transcripts, segmentation boundaries of the word hypotheses into characters, and recognition scores. The verification consists of an estimation of the probability of each segment representing a known class of character. Then, character probabilities are combined to produce word confidence scores which are further integrated with the recognition scores produced by the recognition system. The N-best recognition hypothesis list is reranked based on such composite scores. In the end, rejection rules are invoked to either accept the best recognition hypothesis of such a list or to reject the input word image. The use of the verification approach has improved the word recognition rate as well as the reliability of the recognition system, while not causing significant delays in the recognition process. Our approach is described in detail and the experimental results on a large database of unconstrained handwritten words extracted from postal envelopes are presented.
Index Terms- Word hypothesis rejection, classifier combination, large vocabulary, handwriting recognition, neural networks.
Alessandro L. Koerich, Robert Sabourin, Ching Y. Suen, "Recognition and Verification of Unconstrained Handwritten Words", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 10, pp. 1509-1522, October 2005, doi:10.1109/TPAMI.2005.207
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool