Skip to main content

Unsupervised hyperspectral band selection using ranking based on a denoising error matching approach

Buy Article:

$71.00 + tax (Refund Policy)

In this paper, we focus on utilizing the image denoising method for ranking of significant bands in hyperspectral imagery. We make use of the fact that the denoising error of bands varies with the significant information content of the bands in hyperspectral imagery. The denoising error is computed for each band individually and compared using a matching parameter with the denoising error of a reference image. The reference image is selected to be the first principal component corresponding to the maximum information. Three matching parameters including mutual information (MI), correlation coefficient (r) and the structural similarity index (SSIM) were used for ranking the bands based on the match with the denoising error of the reference image. The proposed algorithm is tested using three datasets, namely, Indian Pines, Salinas and Dhundi. The Indian Pines and Salinas datasets were acquired from the Airborne Visible Infrared Imaging Spectrometer (AVIRIS) sensor and comprised rural and agricultural area. The Dhundi dataset of Hyperion comprises mostly of features corresponding to snow-covered mountainous regions. To assess the accuracy of the proposed method, a supervised classification was carried out using a random forest classifier with 20% training pixels selected randomly from the ground reference. The proposed method yielded significantly better results determined by the kappa coefficient (κ) of 0.756, 0.910 and 0.996 for the Indian Pines, Salinas and Dhundi datasets, respectively, over several other state of the art methods. The classification results of the proposed method also yielded better results than those obtained by the state-of-the-art methods for hyperspectral band selection.

Document Type: Research Article

Affiliations: Geoinformatics, Department of Civil Engineering, Indian Institute of Technology Kanpur, Kanpur, India

Publication date: 18 October 2019

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content