By Topic

Fast Hyperspectral Feature Reduction Using Piecewise Constant Function Approximations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jensen, A.C. ; Oslo Univ., Oslo ; Solberg, R.

The high number of spectral bands that are obtained from hyperspectral sensors, combined with the often limited ground truth, solicits some kind of feature reduction when attempting supervised classification. This letter demonstrates that an optimal constant function representation of hyperspectral signature curves in the mean square sense is capable of representing the data sufficiently to outperform, or match, other feature reduction methods such as principal components transform, sequential forward selection, and decision boundary feature extraction for classification purposes on all of the four hyperspectral data sets that we have tested. The simple averaging of spectral bands makes the resulting features directly interpretable in a physical sense. Using an efficient dynamic programming algorithm, the proposed method can be considered fast.

Published in:

Geoscience and Remote Sensing Letters, IEEE  (Volume:4 ,  Issue: 4 )