{"publication":"ICASSP, Munich","date_updated":"2022-01-06T06:51:08Z","type":"conference","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/1997/ICASSP_1997_Haeb1_paper.pdf","open_access":"1"}],"department":[{"_id":"54"}],"title":"Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition","_id":"11750","citation":{"apa":"Dolfing, J. G. A., & Haeb-Umbach, R. (1997). Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition. In ICASSP, Munich.","ieee":"J. G. A. Dolfing and R. Haeb-Umbach, “Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition,” in ICASSP, Munich, 1997.","mla":"Dolfing, J. G. A., and Reinhold Haeb-Umbach. “Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition.” ICASSP, Munich, 1997.","ama":"Dolfing JGA, Haeb-Umbach R. Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition. In: ICASSP, Munich. ; 1997.","short":"J.G.A. Dolfing, R. Haeb-Umbach, in: ICASSP, Munich, 1997.","chicago":"Dolfing, J.G.A., and Reinhold Haeb-Umbach. “Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition.” In ICASSP, Munich, 1997.","bibtex":"@inproceedings{Dolfing_Haeb-Umbach_1997, title={Signal Representations for Hidden Markov Model Based On-Line Handwriting Recognition}, booktitle={ICASSP, Munich}, author={Dolfing, J.G.A. and Haeb-Umbach, Reinhold}, year={1997} }"},"user_id":"44006","date_created":"2019-07-12T05:27:32Z","status":"public","year":"1997","oa":"1","author":[{"full_name":"Dolfing, J.G.A.","last_name":"Dolfing","first_name":"J.G.A."},{"first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","id":"242"}],"abstract":[{"text":"Addresses the problem of online, writer-independent, unconstrained handwriting recognition. Based on hidden Markov models (HMM), which are successfully employed in speech recognition tasks, we focus on representations which address scalability, recognition performance and compactness. 'Delayed' features are introduced which integrate more global, handwriting specific knowledge into the HMM representation. These features lead to larger error-rate reduction than 'delta' features which are known from speech recognition and even require fewer additional components. Scalability is addressed with a size-independent representation. Compactness is achieved with linear discriminant analysis. The representations are discussed and the results for a mixed-style word recognition task with vocabularies of 200 (up to 99% correct words) and 20000 words (up to 88.8% correct words) are given.","lang":"eng"}]}