Marginalized Graph Self-Representation for Unsupervised Hyperspectral Band Selection

Abstract

Unsupervised band selection is an essential step in preprocessing hyperspectral images (HSIs) to select informative bands. Most existing methods exploit the spatial information from the entire HSI while ignoring the difference between diverse homogeneous regions. Moreover, traditional methods utilize the limited size of data for model training that may result in degraded generalization performance. In this article, we propose a marginalized graph self-representation (MGSR) method for unsupervised hyperspectral band selection. To explore the spatial information from diverse homogenous regions, MGSR generates the segmentations of an HSI by superpixel segmentation and records the relationships between adjacent pixels of the same segmentation in a structural graph. Meanwhile, to improve the generalization and robustness, infinite corrupted samples are obtained from the original pixels by introducing noises in spectral bands for model training. To solve the proposed formulation, we design an alternating optimization algorithm to marginalize out the corruption and search for the optimal solution. Experimental studies on HSI datasets demonstrate the effectiveness of the proposed MGSR and the superiority over the state-of-the-art methods. The source code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/ZhangYongshan/MGSR</uri> .