Recognizing On-Line Handwritten Alphanumeric Characters Through Flexible Structural Matching

DMCA

Recognizing On-Line Handwritten Alphanumeric Characters Through Flexible Structural Matching (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Kam-Fai Chan , Dit-Yan Yeung

Citations:

49 - 3 self

BibTeX

@MISC{Chan99recognizingon-line,
    author = {Kam-Fai Chan and Dit-Yan Yeung},
    title = {Recognizing On-Line Handwritten Alphanumeric Characters Through Flexible Structural Matching},
    year = {1999}
}

OpenURL

Abstract

Speed, accuracy, and flexibility are crucial to the practical use of on-line handwriting recognition. Besides, extensibility is also an important concern as we move from one domain to another which requires the character set to be extended. In this paper, we will propose a simple yet robust structural approach for recognizing on-line handwriting. Our approach is designed to achieve reasonable speed, fairly high accuracy and sufficient tolerance to variations. At the same time, it maintains a high degree of reusability and hence facilitates extensibility. Experimental results show that the recognition rates are 98.60% for digits, 98.49% for uppercase letters, 97.44% for lowercase letters, and 97.40% for the combined set. When the rejected cases are excluded from the calculation, the rates can be increased to 99.93%, 99.53%, 98.55% and 98.07%, respectively. On the average, the recognition speed is about 7.5 characters per second running in Prolog on a Sun SPARC 10 Unix workstation and the m...

Keyphrases

uppercase letter sufficient tolerance unix workstation practical use robust structural approach important concern combined set reasonable speed second running on-line handwriting high accuracy on-line handwriting recognition hence facilitates extensibility recognition speed experimental result high degree sun sparc lowercase letter recognition rate

DMCA