scispace - formally typeset
Search or ask a question

Showing papers on "Feature (machine learning) published in 1968"


Journal ArticleDOI
George Nagy1
01 Jan 1968
TL;DR: This paper reviews statistical, adaptive, and heuristic techniques used in laboratory investigations of pattern recognition problems and includes correlation methods, discriminant analysis, maximum likelihood decisions minimax techniques, perceptron-like algorithms, feature extraction, preprocessing, clustering and nonsupervised learning.
Abstract: This paper reviews statistical, adaptive, and heuristic techniques used in laboratory investigations of pattern recognition problems. The discussion includes correlation methods, discriminant analysis, maximum likelihood decisions minimax techniques, perceptron-like algorithms, feature extraction, preprocessing, clustering and nonsupervised learning. Two-dimensional distributions are used to illustrate the properties of the various procedures. Several experimental projects, representative of prospective applications, are also described.

317 citations


Journal ArticleDOI
TL;DR: It is found that, with these defined criteria, an optimal selection and ordering procedure can be obtained by establishing a generalized Karhunen-Lo-Lo coordinate system for the stochastic processes describing the input patterns.
Abstract: A method is proposed to aid the designer in selecting and ordering the feature observations for the pattern recognition system, without requiring the computation of the probability of misrecognition or the complete knowledge of the probability distribution for the input patterns under consideration. The essential viewpoint is basically that of pre-weighting the feature observations according to their relative importance in describing the input patterns, regardless of the specific decision structure in a recognition system. “Relative importance≓ is defined in the sense of (1) committing less error when the representation of patterns is subject to approximation due to the finite number of feature observations, and (2) carrying more information regarding the discrimination of pattern classes. It is found that, with these defined criteria, an optimal selection and ordering procedure can be obtained by establishing a generalized Karhunen-Lo\`eve coordinate system for the stochastic processes describing the input patterns. Necessary and sufficient conditions for a set of coordinates to be the generalized K\2-L system are derived and the resulting selection and ordering procedure is given. Computer-simulated experiments in character recognition are presented to illustrate the effectiveness of this method.

63 citations



Journal ArticleDOI
TL;DR: The design approaches which were used to specify feature measurement logic, recognition reference standards, and decision functions for a multifont character recognition system are discussed and the importance of an intuitive approach to design is emphasized.
Abstract: The design approaches which were used to specify feature measurement logic, recognition reference standards, and decision functions for a multifont character recognition system are discussed. The importance of an intuitive approach to design, as opposed to a fully automated approach, is emphasized. The nature of the problem required an intimate Interaction between the designers, who investigated complex pattern recognition problems and proposed design alternatives, and the computer, which relieved the designer of routine testing and evaluation of the tentative design.

25 citations


Journal ArticleDOI
TL;DR: This paper discusses the selection of mathematical features on the basis of entropy minimization and introduces the concept of extracting statistical features by the method of kernel approximation.

23 citations


Patent
13 Nov 1968
TL;DR: In this paper, a pattern recognition device comprises search means which are controlled initially to make a systematic search of a pattern presented for classification and produce signals descriptive of the features, and storage means in which are stored (a) a list of likelihoods of classes for given features, (b) likelihoods for features for given classes, and (c) a mean distances between features.
Abstract: A pattern recognition device comprises search means which are controlled initially to make a systematic search of a pattern presented for classification and produce signals descriptive of the features. It also comprises storage means in which are stored (a) a list of likelihoods of classes for given features, (b) a list of likelihoods of features for given classes, and (c) a list of mean distances between features for given classes. These lists may be built up during a self-organizing mode of operation of the device. The device further includes prediction means which, when a given number of features have been described by the search means, utilizes these features and the lists in the storage means and predicts the most likely class of the presented pattern, another feature likely to be associated with the features already described, and the locality of said feature. The control of the search means is then passed to the prediction means which cause a search to be carried out in the predicted locality. A signal produced as the result of the search in the predicted locality may be used either in a further prediction or to cause the systematic search to be resumed.

20 citations


Patent
Chao K Chow1, Chao N Liu1
28 Mar 1968
TL;DR: In this article, an adaptive notation recognition system is presented, in which the set of features having the highest value of factual information is calculated and weighted according to a set of metrics.
Abstract: AN ADAPTIVE PATTERN RECOGNITION SYSTEM IS PROVIDED WHICH CALCULATES THE MUTUAL INFORMATION PROVIDED BY PAIRS OF FEATURES EXTRACTED BY A FEATURE EXTRACTING DEVICE. THE RELATIVE MAGNITUDES OF MUTUAL INFORMATION ARE DETECTED SERIATIM AND A CLOSED LOOP AVOIDANCE MODULE PREVENTS FORMING A CLOSED LOOP, TO RETAIN A STATISTICAL TREE RELATIONSHIP. PATTERN LOGIC STORES THE SET OF PAIRS HAVING HIGHEST VALUES OF MUTUAL INFORMATION. THEN THE SYSTEM IS PREPARED TO OPERATE A RECOGNITION SYSTEM. THE INDIVIDUAL FEATURES ARE WEIGHTED, ACCORDING TO STATISTICAL ANALYSIS, BY ANALOGUE COMPUTERS. ALSO, THE PAIRS OF INFORMATION ARE GATED AND WEIGHTED FOR EACH PATTERN IN ACCORDANCE WITH STATISTICAL WEIGHTING PRINCIPLES. THE SUMMING NETWORK FOR A PLURALITY OF PATTERNS ARE COMPARED IN A MAXIMUM DETECTOR FOR ULTIMATE RECOGNITION OF THE MOST LIKELY PATTERN IDENTIFICATION.

18 citations


Proceedings ArticleDOI
H. Ryan1
01 Dec 1968
TL;DR: The use of performance measures for selecting features in pattern recognition systems is reviewed and an approximation to the information content measure is derived that reduces the computation required to calculate the measure.
Abstract: The use of performance measures for selecting features in pattern recognition systems is reviewed. An approximation to the information content measure is derived. The approximation reduces the computation required to calculate the measure. The accuracy of the approximation depends directly on the nature of the patterns and their features. Computational requirements for the approximate measure are specified.

15 citations


Journal ArticleDOI
TL;DR: Three suboptimal solutions are obtained for the joint sequential feature selection and pattern classification problem and these solutions allow the comparison of two distinctly different approximations to the optimal procedure.
Abstract: —In this note, three suboptimal solutions are obtained for the joint sequential feature selection and pattern classification problem. These solutions allow the comparison of two distinctly different approximations to the optimal procedure. One approximation involves simplifying assumptions on the underlying distribution of features for each pattern class, while the second involves an approximation in the implementation of the optimal procedure.

7 citations


Journal ArticleDOI
01 Jun 1968
TL;DR: In this article, two versions of an unsupervised learning algorithm for pattern recognition are compared by means of numerical calculations based on two-dimensional ellipsoidal pattern distributions, and the results show that one of them outperforms the other.
Abstract: Two versions of an unsupervised learning algorithm for pattern recognition are compared by means of numerical calculations based on two-dimensional ellipsoidal pattern distributions.

7 citations


Patent
Shinji Yamamoto1
05 Mar 1968
TL;DR: In this paper, the face of a CHARACTERM is divided into three zones and scanned in VERTICAL and HORIZONTAL directions by means of a SCANNER to be converted into time series series digital signals.
Abstract: THE CHARACTER FACE IS DIVIDED INTO THREE ZONES AND SCANNED IN VERTICAL AND HORIZONTAL DIRECTIONS BY MEANS OF A SCANNER TO BE CONVERTED INTO TIME SERIES DIGITAL SIGNALS IN RESPONSE TO THE PRESENCE OF A CHARACTER IMAGE, WHICH DIGITAL SIGNALS ARE FED TO CASCADE CONNECTED THREE DYNAMIC MEMORIES. FROM THE FIGITAL SIGNALS STORED IN THE DYNAMIC MEMORIES STROKE FEATURES ARE DETECTED BY A FEATURE DETECTING DEVICE. THE CHARACTER IS RECOGNIZED BY IDENTIFYING THE COMBINATION OF THE STROKE FEATURES BY MEANS OF A CHARACTER IDENTIFYING DEVICE. THE CHARACTER RECOGNITION APPARATUS OF THE INVENTION IS SIMPLE IN STRUCTURE AND FREE FROM NOISE DISTURBANCE.

Proceedings ArticleDOI
01 Dec 1968
TL;DR: A general method to find non-linear transformations for discrete data in information processing problems that is random perturbation of the data subject to constraints which ensure that in the transformed space the problem is in some sense simpler.
Abstract: A general method is proposed to find non-linear transformations for discrete data in information processing problems The main feature of the method is random perturbation of the data subject to constraints which ensure that in the transformed space the problem is in some sense simpler The technique has been applied to pattern recognition by finding a nonlinear transformation of the feature space such that all classes become linearly separable


11 Dec 1968
TL;DR: The fundamentals of the statistical theory of recognition and consideration of the practical application of this theory are discussed and a wide range of problems such as the definition of classes, characteristics, solution criteria, of the recognition process, structure of recognition systems and special theory applications are analyzed.
Abstract: : The book is devoted to the recognition of random objects and phenomena of a distinctive physical nature. The fundamentals of the statistical theory of recognition and consideration of the practical application of this theory are discussed. The analysis of recognition models encompasses a wide range of problems such as the definition of classes, characteristics, solution criteria, of the recognition process, structure of recognition systems and special theory applications. The analysis is accompanied by numerical examples. Considerable attention is paid to the recognition of images, radio signals, sounds of speedy weather prognosis, and medical diagnosis. The community of models makes it possible to utilize the methods developed in other fields.