A simulation, on an IBM 709 computer, of a pattern-recognition system using an initial man-machine learning phase. Transformations on a deformed set of 48 samples of each of ten numerals are used to form separation filters, while a second set of 480 similarly varied numerals serve as the "unknown" characters that are examined. Measured probability density distributions of the inked areas of all characters are established, and a weighted stencil or filter is created to distinguish each character relative to the possible set of characters. This experiment demonstrates the extent to which the actual value of the best "score of match" between the unknown and each character in the set provides confidence in recognition. Whenever the best score is too low, it is possible to call for more complex processes to aid recognition permitting the construction of recognition systems of greater accuracy than the basic reading mechanism.
This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.