Recognition experiments with typed numerals from envelopes in the mail

doi:10.1016/0031-3203(69)90012-0

Pattern Recognition

Volume 1, Issue 4, July 1969, Pages 273-289

https://doi.org/10.1016/0031-3203(69)90012-0 Get rights and content

Abstract

Statistically weighted mask, multiple weighted mask, and n-tuple recognition methods were applied to typed numerals taken from envelopes in the mail. The experiments, all on a fairly small scale, were carried out in computer simulation. With one weighted mask per class, one practicable system achieved 0.35 per cent substitution errors with 17 per cent reject errors.

References (19)

W.W. Bledsoe et al.
Trans. IEEE
(1962)
W.W. Bledsoe et al.
C.K. Chow
Trans. IEEE
(1962)
C.K. Chow
Trans. IEEE
(1966)
K.H. Davis et al.
J. Acoust. Soc. Amer.
(1952)
O. Firshein et al.
Trans. IEEE
(1963)
P.M. Hall
Electronics and Power
(April 1968)
W.J. Hannan
W.H. Highleyman
Trans. IRE
(1961)

There are more references available in the full text version of this article.

Cited by (11)

Celebrating 40 years of Pattern Recognition-Introductory remarks
2008, Pattern Recognition
The theoretical and experimental status of the n-tuple classifier
1998, Neural Networks
A number of theoretical approaches related to the n-tuple classification system are reviewed including Kanerva's SDM, the n-tuple regression network, the Hamming distance framework and likelihood estimation. The limitations of these methods are pointed out and resemblances that exist between them are underlined. Large-scale experiments carried out on StatLog project datasets confirm the n-tuple method as a viable competitor to more popular methods due to its speed, simplicity and accuracy on the majority of a wide variety of classification problems. A further investigation into the failure of the method on certain datasets shows its inner workings and reveals two main problems: difficulties with highly skewed class priors and more importantly, a mismatch between the scales involved in generalization, the amount of training data available, and the volume of the region in which data is likely to exist. This highlights areas where improvements in the method are needed and further theoretical progress would be helpful.
A novel system for coloured object recognition
1996, Computers in Industry
Many industrial inspection tasks can be performed satisfactorily by conventional image processing systems which utilise feature extraction and related feature measuring algorithms. However, for the inspection of parameters such as texture or colour, these techniques may be inadequate. This paper outlines a new system which incorporates algorithms for coloured image processing and a logical neural network for subsequent pattern classification. Past research has indicated that logical neural nets can provide quite a good recognition performance for artefacts which are complex. However, in the area of coloured object inspection, the inspection tasks are more difficult. Furthermore, if the lighting source changes, the image of a coloured object will vary considerably and this will significantly affect the outputs of the networks. This paper presents a practical approach for colour invariant recognition and a method of adaptive sampling which utilises colour information more effectively. The system which is armed with these techniques provides a good recognition performance for artefacts which are both complex and coloured and, also, it is robust in terms of tolerance to noise and lighting.
An analysis of discriminatory mechanisms in frequency-weighted memory array pattern classifiers
1989, Pattern Recognition
Cellular logic arrays for pattern classification may be configured in a variety of ways. Although a common configuration is to utilise simply binary weighting of feature samples occurring in a data training set, performance can generally be improved if a more sensitive frequency-of-feature-occurrence weighting scheme is adopted. In this form, a practical problem which must be addressed by the system designer is that of determining an appropriate weight value for features occurring with zero frequency in the training set.
This paper discusses the difficulties encountered in attempting to make a global selection of the zero frequency component in discriminant function computation and, by examining the processing mechanisms of the classifier, points to the characteristics of data set composition which might allow an effective choice of this parameter on a more local basis. This is found to offer practical advantages in structuring a classifier, particularly since the optimisation procedures adopted appear to be directly compatible with an established multi-level classifier architecture.
A comparison of selected pattern recognition functions
1977, Pattern Recognition
In this study computer simulation is used to compare selected pattern recognition functions. The Highleyman deck of 50 hand written characters provides one comparative data base. A second data base is derived from multispectral infrared sensor data taken over California's Imperial Valley. Emphasis is placed on comparing the classical minimum distance recognition functions with two new recognition functions introduced in a recent predecessor article.
A class of error tolerant pattern discrimination functions
1977, Pattern Recognition

View all citing articles on Scopus

^∗: Dr. Ullmann is now in the Division of Computer Science, National Physical Laboratory, Teddington, Middlesex, England.

^†: Mr. Kidd is now in the Department of Electrical Engineering Science, Essex University, Colchester, Essex, England.

View full text

Recognition experiments with typed numerals from envelopes in the mail

Abstract

Trans. IEEE

Trans. IEEE

Trans. IEEE

J. Acoust. Soc. Amer.

Trans. IEEE

Electronics and Power

Trans. IRE