Summary
The aim is to design a machine which is able to learn a number of idealised characters and to recognise them, irrespective of their size, position and context on an infinite retina. If the number of characters which such a machine can possibly learn to recognise is astronomical, it is not practical to use separate templates for every possible character. It is more economical to use, instead, templates for various parts, called features, of characters. In recognising a number of characters simultaneously, without scanning, the question arises of how to tell which feature belongs to which character of figure on the retina. In particular, if a given character is not present but all its features are included in nonsense figures simultaneously present on the retina then the machine must not indicate the presence of the given character. The technique which overcomes this difficulty employs overlapping features which must be mutually consistent for recognition. This consistency technique is assessed by comparison with a more conventional technique, and the work is restricted to closed line characters which are not subject to deformations or mutilations.
Similar content being viewed by others
References
Bomba, J. S.: Alpha-numeric character recognition using local operations. Proc. Eastern Joint Computer Conf. 1959, p. 218.
Kamentsky, L. A.: Pattern and character recognition - picture processing by nets of neuron-like elements. Proc. Western Joint Computer Conf. 1959, p. 304.
Minsky, M., and O. G. Selfridge: Learning in random nets. Fourth London Symposium on Information Theory, 1960, p. 335. London: Butterworths 1961.
Ullmann, J. R.: Article to be included in a Festschrift published in honour of Norbert Wiener 1964.
Unger, S. H.: A computer orientated towards spatial problems. Proc. Western Joint Computer Conf. 1958, p. 234.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ullmann, J.R. Parallel recognition of idealised line characters. Kybernetik 2, 221–226 (1965). https://doi.org/10.1007/BF00306418
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00306418