High-Order Graph Regularized Sparse Projection for Unsupervised Hyperspectral Band Selection
Abstract
Hyperspectral images (HSIs) usually contain hundreds of highly correlated spectral bands, which may introduce severe redundancy, high computational cost, and the Hughes phenomenon. Band selection (BS) reduces spectral dimensionality by selecting a compact subset of original bands while preserving their physical interpretability. However, existing methods mainly exploit pairwise spectral or spatial dependencies, leaving complex high-order correlations insufficiently characterized. Moreover, manifold preservation and sparse BS are rarely integrated into a unified framework. To address these issues, this article proposes a high-order graph-regularized sparse projection method for unsupervised hyperspectral BS. Based on region-level samples generated by superpixels, the method constructs a high-order graph through multistep neighborhood propagation, thereby alleviating the limitations of traditional first-order graphs in characterizing complex sample relationships and more comprehensively capturing the intrinsic structure of HSI data. Moreover, self-representation learning, graph regularization, and row-sparse projection are integrated into a unified optimization framework. Graph consistency and Laplacian regularization preserve high-order structural relationships and local manifold information, while row sparsity enables explicit estimation of band importance. Consequently, the proposed method selects a compact band subset with strong discriminative capability and representativeness while reducing spectral redundancy. The source code is available at https://github.com/CPREgroup/hogrsp