The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Lexicon-driven segmentation and recognition of handwritten character strings for Japanese address reading
Abstract
This paper describes a handwritten character string recognition system for Japanese mail address reading on a very large vocabulary. The address phrases are recognized as a whole because there is no extra space between words. The lexicon contains 111,349 address phrases, which are stored in a trie structure. In recognition, the text line image is matched with the lexicon entries (phrases) to obtain reliable segmentation and retrieve valid address phrases. The paper first introduces some effective techniques for text line image preprocessing and presegmentation. In presegmentation, the text line image is separated into primitive segments by connected component analysis and touching pattern splitting based on contour shape analysis. In lexicon matching, consecutive segments are dynamically combined into candidate character patterns. An accurate character classifier is embedded in lexicon matching to select characters matched with a candidate pattern from a dynamic category set. A beam search strategy is used to control the lexicon matching so as to achieve real-time recognition. In experiments on 3,589 live mail images, the proposed method achieved correct rate of 83.68 percent while the error rate is less than 1 percent.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“Compared to best-first search or heuristic search [ 39 ], [40], the breadth-first search can overcome the bias to short strings [41] and obtain multiple solutions of string matching.”
Background
Cited by
ICDAR 2015 competition on Robust Reading
Karatzas, D., Gomez-Bigorda, L., Nicolaou, A., Ghosh, S., Bagdanov, A., Iwamura, M., Matas, J., Neumann, L., Chandrasekhar, V. R., Lu, S., et al. (2015) · 2015 13th International Conference on Document Analysis and Recognition (ICDAR) · doi:10.1109/icdar.2015.7333942 · Cited by 1,547
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
Zhang, X.-Y., Bengio, Y., & Liu, C.-L. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2016.08.005 · Cited by 302
Self-citationText Recognition in the Wild: A Survey
Chen, X., Jin, L., Zhu, Y., Luo, C., & Wang, T. (2022) · ACM Computing Surveys · doi:10.1145/3440756 · Cited by 205
“eural network with unsupervised feature learning to train a highly-accurate character recognizer module. For postprocessing, the character responses with character spacings, the beam search algorithm [122] or the weighted finite state transducer [123] based representation were applied to recognize target words in a defi…”
Method
Metadata
- Authors
- Liu, C.-L., Koga, M., & Fujisawa, H.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-11
- Volume
- 24
- Issue
- 11
- Pages
- 1425-1437
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2110025586
- Cited by
- 173
- References
- 3
- FWCI
- 5.24
- 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: Lexicon-driven segmentation and recognition of handwritten character strings for Japanese address reading. https://app.cochat.ai/papers/10.1109/tpami.2002.1046151
- The paper
- Liu, C.-L., Koga, M., & Fujisawa, H. (2002). Lexicon-driven segmentation and recognition of handwritten character strings for Japanese address reading. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2002.1046151
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.