A Novel Connectionist System for Unconstrained Handwriting Recognition
Technical University of Munich · Information Technology University · +4 more institutions
Abstract
Recognizing lines of unconstrained handwritten text is a challenging task. The difficulty of segmenting cursive or overlapping characters, combined with the need to exploit surrounding context, has led to low recognition rates for even the best current recognizers. Most recent progress in the field has been made either through improved preprocessing or through advances in language modeling. Relatively little work has been done on the basic recognition algorithms. Indeed, most systems rely on the same hidden Markov models that have been used for decades in speech and handwriting recognition, despite their well-known shortcomings. This paper proposes an alternative approach based on a novel type of recurrent…
Citation impact
- FWCI
- 26.26
- Percentile
- 100%
- References
- 61
Authors
6- AGAlexander GravesCorresponding
Technical University of Munich, Information Technology University, Embedded Systems (United States)
- MLMarcus Liwicki
German Research Centre for Artificial Intelligence
- SGS. George Fernandez
Dalle Molle Institute for Artificial Intelligence Research
- RBRoman Bertolami
Intel (United States)
- HBHorst Bunke
Intel (United States)
Topics & keywords
- Computer science
- Hidden Markov model
- Artificial intelligence
- Handwriting recognition
- Robustness (evolution)
- Speech recognition
- Connectionism
- Artificial neural network
- Quality Education