By Topic

The use of threshold logic in character recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Akers, S.B., Jr. ; General Electric Electronics Laboratory, Syracuse, N. Y. ; Rutter, B.H.

The fact that many complex counting and decision functions can be realized quite simply with threshold gates suggests that they may be used to considerable advantage in problems of character recognition. A simplified recognition problem is considered involving the identification of any one of 12 letters when it is superimposed on an m × n matrix. Translation, stretching, and compression of the letter are permitted. It is shown that the number of threshold gates required increases linearly as do the dimensions of the matrix with about 300 gates being necessary for a 20 × 20. On such a matrix, several hundred thousand configurations of the 12 letters can be correctly identified with each pattern being insensitive to varying degrees of "noise." A threshold gate having the necessary fan power for this application is described together with its implementation in a small experimental model. Extensions of the methods to include rotation and magnification are discussed.

Published in:

Proceedings of the IEEE  (Volume:52 ,  Issue: 8 )