Handwritten word recognition using HMM with adaptive length Viterbi algorithm

Abstract

The authors have developed a handwritten word recognition scheme based on a single contextual, discrete symbol probability hidden Markov model (HMM) incorporated with an adaptive length Viterbi algorithm. This work attempts to extend the earlier HMM scheme for naturally segmented word recognition to cursive and nonsegmented word recognition. The algorithm presegments the script into characters and/or fractions of characters, dynamically selects the correct segmentation points, determines the word length, and recognizes the word according to the maximum path probability. The HMM is on top of, but independent of, script segmentation and character recognition techniques, and therefore leaves room for further improvement. The experiments have shown promising results and directions for further improvement.< >