An algorithm for optimal single linear feature extraction from several gaussian pattern classes
Author(s) -
Scott A. Starks,
Rui J. P. de Figueiredo,
David La Rooy
Publication year - 1977
Publication title -
international journal of computer and information sciences
Language(s) - English
Resource type - Journals
ISSN - 0091-7036
DOI - 10.1007/bf00991482
Subject(s) - feature (linguistics) , divergence (linguistics) , gaussian , pattern recognition (psychology) , algorithm , feature extraction , feature vector , mathematics , set (abstract data type) , computer science , artificial intelligence , philosophy , linguistics , physics , quantum mechanics , programming language
A computational algorithm is presented for the extraction of an optimal single linear feature from several Gaussian pattern classes. The algorithm minimizes the increase in the probability of misclassification in the transformed (feature) space. The general approach used in this procedure was developed in a recent paper by R. J. P. de Figueiredo.(1) Numerical results on the application of this procedure to the remotely sensed data from the Purdue C1 flight line as well asLandsat data are presented. It was found that classification using the optimal single linear feature yielded a value for the probability of misclassification on the order of 30% less than that obtained by using the best single untransformed feature. The optimal single linear feature gave performance results comparable to those obtained by using the two features which maximized the average divergence. Also discussed are improvements in classification results using this method when the size of the training set is small.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom