Sparse Hyperspectral Band Selection Based on Expectation Maximization

Hyperspectral band selection seeks to identify a compact subset of informative spectral channels that preserves task-relevant information while mitigating the storage, transmission, and computational burdens imposed by high-dimensional data. Yet prevailing techniques face two pervasive limitations:...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology p. 1
Main Authors: Gao, Likun, Xue, Xinhui, Zheng, Haowen
Format: Journal Article
Language:English
Published: IEEE 2025
Subjects:
Clustering algorithms
Computational efficiency
Computational modeling
Correlation
EM algorithm
Encoding
Faces
Hyperspectral band selection
hyperspectral image classification
Hyperspectral imaging
Redundancy
sparse learning
Training
Transformers
ISSN:1051-8215, 1558-2205
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hyperspectral band selection seeks to identify a compact subset of informative spectral channels that preserves task-relevant information while mitigating the storage, transmission, and computational burdens imposed by high-dimensional data. Yet prevailing techniques face two pervasive limitations: (i) scoring- or ranking-based methods assess bands independently, overlooking the joint dependency that determine their true utility; and (ii) combinatorial search approaches, though theoretically exhaustive, require prohibitive enumeration that is incompatible with the scale and end-to-end nature of modern deep-learning pipelines. We recast band selection as a combinatorial inference problem and propose a task-agnostic framework that embeds a learnable Band Selection Layer equipped with an Expectation-Maximization-driven Sparsity Loss The E-step efficiently enumerates the expected likelihood of all k -out-of- B band subsets via dynamic programming, thereby making implicit dependencies explicit; the M-step optimises band importances toward a provably k -sparse solution without post-hoc thresholding. Comprehensive theoretical analysis proves the absence of spurious local maxima and guarantees convergence to an exact sparse optimum. Extensive experiments on three public benchmarks (KSC, HT2013, HT2018), two auxiliary tasks (anomaly and target detection), and six classifiers demonstrate that the proposed method consistently surpasses state-of-the-art baselines. The results confirm that EM-guided sparsification not only stabilises the sparsity pattern but also yields interpretable inter-band dependency structures, making the framework a robust and broadly applicable tool for hyperspectral analysis and other sparsity-oriented vision problems.
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2025.3597604