The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Keyword spotting in poorly printed documents using pseudo 2-D hidden Markov models
Abstract
An algorithm for robust machine recognition of keywords embedded in a poorly printed document is presented. For each keyword, two statistical models, called pseudo 2-D hidden Markov models, are created for representing the actual keyword and all the other extraneous words, respectively. Dynamic programming is then used for matching an unknown input word with the two models and for making a maximum likelihood decision. Although the models are pseudo 2-D in the sense that they are not fully connected 2-D networks, they are shown to be general enough in characterizing printed words efficiently. These models facilitate a nice "elastic matching" property in both horizontal and vertical directions, which makes the recognizer not only independent of size and slant but also tolerant of highly deformed and noisy words. The system is evaluated on a synthetically created database that contains about 26000 words. Currently, the authors achieve a recognition accuracy of 99% when words in testing and training sets are of the same font size, and 96% when they are in different sizes. In the latter case, the conventional 1-D HMM achieves only a 70% accuracy rate.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Cited by
A Survey of Face Recognition Techniques
Jafri, R., & Arabnia, H. R. (2009) · Journal of Information Processing Systems · doi:10.3745/jips.2009.5.2.041 · Cited by 677
Twenty years of document image analysis in PAMI
Nagy, G. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824820 · Cited by 507
Off-line Arabic character recognition
Amin, A. (1998) · Pattern Recognition · doi:10.1016/s0031-3203(97)00084-8 · Cited by 313
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
Metadata
- Authors
- Kuo, S.-S., & Agazzi, O. E.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1994
- Volume
- 16
- Issue
- 8
- Pages
- 842-848
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2136126387
- Cited by
- 229
- References
- 1
- FWCI
- 4.95
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Keyword spotting in poorly printed documents using pseudo 2-D hidden Markov models. https://app.cochat.ai/papers/10.1109/34.308482
- The paper
- Kuo, S.-S., & Agazzi, O. E. (1994). Keyword spotting in poorly printed documents using pseudo 2-D hidden Markov models. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.308482
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.