Experiments with Highleyman's Data
IEEE Transactions on Computers
Experiments in the recognition of hand-printed text, part I: character recognition
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Algorithms for Recognizing Contour-Traced Handprinted Characters
IEEE Transactions on Computers
Interactive Pattern Analysis and Classification
IEEE Transactions on Computers
A pictorial dictionary for printed Farsi subwords
Pattern Recognition Letters
Fast stroke matching by angle quantization
Proceedings of the First International Conference on Immersive Telecommunications
Off-line cursive script recognition: current advances, comparisons and remaining problems
Artificial Intelligence Review
Syntax optimization for and parsing of patterns
Computer Languages
| Hi-index | 14.99 |
Recognition experiments have been performed on handprinted characters using a set of features which has not been applied previously to handprinting. Glucksman's "characteristic loci" were utilized in experiments with the well-known Highleyman data, as well as samples generated at Stanford Research Institute and Honeywell. Two recognition algorithms were tested. Results on numeric samples compare favorably with those of other investigators despite the small dimensionality of the feature vector. On the constrained Honeywell samples, recognition rates exceeding 98 percent were achieved using the simpler algorithm. With alphabetic samples, some problems remain in resolving persistent ambiguities, and methods for attacking these problems are considered.