Structural graph learning method for hyperspectral band selection

Recently, graph learning-based hyperspectral band selection algorithms illustrate impressive performance for hyperspectral image (HSI) processing, whose goal is to select an optimal band combination containing less redundancy through the learned graph matrix. However, most of the previous methods work in single spectral domain, which neglects the rich image spatial information. Moreover, they typically model the graph matrix from a global perspective while ignoring the differences in spatial distribution that exist in diverse pixel and band regions. Based on the above considerations, to take full account of structure information in spatial and spectral domains, a structural graph learning method for hyperspectral band selection (SGLM) is designed. Specifically, SGLM constructs two matrices using the correlation between pixels and bands under the local perspective, which can capture the image structure information reasonably. Since the proposed method is modelled in both spatial and spectral dimensions, it is conducive to subsequent band subset generation task. Meanwhile, in order to guarantee local spatial consistency among bands, a Laplacian regularization term associated with the error matrix is introduced to the self-representation model. Additionally, considering that the importance of a band is consistent with its capability to reconstruct the entire band set, an adjacent bands reconstruction strategy is adopted to obtain the ultimate band combination, which can assess the significance of each band effectively. The comprehensive experimental analysis on four datasets demonstrates that the proposed SGLM model has outstanding superiority in comparison with several band selection algorithms.