Floating search methods in feature selection
Pattern Recognition Letters
Adaptive floating search methods in feature selection
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Neural Networks for Pattern Recognition
Neural Networks for Pattern Recognition
Fast Branch & Bound Algorithms for Optimal Feature Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Adaptive branch and bound algorithm for selecting optimal features
Pattern Recognition Letters
A Direct Method of Nonparametric Measurement Selection
IEEE Transactions on Computers
A Branch and Bound Algorithm for Feature Subset Selection
IEEE Transactions on Computers
IEEE Transactions on Image Processing
Hi-index | 0.00 |
Multispectral and polarimetric data have been shown to provide detailed information useful for automatic target recognition applications. A major limitation of using these data in remote sensing is that they often consist of a large number of features with an inadequate number of samples. To reduce the number of features, we thus present a new generalized steepest ascent feature selection technique that selects only a small subset of important features to use for classification. Our proposed algorithm improves upon the prior steepest ascent algorithm by selecting a better starting search point and performing a more thorough search. It is guaranteed to provide solutions that equal or exceed those of the classical sequential forward floating selection algorithm. Initial results for one multispectral and polarimetric data set show that our algorithm yields better classification results than other suboptimal search algorithms.