Browse Prior Art Database

Fast Three-Stage Matcher for Online Handwritten Character Recognition

IP.com Disclosure Number: IPCOM000119570D
Original Publication Date: 1991-Feb-01
Included in the Prior Art Database: 2005-Apr-01
Document File: 1 page(s) / 36K

Publishing Venue

IBM

Related People

Chefalas, TE: AUTHOR [+2]

Abstract

Disclosed is a three-stage matching system that provides fast and accurate recognition of online handwritten characters. The first stage consists of a fast, three-point matcher to reduce the character choices. The second and third stages, previously disclosed (*), consist of a linear matcher to further reduce the character choices and an elastic (non-linear) matcher to provide the required accuracy.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 90% of the total text.

Fast Three-Stage Matcher for Online Handwritten Character Recognition

      Disclosed is a three-stage matching system that provides
fast and accurate recognition of online handwritten characters.  The
first stage consists of a fast, three-point matcher to reduce the
character choices.  The second and third stages, previously disclosed
(*), consist of a linear matcher to further reduce the character
choices and an elastic (non-linear) matcher to provide the required
accuracy.

      Computation speed is critical for online handwriting
recognition systems because such systems usually run on small
stand-alone computers.  The three-point matcher rapidly halves the
choices, for either strokes or characters.  All matching is performed
on a stroke-by- stroke basis and uses the previously-described,
point-distance metric (*).

      The three-point matcher matches the first point of an unknown
stroke to the first of the prototype, the center to the center, and
the last to the last.  The average three-point matching score is
found and serves as a cutoff-threshold.  That is, all prototypes
(strokes or characters, as specified) with three-point matching
scores greater than this cutoff threshold are pruned.

      The three-stage matching system is implemented in C-language
and runs on the IBM RT PC*,  The three-point matcher prunes half the
prototypes, reducing computation time by 25 to 30 percent, while
retaining recognition accuracy.
*  Trademark of IBM Corp...