Markov models for offline handwriting recognition: a survey
Open accessThe DOI matches its Crossref record.
Abstract
Since their first inception more than half a century ago, automatic reading systems have evolved substantially, thereby showing impressive performance on machine-printed text. The recognition of handwriting can, however, still be considered an open research problem due to its substantial variation in appearance. With the introduction of Markovian models to the field, a promising modeling and recognition paradigm was established for automatic offline handwriting recognition. However, so far, no standard procedures for building Markov-model-based recognizers could be established though trends toward unified approaches can be identified. It is therefore the goal of this survey to provide a comprehensive overview of the application of Markov models in the research field of offline handwriting recognition, covering both the widely used hidden Markov models and the less complex Markov-chain or n -gram models. First, we will introduce the typical architecture of a Markov-model-based offline handwriting recognition system and make the reader familiar with the essential theoretical concepts behind Markovian models. Then, we will give a thorough review of the solutions proposed in the literature for the open problems how to apply Markov-model-based approaches to automatic offline handwriting recognition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The future of employment: How susceptible are jobs to computerisation?
Frey, C. B., & Osborne, M. A. (2017) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2016.08.019 · Cited by 8,727
“Today, the problems of navigating a car and deciphering handwriting are sufficiently well understood that many related tasks can be specified in computer code and automated (Veres et al., 2011; Plötz and Fink, 2009).”
BackgroundHandwritten Optical Character Recognition (OCR): A Comprehensive Systematic Literature Review (SLR)
Memon, J., Sami, M., Khan, R. A., & Uddin, M. (2020) · IEEE Access · doi:10.1109/access.2020.3012542 · Cited by 556
Towards multimodal sentiment analysis: harvesting opinions from the web
Morency, L.-P., Mihalcea, R., & Doshi, P. (2011) · Proceedings of the 13th international conference on multimodal interfaces · doi:10.1145/2070481.2070509 · Cited by 470
A review of verbal and non-verbal human–robot interactive communication
Mavridis, N. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2014.09.031 · Cited by 453
Lexicon-free handwritten word spotting using character HMMs
Fischer, A., Keller, A., Frinken, V., & Bunke, H. (2012) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.09.009 · Cited by 292
A Novel Word Spotting Method Based on Recurrent Neural Networks
Frinken, V., Fischer, A., Manmatha, R., & Bunke, H. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.113 · Cited by 263
Hiremath, S. K., & Ploetz, T. (2021) · 2021 International Symposium on Wearable Computers · doi:10.1145/3460421.3478825 · Cited by 4
Metadata
- Authors
- Plötz, T., & Fink, G. A.
- Venue
- International Journal on Document Analysis and Recognition (IJDAR)
- Published
- 2009-10-31
- Volume
- 12
- Issue
- 4
- Pages
- 269-298
- ISSN
- 1433-2825 (ISSN-L)
- 1433-2833
- OpenAlex
- W2133552271
- Cited by
- 220
- References
- 0
- FWCI
- 12.83
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.