Cursive script recognition using wildcards and multiple experts (Q1606694)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cursive script recognition using wildcards and multiple experts |
scientific article; zbMATH DE number 1771523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cursive script recognition using wildcards and multiple experts |
scientific article; zbMATH DE number 1771523 |
Statements
Cursive script recognition using wildcards and multiple experts (English)
0 references
25 July 2002
0 references
Variability in handwriting styles suggests that many letter recognition engines cannot correctly identify some handwritten letters of poor quality at reasonable computational cost. Methods that are capable of searching the resulting sparse graph of letter candidates are therefore required. The method presented here employs 'wildcards' to represent missing letter candidates. Multiple experts are used to represent different aspects of handwriting. Each expert evaluates closeness of match and indicates its confidence. Explanation experts determine the degree to which the word alternative under consideration explains extraneous letter candidates. Schemata for normalisation and combination of scores are investigated and their performance compared. Hill climbing yields near-optimal combination weights that outperform comparable methods on identical dynamic handwriting data.
0 references
Dynamic handwriting data
0 references
Explanation expert
0 references
Multi-expert combination
0 references
Poor quality handwriting recognition
0 references
Self-confidence
0 references
Wildcard likelihood
0 references
Wildcards
0 references