Finding words in alphabet soup: Inference on freeform character recognition for historical scripts

  • Authors:
  • Nicholas R. Howe;Shaolei Feng;R. Manmatha

  • Affiliations:
  • Department of Computer Science, Smith College, Northampton, MA 01063, USA;Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA;Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA

  • Venue:
  • Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper develops word recognition methods for historical handwritten cursive and printed documents. It employs a powerful segmentation-free letter detection method based upon joint boosting with histograms of gradients as features. Efficient inference on an ensemble of hidden Markov models can select the most probable sequence of candidate character detections to recognize complete words in ambiguous handwritten text, drawing on character n-gram and physical separation models. Experiments with two corpora of handwritten historic documents show that this approach recognizes known words more accurately than previous efforts, and can also recognize out-of-vocabulary words.