Rahman Mohammad, Teng Shyh Wei, Murshed Manzur, Paul Manoranjan, Brennan David
Institute of Innovation, Science and Sustainability, Federation University Australia, University Drive, Mt Helen, VIC 3350, Australia.
Cooperative Research Centre for High Performance Soils, Callaghan, NSW 2308, Australia.
Sensors (Basel). 2024 Dec 4;24(23):7771. doi: 10.3390/s24237771.
Hyperspectral band selection algorithms are crucial for processing high-dimensional data, which enables dimensionality reduction, improves data analysis, and enhances computational efficiency. Among these, attention-based algorithms have gained prominence by ranking bands based on their discriminative capability. However, they require a large number of model parameters, which increases the need for extensive training data. To address this challenge, we propose Band Selection through Discrete Relaxation (BSDR), a novel deep learning-based algorithm. BSDR reduces the number of learnable parameters by focusing solely on the target bands, which are typically far fewer than the original bands, thus resulting in a data-efficient configuration that minimizes training data requirements and reduces training time. The algorithm employs discrete relaxation, transforming the discrete problem of band selection into a continuous optimization task, which enables gradient-based search across the spectral dimension. Through extensive evaluations on three benchmark datasets with varying spectral dimensions and characteristics, BSDR demonstrates superior performance for both regression and classification tasks, achieving up to 25% and 34.6% improvements in overall accuracy, compared to the latest attention-based and traditional algorithms, respectively, while reducing execution time by 96.8% and 97.18%. These findings highlight BSDR's effectiveness in addressing key challenges in hyperspectral band selection.
高光谱波段选择算法对于处理高维数据至关重要,它能够实现降维、改善数据分析并提高计算效率。其中,基于注意力的算法通过根据波段的判别能力对波段进行排序而备受关注。然而,它们需要大量的模型参数,这增加了对大量训练数据的需求。为应对这一挑战,我们提出了通过离散松弛进行波段选择(BSDR),这是一种基于深度学习的新型算法。BSDR通过仅关注目标波段来减少可学习参数的数量,目标波段通常比原始波段少得多,从而形成一种数据高效的配置,将训练数据需求降至最低并减少训练时间。该算法采用离散松弛,将波段选择的离散问题转化为连续优化任务,从而能够在光谱维度上进行基于梯度的搜索。通过对三个具有不同光谱维度和特征的基准数据集进行广泛评估,BSDR在回归和分类任务中均表现出卓越性能,与最新的基于注意力的算法和传统算法相比,总体准确率分别提高了25%和34.6%,同时执行时间分别减少了96.8%和97.18%。这些发现凸显了BSDR在应对高光谱波段选择关键挑战方面的有效性。