Computer-Automated Design of Multifont Print Recognition Logic

A computer program has been written to design character recognition logic based on the processing of data samples. This program consists of two subroutines: (1) to search for logic circuits having certain constraints on hardware design, and (2) to evaluate these logics in terms of their discriminating ability over samples of the character set they are expected to recognize. An executive routine is used to apply these subroutines to select a complete logic with a given performance and complexity. This logic consists of 39 to 96 AND gates connected to a shift register and a table look-up or resistance network comparison system. The methods were applied to the design of recognitionl ogics for the 52 upper and lower case characters of IBM Electric Modern Pica type font and lower case Cyrillic characters scanned from Russian text. In both cases when the logics were tested on data different from that used to design the logics, the substitution rate was about one error per thousand. A single logic was designed to read two different Cyrillic fonts. For this design, an error rate of one error per hundred characters was observed. Several experiments are reported ona number of logics designed for typewritten data, and single- and two-font Cyrillic data. The performances of different recognitionsy stems are compared as a function of the complexity of the recognition logics.

[1]  Philip M. Woodward,et al.  Probability and Information Theory with Applications to Radar , 1954 .

[2]  O. G. Selfridge,et al.  Pattern recognition and modern computers , 1899, AFIPS '55 (Western).

[3]  D. Lindley.  On a Measure of the Information Provided by an Experiment , 1956 .

[4]  J. C. Shaw,et al.  Empirical explorations of the logic theory machine: a case study in heuristic , 1899, IRE-AIEE-ACM '57 (Western).

[5]  Philip M. Lewis,et al.  Approximating Probability Distributions to Reduce Storage Requirements , 1959, Information and Control.

[6]  H. Gelernter,et al.  Realization of a geometry theorem proving machine , 1995, IFIP Congress.

[7]  R. J. Evey,et al.  Use of a computer to design character recognition logic , 1899, IRE-AIEE-ACM '59 (Eastern).

[8]  W. W. Bledsoe,et al.  Pattern recognition and reading by machine , 1959, IRE-AIEE-ACM '59 (Eastern).

[9]  Frank Rosenblatt,et al.  Perceptron Simulation Experiments , 1960, Proceedings of the IRE.

[10]  L. P. Horwitz,et al.  Pattern Recognition Using Autocorrelation , 1961, Proceedings of the IRE.

[11]  David N. Freeman.  Computer Synthesis of Character-Recognition Systems , 1961, IRE Trans. Electron. Comput..

[12]  Marvin Minsky,et al.  A Selected Descriptor-Indexed Bibliography to the Literature on Artificial Intelligence , 1961 .

[13]  Leonard Uhr,et al.  A pattern recognition program that generates, evaluates, and adjusts its own operators , 1961, IRE-AIEE-ACM '61 (Western).

[14]  Wilbur H. Highleyman,et al.  An Analog Method for Character Recognition , 1961, IRE Trans. Electron. Comput..

[15]  Marvin Minsky,et al.  Steps toward Artificial Intelligence , 1995, Proceedings of the IRE.

[16]  John J. Leimer.  Design factors in the development of an optical character recognition machine , 1962, IRE Trans. Inf. Theory.

[17]  Philip M. Lewis,et al.  The characteristic selection problem in recognition systems , 1962, IRE Trans. Inf. Theory.

[18]  R. E. Bonner,et al.  A "Logical Pattern" Recognition Program , 1962, IBM J. Res. Dev..