A fuzzy graph theoretic approach to recognize the totally unconstrained handwritten numerals

作者:

Highlights:

摘要

An automatic off-line character recognition system for totally unconstrained handwritten numerals is presented. The system was trained and tested on the field data collected by the U.S. Postal Services Department from dead letter envelopes. It was trained on 1763 unnormalized samples. The training process produced a feasible set of 105 Fuzzy Constrained Character Graph Models (FCCGMs). FCCGMs tolerate large variability in size, shape and writing style. Characters were recognized by applying a set of rules to match a character tree representation to a FCCGM. A character tree is obtained by first converting the character skeleton into an approximate polygon and then transforming the polygon into a tree structure suitable for recognition purposes. The system was tested on (not including the training set) 1812 unnormalized samples and it proved to be powerful in recognition rate and tolerance to multi-writer, multi-pen, multi-textured paper, and multi-color ink. Reliability, recognition, substitution error, and rejection rates of the system are 97.1, 90.7, 2.9, and 6.4%, respectively.

论文关键词:Off-line character recognition,Skeletonization,Tree structure,Fuzzy numbers,Character graph model

论文评审过程:Received 30 June 1992, Revised 22 January 1993, Accepted 15 March 1993, Available online 19 May 2003.

论文官网地址:https://doi.org/10.1016/0031-3203(93)90139-N