This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Recognition and Verification of Unconstrained Handwritten Words
October 2005 (vol. 27 no. 10)
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.

[1] P.D. Gader, M.A. Mohamed, and J.M. Keller, “Fusion of Handwritten Word Classifiers,” Pattern Recognition Letters, vol. 17, pp. 577-584, 1996.
[2] A.W. Senior and A.J. Robinson, “An Off-Line Cursive Handwriting Recognition System,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 3, pp. 309-321, Mar. 1998.
[3] T. Steinherz, E. Rivlin, and N. Intrator, “Offline Cursive Script Word Recognition— A Survey,” Int'l J. Document Analysis and Recognition, vol. 2, pp. 90-110, 1999.
[4] A. El-Yacoubi, M. Gilloux, R. Sabourin, and C.Y. Suen, “Unconstrained Handwritten Word Recognition Using Hidden Markov Models,” IEEE Trans. Pattern Analysis and Machine Intelligence vol. 21, no. 8, pp. 752-760, Aug. 1999.
[5] R. Plamondon and S.N. Srihari, “On-Line and Off-Line Handwriting Recognition: A Comprehensive Survey,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 1, pp. 68-89, Jan. 2000.
[6] N. Arica and F.T. Yarman-Vural, “An Overview of Character Recognition Focused on Off-Line Handwriting,” IEEE Trans. Systems, Man, and Cybernetics-Part C: Applications and Rev., vol. 31, no. 2, pp. 216-233, 2001.
[7] A.L. Koerich, R. Sabourin, and C.Y. Suen, “Large Vocabulary Off-Line Handwriting Recognition: A Survey,” Pattern Analysis and Applications, vol. 6, no. 2, pp. 97-121, 2003.
[8] A. Vinciarelli, S. Bengio, and H. Bunke, “Offline Recognition of Unconstrained Handwriting Texts Using HMMs and Statistical Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 6, pp. 709-720, June 2004.
[9] C. Farouz, “Reconnaissance de Mots Manuscrits Hors-Ligne dans un Vocabulaire Ouvert par Modelisation Markovienne,” PhD dissertation, Université de Nantes, Nantes, France, Aug. 1999.
[10] F. Grandidier, R. Sabourin, and C.Y. Suen, “Integration of Contextual Information in Handwriting Recognition Systems,” Proc. Seventh Int'l Conf. Document Analysis and Recognition, pp. 1252-1256, 2003.
[11] R.K. Powalka, N. Sherkat, and R.J. Whitrow, “Word Shape Analysis for a Hybrid Recognition System,” Pattern Recognition, vol. 30, no. 3, pp. 412-445, 1997.
[12] J. Kittler, M. Hatef, R.P.W. Duin, and J. Matas, “On Combining Classifiers,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 3, pp. 226-239, Mar. 1998.
[13] C.Y. Suen and L. Lam, “Multiple Classifier Combination Methodologies for Different Output Levels,” Proc. First Int'l Workshop Multiple Classifier Systems, pp. 52-66, 2000.
[14] S. Srihari, “A Survey of Sequential Combination of Word Recognizers in Handwritten Phrase Recognition at Cedar,” Proc. First Int'l Workshop Multiple Classifier Systems, pp. 45-51, 2000.
[15] B. Verma, P. Gader, and W. Chen, “Fusion of Multiple Handwritten Word Recognition Techniques,” Pattern Recognition Letters, vol. 22, pp. 991-998, 2001.
[16] L.S. Oliveira, R. Sabourin, F. Bortolozzi, and C.Y. Suen, “A Modular System to Recognize Numerical Amounts on Brazilian Bank Cheques,” Proc. Sixth Int'l Conf. Document Analysis and Recognition, pp. 389-394, 2001.
[17] S. Madhvanath, E. Kleinberg, and V. Govindaraju, “Holistic Verification of Handwritten Phrases,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 1344-1356, Dec. 1999.
[18] L.P. Cordella, P. Foggia, C. Sansone, F. Tortorella, and M. Vento, “A Cascaded Multiple Expert System for Verification,” Proc. First Int'l Workshop Multiple Classifier Systems, pp. 330-339, 2000.
[19] S.J. Cho, J. Kim, and J.H. Kim, “Verification of Graphemes Using Neural Networks in an HMM-Based On-Line Korean Handwriting Recognition System,” Proc. Seventh Int'l Workshop Frontiers in Handwriting Recognition, pp. 219-228, 2000.
[20] H. Takahashi and T.D. Griffin, “Recognition Enhancement by Linear Tournament Verification,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 585-588, 1993.
[21] A.S. Britto, R. Sabourin, F. Bortolozzi, and C.Y. Suen, “A Two-Stage HMM-Based System for Recognizing Handwritten Numeral Strings,” Proc. Sixth Int'l Conf. Document Analysis and Recognition, pp. 396-400, 2001.
[22] D. Guillevic and C.Y. Suen, “Cursive Script Recognition Applied to the Processing of Bank Cheques,” Proc. Third Int'l Conf. Document Analysis and Recognition, pp. 11-14, 1995.
[23] J. Gloger, A. Kaltenmeier, E. Mandler, and L. Andrews, “Reject Management in a Handwriting Recognition System,” Proc. Fourth Int'l Conf. Document Analysis and Recognition, pp. 556-559, 1997.
[24] N. Gorski, “Optimizing Error-Reject Trade Off in Recognition Systems,” Proc. Fourth Int'l Conf. Document Analysis and Recognition, pp. 1092-1096, 1997.
[25] S. Marukatat, T. Artieres, P. Gallinari, and B. Dorizzi, “Rejection Measures for Handwriting Sentence Recognition,” Proc. Eighth Int'l Workshop Frontiers in Handwriting Recognition, pp. 24-29, 2002.
[26] J.F. Pitrelli and M.P. Perrone, “Confidence Modeling for Verification Post-Processing for Handwriting Recognition,” Proc. Eighth Int'l Workshop Frontiers in Handwriting Recognition, pp. 30-35, 2002.
[27] A. Stolcke, Y. Konig, and M. Weintraub, “Explicit Word Error Minimization in N-Best List Rescoring,” Proc. Eurospeech '97, pp. 163-166, 1997.
[28] A.L. Koerich, R. Sabourin, and C.Y. Suen, “Fast Two-Level Viterbi Search Algorithm for Unconstrained Handwriting Recognition,” Proc. 27th Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 3537-3540, 2002.
[29] A.L. Koerich, R. Sabourin, and C.Y. Suen, “Fast Two-Level HMM Decoding Algorithm for Large Vocabulary Handwriting Recognition,” Proc. Ninth Int'l Workshop Frontiers in Handwriting Recognition, pp. 232-237, 2004.
[30] G. Zavaliagkos, Y. Zhao, R. Schwartz, and J. Makhoul, “A Hybrid Segmental Neural Net/Hidden Markov Model System for Continuous Speech Recognition,” IEEE Trans. Speech and Audio Processing, vol. 2, no. 1, pp. 151-160, 1994.
[31] F. Grandidier, “Analyse de l'Ensemble des Confusions d'un Système,” technical report, École de Technologie Supérieure, Montréal, Canada, 2000.
[32] H. Duplantier, “Interfaces de Visualisation pour la Reconnaissance d'Écriture,” technical report, École de Technologie Supérieure, Montréal, Canada, 1998.
[33] A.L. Koerich, “Large Vocabulary Off-Line Handwritten Word Recognition,” PhD dissertation, École de Technologie Supérieure de l'Université du Québec, Montréal, Canada, 2002.
[34] L. Yaeger, R. Lyon, and B. Webb, “Effective Training of a Neural Network Character Classifier for Word Recognition,” Proc. Advances in Neural Information Processing Systems, pp. 807-813, 1997.
[35] A.L. Koerich, Y. Leydier, R. Sabourin, and C.Y. Suen, “A Hybrid Large Vocabulary Handwritten Word Recognition System Using Neural Networks with Hidden Markov Models,” Proc. Eighth Int'l Workshop Frontiers in Handwriting Recognition, pp. 99-104, 2002.
[36] A.L. Koerich, R. Sabourin, and C.Y. Suen, “Lexicon-Driven HMM Decoding for Large Vocabulary Handwriting Recognition with Multiple Character Models,” Int'l J. Document Analysis and Recognition, vol. 6, no. 2, pp. 126-144, 2003.
[37] J. Schurmann, Pattern Classification: A Unified View of Statistical and Neural Approaches. John Wiley and Sons, 1996.
[38] A.L. Koerich, “Rejection Strategies for Handwritten Word Recognition,” Proc. Ninth Int'l Workshop Frontiers in Handwriting Recognition, pp. 479-484, 2004.
[39] A.L. Koerich, R. Sabourin, and C.Y. Suen, “A Distributed Scheme for Lexicon-Driven Handwritten Word Recognition and Its Application to Large Vocabulary Problems,” Proc. Sixth Int'l Conf. Document Analysis and Recognition, pp. 660-664, 2001.
[40] N. Arica and F.T. Yarman-Vural, “Optical Character Recognition for Cursive Handwriting,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 6, pp. 801-813, June 2002.
[41] S. Carbonnel and E. Anquetil, “Lexical Post-Processing Optimization for Handwritten Word Recognition,” Proc. Seventh Int'l Conf. Document Analysis and Recognition, pp. 477-481, 2003.

Index Terms:
Index Terms- Word hypothesis rejection, classifier combination, large vocabulary, handwriting recognition, neural networks.
Citation:
Alessandro L. Koerich, Robert Sabourin, Ching Y. Suen, "Recognition and Verification of Unconstrained Handwritten Words," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1509-1522, Oct. 2005, doi:10.1109/TPAMI.2005.207
Usage of this product signifies your acceptance of the Terms of Use.