Referenced Items are not available for this document.
Each character can be regarded as a string of strokes with each stroke being represented by the type of the stroke. The stroke string is constructed according to the writing order of the strokes. After the type of each stroke has been recognized, a matching algorithm is used to compute the distances between the input character and reference characters. The matching process is carried out in two ways, forward and backward. The authors artificially generated a database for simulating the performance upgrading by using two-way matching instead of one-way matching on stroke strings. The simulation shows that two-way matching works much better than one-way matching when some strokes are misrecognized, omitted, or missequenced.<
Published in:
Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
(Volume:1
)
Date of Conference: 27-30 April 1993
- Page(s):
- 645 - 648 vol.1
- Meeting Date :
- 27 Apr 1993-30 Apr 1993
- ISSN :
- 1520-6149
- Print ISBN:
- 0-7803-7402-9
- INSPEC Accession Number:
- 4758476
- Conference Location :
- Minneapolis, MN, USA
- Digital Object Identifier :
- 10.1109/ICASSP.1993.319201
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
