1995 International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.1995.480098
|View full text |Cite
|
Sign up to set email alerts
|

Real-time on-line unconstrained handwriting recognition using statistical methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0
1

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 55 publications
(20 citation statements)
references
References 7 publications
0
19
0
1
Order By: Relevance
“…In the opposite direction, this value would be negative. From this relationship the Wiimote orientation [16] can be computed. …”
Section: Gesture Recognitionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the opposite direction, this value would be negative. From this relationship the Wiimote orientation [16] can be computed. …”
Section: Gesture Recognitionmentioning
confidence: 99%
“…Bell Laboratories [9] and IBM Research [16] have had the best results for handwriting recognition with probabilistic and statistic methods. Similar projects like WiiGee [20], GesApp [6], part of the Google Summer of Code 2008, and [18] have been developed to evaluate and extract features of trajectories and movements taken from accelerometers.…”
Section: Introductionmentioning
confidence: 99%
“…A popular and successful approach in speech and, more recently, handwriting recognition, is to combine linguistic knowledge with the knowledge of a specific feature domain (acoustic features in speech recognition, shape features in handwriting recognition) to form an integrated recognizer (decoder). A common technique is to embed feature models (often HMMs) into a language model by replacing each transition in the language model with the feature model of the corresponding symbol (Bahl & Jelinek, 1983;Hu, Brown & Turin, 1994;Makhoul, Starner, Schwartz & Chou, 1994;Nathan, Beigi, Subrahmonia, Cleary & Maruyama, 1995). There are also less integrated approaches where the language model network is multiplied by a segmentation network where each transition is weighted by a score generated by the corresponding symbol recognizer (Bengio, Cun & Henderson, 1994;Schenkel, Guyon & Henderson, 1995).…”
Section: Probabilistic Automata In Language Modelingmentioning
confidence: 99%
“…In [5] the framework for a writer independent large vocabulary recognition system is discussed. Although, such systems offer the user the convenience of operation 'out ofthe box', i.e.…”
Section: Introductionmentioning
confidence: 99%