Abstract
In hyperspectral image analysis, the classification task has generally been addressed jointly with dimensionality reduction due to both the high correlation between the spectral features and the noise present in spectral bands, which might significantly degrade classification performance. In supervised classification, limited training instances in proportion with the number of spectral features have negative impacts on the classification accuracy, which is known as Hughes effects or curse of dimensionality in the literature. In this paper, we focus on dimensionality reduction problem, and propose a novel feature-selection algorithm, which is based on the method called high dimensional model representation. The proposed algorithm is tested on some toy examples and hyperspectral datasets in comparison with conventional feature-selection algorithms in terms of classification accuracy, stability of the selected features and computational time. The results show that the proposed approach provides both high classification accuracy and robust features with a satisfactory computational time.
Original language | English |
---|---|
Article number | 7886329 |
Pages (from-to) | 2918-2928 |
Number of pages | 11 |
Journal | IEEE Transactions on Image Processing |
Volume | 26 |
Issue number | 6 |
DOIs | |
Publication status | Published - Jun 2017 |
Bibliographical note
Publisher Copyright:© 1992-2012 IEEE.
Keywords
- Dimensionality reduction
- feature selection
- high dimensional model representation
- hyperspectral image classification