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: (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 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>-out-of-<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> band subsets via dynamic programming, thereby making implicit dependencies explicit; the M-step optimises band importances toward a provably <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>-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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Circuits and Systems for Video Technology
Published
2025-08-11
DOI
https://doi.org/10.1109/tcsvt.2025.3597604
Primary Topic
Remote-Sensing Image Classification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sparse Hyperspectral Band Selection Based on Expectation Maximization

Haowen Zheng, Xinhui Xue, Likun Gao
IEEE Transactions on Circuits and Systems for Video Technology
Remote-Sensing Image Classification
article

Sparse Hyperspectral Band Selection Based on Expectation Maximization

Haowen Zheng, Xinhui Xue, Likun Gao
article en

Abstract

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 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>-out-of-<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> band subsets via dynamic programming, thereby making implicit dependencies explicit; the M-step optimises band importances toward a provably <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>-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.

IEEE Transactions on Circuits and Systems for Video TechnologyVol. 36(1)
Beihang University (CN)
Openalex Percentile: Top 71%
Remote-Sensing Image Classification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.