LeRec: A NN/HMM Hybrid for On-Line Handwriting Recognition
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
We introduce a new approach for on-line recognition of handwritten words written in unconstrained mixed style. The preprocessor performs a word-level normalization by fitting a model of the word structure using the EM algorithm. Words are then coded into low resolution "annotated images" where each pixel contains information about trajectory direction and curvature. The recognizer is a convolution network that can be spatially replicated. From the network output, a hidden Markov model produces word scores. The entire system is globally trained to minimize word-level errors.
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
Cites
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Backpropagation Applied to Handwritten Zip Code Recognition
LeCun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W., & Jackel, L. D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.541 · Cited by 11,891
Self-citationThe state of the art in online handwriting recognition
Tappert, C. C., Suen, C. Y., & Wakahara, T. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57669 · Cited by 857 · cited 2×
“The recognition of handwritten characters from a pen trajectory on a digitizing surface is often done in the time domain (Tappert et al. 1990; Guyon et al. 1991).”
BackgroundMethodGlobal optimization of a neural network-hidden Markov model hybrid
Bengio, Y., De Mori, R., Flammia, G., & Kompe, R. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.125866 · Cited by 203
Self-citationShortest path segmentation: A method for training a neural network to recognize character strings
Burges, C. J. C., Matan, O., Le Cun, Y., Denker, J. S., Jackel, L. D., Stenard, C. E., Nohl, C. R., & Ben, J. I. (2003) · [Proceedings 1992] IJCNN International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1992.227175 · Cited by 37 · cited 1×
“One approach, that we call INSEG, is to recognize a large number of heuristically segmented candidate characters and combine them optimally with a post-processor (Burges et al. 1992; Schenkel et al. 1993).”
BackgroundSelf-citation
Cited by
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Self-citationSupervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Online and off-line handwriting recognition: a comprehensive survey
Plamondon, R., & Srihari, S. N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824821 · Cited by 2,498
How does the brain solve visual object recognition?
DiCarlo, J. J., Zoccolan, D., & Rust, N. C. (2012) · Neuron · doi:10.1016/j.neuron.2012.01.010 · Cited by 1,790
“…that assume unsupervised learning use a small number of learning parameters to control a very large number of synaptic weight parameters (e.g., Bengio et al., 1995; Pinto et al., 2009b; Serre et al., 2007b), which is one reason that neuronal evidence of unsupervised tolerance learning is of…”
GradientBased Learning Applied to Document Recognition
(2009) · Intelligent Signal Processing · doi:10.1109/9780470544976.ch9 · Cited by 1,135
Metadata
- Authors
- Bengio, Y., LeCun, Y., Nohl, C., & Burges, C.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1995-11
- Volume
- 7
- Issue
- 6
- Pages
- 1289-1303
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2099070536
- Cited by
- 132
- References
- 5
- FWCI
- 3.37
- 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
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.