TY - JOUR
T1 - Handwritten address recognition using hidden markov models
AU - Brakensiek, Anja
AU - Rigoll, Gerhard
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=35048886519&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-24642-8_7
DO - 10.1007/978-3-540-24642-8_7
M3 - Article
AN - SCOPUS:35048886519
SN - 0302-9743
VL - 2956
SP - 103
EP - 122
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -