论文信息 - A new character recognition scheme with lower ambiguity and higher recognizability

A new character recognition scheme with lower ambiguity and higher recognizability

The concepts of degrees of recognizability, learnability and ambiguity for handwritten characters are investigated. It is shown that ambiguity plays a key role as a criterion of recognizability as well as learnability. Two experiments using two different categories of recognition schemes have been conducted. It is shown that the one with a lower degree of ambiguity possesses an inherent advantage of recognition. Several topics of future research are also discussed.

Patrick Shen-Pei Wang

[1] Fumihiko Kimura,et al. An Interactive Geometrical Design System with Handwriting Input , 1977, IFIP Congress.

[2] Herbert Freeman,et al. On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[3] Patrick Shen-pei Wang,et al. An application of array grammars to clustering analysis for syntactic patterns , 1984, Pattern Recognit..

[4] M Berthod,et al. Learning in syntactic recognition of symbols drawn on a graphic tablet , 1979 .

[5] Constantin Virgil Negoita,et al. CYBERNETICS AND SOCIETY , 1982 .

[6] M. Berthod,et al. Automatic recognition of handprinted characters—The state of the art , 1980, Proceedings of the IEEE.

[7] Theodosios Pavlidis,et al. Syntactic Recognition of Handwritten Numerals , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[8] King-Sun Fu,et al. A Clustering Procedure for Syntactic Patterns , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[9] Richard M. Brown,et al. On-Line Computer Recognition of Handprinted Characters , 1964, IEEE Trans. Electron. Comput..

[10] L. D. Harmon,et al. Automatic recognition of print and script , 1972 .

[11] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .