A shape analysis model with applications to a character recognition system

A method for the recognition of multifont printed characters is proposed, giving emphasis to the identification of structural descriptions of character shapes using prototypes. Noise and shape variations are modeled as series of transformations from groups of features in the data to features in each prototype. Thus, the method manages systematically the relative distortion between a candidate shape and its prototype, accomplishing robustness to noise with less than two prototypes per class, on the average. Our method uses a flexible matching between components and a flexible grouping of the individual components to be matched. A number of shape transformations are defined. Also, a measure of the amount of distortion that these transformations cause is given. The problem of classification of character shapes is defined as a problem of optimization among the possible transformations that map an input shape into prototypical shapes. Some tests with hand printed numerals confirmed the method's high robustness level.<<ETX>>

[1]  Minsoo Suk,et al.  On machine recognition of hand-printed Chinese characters by feature relaxation , 1988, Pattern Recognit..

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  S. V. Rice A report on the accuracy of OCR devices , 1992 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Ching Y. Suen,et al.  Historical review of OCR research and development , 1992, Proc. IEEE.

[6]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[7]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Ching Y. Suen,et al.  Hierarchical attributed graph representation and recognition of handwritten chinese characters , 1991, Pattern Recognit..

[9]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[10]  Neil Robertson,et al.  Disjoint Paths—A Survey , 1985 .

[11]  Theodosios Pavlidis,et al.  On the Recognition of Printed Characters of Any Font and Size , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Mindy Bokser,et al.  Omnidocument technologies , 1992, Proc. IEEE.

[13]  Theodosios Pavlidis,et al.  Direct Gray-Scale Extraction of Features for Character Recognition , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Leon A. Pintsov One view of the methodology in handwriting character recognition , 1992, Electronic Imaging.

[15]  Ching Y. Suen,et al.  Structural classification and relaxation matching of totally unconstrained handwritten zip-code numbers , 1988, Pattern Recognit..

[16]  David J. Burr,et al.  Elastic Matching of Line Drawings , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[18]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.