By Topic

A new stroke string matching algorithm for stroke-based on-line character recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Q. -Z. Wu ; Telecommun. Lab., Min. of Transp. & Commun., Chung-Li, Taiwan ; B. -S. Jeng ; Y. -F. Kuan ; K. -S. Chou
more authors

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