Handwritten address recognition using hidden markov models

25Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper several aspects of a recognition system for cursive handwritten German address words (cities and streets) are described. The recognition system is based on Hidden Markov Models (HMMs), whereat the focus is on two main problems: the changes in the writing style depending on time or regional differences and the difficulty to select the correct (complete) dictionary for address reading. The first problem leads to the examination of three different adaptation techniques: Maximum Likelihood (ML), Maximum Likelihood Linear Regression (MLLR) and Scaled Likelihood Linear Regression (SLLR). To handle the second problem language models based on backoff character n-grams are examined to evaluate the performance of an open vocabulary recognition (without dictionary). For both problems the determination of confidence measures (based on the frame-normalized likelihood, a garbage model, a two-best recognition or an unconstrained character decoding) is important, either for an unsupervised adaptation or the detection of out of vocabulary words (OOV). The databases, which are used for recognition, are provided by Siemens Dematic (SD) within the Adaptive READ project. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Brakensiek, A., & Rigoll, G. (2004). Handwritten address recognition using hidden markov models. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2956, 103–122. https://doi.org/10.1007/978-3-540-24642-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free