Paper
2 July 1998 Optimal feature extraction for normally distributed data
Chulhee Lee, Euisun Choi, Jaehong Kim
Author Affiliations +
Abstract
In this paper, we propose an optimal feature extraction method for normally distributed data. The feature extraction algorithm is optimal in the sense that we search the whole feature space to find a set of features which give the smallest classification error for the Gaussian ML classifier. Initially, we start with an arbitrary feature vector. Assuming that the feature vector is used for classification, we compute the classification error. Then we move the feature vector slightly in the direction so that the classification error decreases most rapidly. This can be done by taking gradient. We propose two search methods, sequential search and global search. In the sequential search, if more features are needed, we try to find an additional feature which gives the best classification accuracy with the already chosen features. In the global search, we are not restricted to use the already chosen features. Experiment results show that the proposed method outperforms the conventional feature extraction algorithms.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chulhee Lee, Euisun Choi, and Jaehong Kim "Optimal feature extraction for normally distributed data", Proc. SPIE 3372, Algorithms for Multispectral and Hyperspectral Imagery IV, (2 July 1998); https://doi.org/10.1117/12.312603
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Feature extraction

Image classification

Principal component analysis

Space reconnaissance

Matrices

Pattern recognition

Statistical analysis

Back to Top