This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optical Character Recognition for Cursive Handwriting
June 2002 (vol. 24 no. 6)
pp. 801-813

In this paper, a new analytic scheme, which uses a sequence of segmentation and recognition algorithms, is proposed for offline cursive handwriting recognition problem. First, some global parameters, such as slant angle, baselines, and stroke width and height are estimated. Second, a segmentation method finds character segmentation paths by combining gray scale and binary information. Third, Hidden Markov Model (HMM) is employed for shape recognition to label and rank the character candidates. For this purpose, a string of codes is extracted from each segment to represent the character candidates. The estimation of feature space parameters is embedded in HMM training stage together with the estimation of the HMM model parameters. Finally, the lexicon information and HMM ranks are combined in a graph optimization problem for word-level recognition. This method corrects most of the errors produced by segmentation and HMM ranking stages by maximizing an information measure in an efficient graph searchalgorithm. The experiments in dicate higher recognition rates compared to the available methods reported in the literature.

[1] N. Arica and F.T. Yarman-Vural, “One Dimensional Representation Of Two Dimensional Information For HMM Based Handwritten Recognition,” Pattern Recognition Letters, vol. 21, pp. 583-592, 2000.
[2] N. Arica and F.T. Yarman-Vural, “A New Scheme for Off-Line Handwritten Connected Digit Recognition,” Proc. Int'l Conf. Pattern Recognition, pp. 1127-1131, 1998.
[3] A. Atici and F.T. Yarman-Vural, “A Heuristic Method for Arabic Character Recognition,” J. Signal Processing, vol. 62, pp. 87-99, 1997.
[4] R.G. Casey and E. Lecolinet, "Strategies in Character Segmentation: A Survey," Int'l Conf. Document Analysis and Recognition, vol. 2, pp. 1,028-1,031, Aug. 1995.
[5] T. Caesar, J.M. Gloger, and E. Mandler, “Estimating the Baseline for Written Material” Proc. Third Int'l Conf. Document Analysis and Recognition, pp. 382-385, Montreal, 1995
[6] A. Dengel, R. Hoch, F. Hones, T. Jager, M. Malburg, and A. Weigel, “Techniques For Improving OCR Results,” Handbook of Character Recognition and Document Image Analysis, H. Bunke and P.S.P. Wang, eds., pp. 227-254, 1997.
[7] S. Gopisetty, R. Lorie, J. Mao, M. Mohiuddin, A. Sorin, and E. Yair, “Automated Forms-Processing Software and Services,” IBM J. Research and Development, vol. 40, no. 2, pp. 211-230, 1996.
[8] N. Gorski, V. Anisimov, E. Augustin, O. Baret, D. Price, and J.-C. Simon, “A2iA Check Reader: A Family of Bank Check Recognition Systems,” Proc. Fifth Int'l Conf. Document Analysis and Recognition, pp. 523-526, 1999.
[9] D. Guillevic and C.Y. Suen, “Recognition of Legal Amounts on Bank Cheques,” Pattern Analysis and Applications, vol. 1, no. 1, pp. 28-41, 1998.
[10] G. Kim and V. Govindaraju, “A Lexicon Driven Approach to Handwritten Word Recognition for Real Time Applications,“ IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 4, pp. 366-379, Apr. 1997.
[11] G. Kim, V. Govindaraju, and S.N. Srihari, “An Architecture For Handwritten Text Recognition Systems,” Int'l J. Document Analysis and Recognition, vol. 2, no. 1, pp. 37-44, 1999.
[12] A. Kornai, K.M. Mohiuddin, and S.D. Connell, “Recognition of Cursive Writing on Personal Checks,” Proc. Int'l Workshop Frontiers in Handwriting Recognition, pp. 373-378, 1996.
[13] S.-W. Lee, D.-J. Lee, and H.-S. Park, “A New Methodology for Gray-Scale Character Segmentation and Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 10, pp. 1,045-1,050, Oct. 1996.
[14] J. Mao, P. Sinha, and K. Mohiuddin, “A System For Cursive Handwritten Address Recognition,” Proc. Int'l Conf. Pattern Recognition, pp. 1285-1287, 1998.
[15] S. Madhvanath, G. Kim, and V. Govindaraju, “Chaincode Processing for Handwritten Word Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 9, Sept. 1999.
[16] M. Mohammed and P. Gader, “Handwritten Word Recognition Using Segmentation-Free Hidden Markov Modeling and Segmentation-Based Dynamic Programming Techniques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 5, pp. 548-554, May 1996.
[17] L.R. Rabiner, “Tutorial on Hidden Markov Model and Selected Applications in Speech Recognition,” Proc. IEEE, vol. 77, no. 2, pp. 257-285, 1989.
[18] 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.
[19] M. Shridhar, G. Houles, and F. Kimura, "Handwritten Word Recognition Using Lexicon Free and Lexicon Directed Word Recognition Algorithms," Proc. Int'l Conf Document Analysis and Recognition,Ulm, Germany, Aug. 1997.
[20] S.N. Srihari, Y.-C. Shin, V. Ramanaprasad, and D.S. Lee, “Name and Address Block Reader,” Proc. IEEE, vol. 84, no. 7, pp. 1038-1049, July 1996.
[21] S.N. Srihari and E.J. Keubert, “Integration of Handwritten Address Interpretation Technology into the United States Postal Service Remote Computer Reader System,” Proc. Fourth Int'l Conf. Document Analysis and Recognition, vol. 2, pp. 892-896, Ulm, Germany, Aug. 1997.
[22] O.D. Trier and A.K. Jain, "Goal-Directed Evaluation of Binarization Methods," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, pp. 1,191-1,201, 1995.
[23] J. Wang and J. Jean, “Segmentation of Merged Characters by Neural Networks and Shortest Path,” Pattern Recognition, vol. 27, no. 5, pp. 649, 1994.

Index Terms:
Handwritten word recognition, preprocessing, segmentation, optical character recognition, cursive handwriting, hidden Markov model, search, graph, lexicon matching.
Citation:
Nafiz Arica, Fatos T. Yarman-Vural, "Optical Character Recognition for Cursive Handwriting," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 6, pp. 801-813, June 2002, doi:10.1109/TPAMI.2002.1008386
Usage of this product signifies your acceptance of the Terms of Use.