Abstract
Writer-adaptation is the process of converting a writer-independent handwriting recognition system into a writer-dependent system. It can greatly increasing recognition accuracy, given adequate writer models. The limited amount of data a writer provides during training constrains the models' complexity. We show how appropriate use of writer-independent models is important for the adaptation. Our approach uses writer-independent writing style models (lexemes) to identify the styles present in a particular writer's training data. These models are then updated using the writer's data. Lexemes in the writer's data for which an inadequate number of training examples is available are replaced with the writer-independent models. We demonstrate the feasibility of this approach on both isolated handwritten character recognition and unconstrained word recognition tasks. Our results show an average reduction in error rate of 16.3 percent for lowercase characters as compared against representing each of the writer's character classes with a single model. In addition, an average error rate reduction of 9.2 percent is shown on handwritten words using only a small amount of data for adaptation.
Keywords
Computer scienceHandwritingWord error rateAdaptation (eye)Handwriting recognitionSpeech recognitionArtificial intelligenceIntelligent character recognitionNatural language processingProcess (computing)Character (mathematics)Writing styleDocument processingCharacter recognitionFeature extractionLinguisticsMathematics
Affiliated Institutions
Related Publications
Part-Based Statistical Models for Object Classification and Detection
We propose using simple mixture models to define a set of mid-level binary local features based on binary oriented edge input. The features capture natural local structures in t...
Lattice-based optimization of sequence classification criteria for neural-network acoustic modeling
Acoustic models used in hidden Markov model/neural-network (HMM/NN) speech recognition systems are usually trained with a frame-based cross-entropy error criterion. In contrast,...
Exemplar-Based Sparse Representation Features: From TIMIT to LVCSR
The use of exemplar-based methods, such as support vector machines (SVMs), k-nearest neighbors (kNNs) and sparse representations (SRs), in speech recognition has thus far been l...
An exploration of large vocabulary tools for small vocabulary phonetic recognition
While research in large vocabulary continuous speech recognition (LVCSR) has sparked the development of many state of the art research ideas, research in this domain suffers fro...
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Training Deep Neural Networks is complicated by the fact that the distribution of each layer's inputs changes during training, as the parameters of the previous layers change. T...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 24
- Issue
- 3
- Pages
- 329-346
- Citations
- 88
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
88
OpenAlex
Cite This
S.D. Connell,
Anil K. Jain
(2002).
Writer adaptation for online handwriting recognition.
IEEE Transactions on Pattern Analysis and Machine Intelligence
, 24
(3)
, 329-346.
https://doi.org/10.1109/34.990135
Identifiers
- DOI
- 10.1109/34.990135