The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Scene Text Recognition Using Similarity and a Lexicon with Sparse Belief Propagation
Open accessAbstract
Scene text recognition (STR) is the recognition of text anywhere in the environment, such as signs and storefronts. Relative to document recognition, it is challenging because of font variability, minimal language context, and uncontrolled conditions. Much information available to solve this problem is frequently ignored or used sequentially. Similarity between character images is often overlooked as useful information. Because of language priors, a recognizer may assign different labels to identical characters. Directly comparing characters to each other, rather than only a model, helps ensure that similar instances receive the same label. Lexicons improve recognition accuracy but are used post hoc. We introduce a probabilistic model for STR that integrates similarity, language properties, and lexical decision. Inference is accelerated with sparse belief propagation, a bottom-up method for shortening messages by reducing the dependency between weakly supported hypotheses. By fusing information sources in one model, we eliminate unrecoverable errors that result from sequential processing, improving accuracy. In experimental results recognizing text from images of signs in outdoor scenes, incorporating similarity reduces character recognition error by 19 percent, the lexicon reduces word recognition error by 35 percent, and sparse belief propagation reduces the lexicon words considered by 99.9 percent with a 12X speedup and no loss in accuracy.
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“the sum-product algorithm [19], also known as BP.”
Cited by
End-to-end scene text recognition
Wang, K., Babenko, B., & Belongie, S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126402 · Cited by 1,060
Scene Text Recognition using Higher Order Language Priors
Mishra, A., Alahari, K., & Jawahar, C. (2012) · Procedings of the British Machine Vision Conference 2012 · doi:10.5244/c.26.127 · Cited by 831
Text Detection and Recognition in Imagery: A Survey
Ye, Q., & Doermann, D. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2366765 · Cited by 780
A robust arbitrary text detection system for natural scene images
Risnumawan, A., Shivakumara, P., Chan, C. S., & Tan, C. L. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.07.008 · Cited by 531
A Method for Text Localization and Recognition in Real-World Images
Neumann, L., & Matas, J. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19318-7_60 · Cited by 487
Metadata
- Authors
- Weinman, J. J., Learned-Miller, E., & Hanson, A. R.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2009-10
- Volume
- 31
- Issue
- 10
- Pages
- 1733-1746
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2135431879
- Cited by
- 177
- References
- 1
- FWCI
- 15.39
- Type
- journal article
- Language
- en
- Open access
- green
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: Scene Text Recognition Using Similarity and a Lexicon with Sparse Belief Propagation. https://app.cochat.ai/papers/10.1109/tpami.2009.38
- The paper
- Weinman, J. J., Learned-Miller, E., & Hanson, A. R. (2009). Scene Text Recognition Using Similarity and a Lexicon with Sparse Belief Propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2009.38
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.