Issue No. 06 - June (2002 vol. 24)
<p>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.</p>
Handwritten word recognition, preprocessing, segmentation, optical character recognition, cursive handwriting, hidden Markov model, search, graph, lexicon matching.
N. Arica and F. T. Yarman-Vural, "Optical Character Recognition for Cursive Handwriting," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 24, no. , pp. 801-813, 2002.