Embedded Hyperspectral Band Selection with Adaptive Optimization for Image Semantic Segmentation

• URL: http://arxiv.org/abs/2401.11420v1
• Date: Sun, 21 Jan 2024 07:48:39 GMT
• Title: Embedded Hyperspectral Band Selection with Adaptive Optimization for Image Semantic Segmentation
• Authors: Yaniv Zimmer and Oren Glickman
• Abstract summary: We introduce a pioneering approach for hyperspectral band selection that offers an embedded solution. Our proposed method, embedded Hyperspectral Band Selection (EHBS), excels in selecting the best bands without the need for prior processing. The adaptability of our approach to other tasks opens up promising avenues for broader applications.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hyperspectral band selection plays a pivotal role in remote sensing and image analysis, aiming to identify the most informative spectral bands while minimizing computational overhead. In this paper, we introduce a pioneering approach for hyperspectral band selection that offers an embedded solution, making it well-suited for resource-constrained or real-time applications. Our proposed method, embedded Hyperspectral Band Selection (EHBS), excels in selecting the best bands without the need for prior processing, seamlessly integrating with the downstream task model. This is achieved through the adaptation of the Stochastic Gates (STG) algorithm, originally designed for feature selection, for hyperspectral band selection in the context of image semantic segmentation and the integration of a dynamic optimizer, DoG, which removes the need for the required tuning the learning rate. To assess the performance of our method, we introduce a novel metric for evaluating band selection methods across different target numbers of selected bands quantified by the Area Under the Curve (AUC). We conduct experiments on two distinct semantic-segmentation hyperspectral benchmark datasets, demonstrating its superiority in terms of its resulting accuracy and its ease of use compared to many common and state-of-the-art methods. Furthermore, our contributions extend beyond the realm of hyperspectral band selection. The adaptability of our approach to other tasks, especially those involving grouped features, opens up promising avenues for broader applications within the realm of deep learning, such as feature selection for feature groups. The demonstrated success on the tested datasets and the potential for application to a variety of tasks underscore the value of our method as a substantial addition to the field of computer vision.

Related papers

• Multi-Teacher Multi-Objective Meta-Learning for Zero-Shot Hyperspectral Band Selection [50.30291173608449]
  We propose a novel multi-objective meta-learning network (M$3$BS) for zero-shot hyperspectral band selection. In M$3$BS, a generalizable graph convolution network (GCN) is constructed to generate dataset-agnostic base. The acquired meta-knowledge can be directly transferred to unseen datasets without any retraining or fine-tuning.
  arXiv  Detail & Related papers  (2024-06-12T07:13:31Z)
• Hyperspectral Band Selection based on Generalized 3DTV and Tensor CUR Decomposition [8.812294191190896]
  Hyperspectral Imaging serves as an important technique in remote sensing. High dimensionality and data volume pose significant computational challenges. We propose a novel hyperspectral band selection model by decomposing the data into a low-rank and smooth component and a sparse one.
  arXiv  Detail & Related papers  (2024-05-02T02:23:38Z)
• Unsupervised Band Selection Using Fused HSI and LiDAR Attention Integrating With Autoencoder [16.742768644585684]
  Band selection in hyperspectral imaging (HSI) is critical for optimising data processing and enhancing analytical accuracy. Traditional approaches have predominantly concentrated on analysing spectral and pixel characteristics within individual bands independently. This paper introduces a novel unsupervised band selection framework that incorporates attention mechanisms and an Autoencoder for reconstruction-based band selection.
  arXiv  Detail & Related papers  (2024-04-08T07:47:28Z)
• Feature Selection as Deep Sequential Generative Learning [50.00973409680637]
  We develop a deep variational transformer model over a joint of sequential reconstruction, variational, and performance evaluator losses. Our model can distill feature selection knowledge and learn a continuous embedding space to map feature selection decision sequences into embedding vectors associated with utility scores.
  arXiv  Detail & Related papers  (2024-03-06T16:31:56Z)
• Active Finetuning: Exploiting Annotation Budget in the Pretraining-Finetuning Paradigm [132.9949120482274]
  This paper focuses on the selection of samples for annotation in the pretraining-finetuning paradigm. We propose a novel method called ActiveFT for active finetuning task to select a subset of data distributing similarly with the entire unlabeled pool. Extensive experiments show the leading performance and high efficiency of ActiveFT superior to baselines on both image classification and semantic segmentation.
  arXiv  Detail & Related papers  (2023-03-25T07:17:03Z)
• Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits [55.03293214439741]
  In contextual bandits, an agent sequentially makes actions from a time-dependent action set based on past experience. We propose the first online continuous hyperparameter tuning framework for contextual bandits. We show that it could achieve a sublinear regret in theory and performs consistently better than all existing methods on both synthetic and real datasets.
  arXiv  Detail & Related papers  (2023-02-18T23:31:20Z)
• Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms [74.55200180156906]
  The contextual bandit problem models the trade-off between exploration and exploitation. We show our Syndicated Bandits framework can achieve the optimal regret upper bounds.
  arXiv  Detail & Related papers  (2021-06-05T22:30:21Z)
• Hyperspectral Band Selection for Multispectral Image Classification with Convolutional Networks [0.0]
  We propose a novel band selection method to select a reduced set of wavelengths from hyperspectral images. We show that our method produces more suitable results for a multispectral sensor design.
  arXiv  Detail & Related papers  (2021-06-01T17:24:35Z)
• Deep Reinforcement Learning for Band Selection in Hyperspectral Image Classification [21.098473348205726]
  Band selection refers to the process of choosing the most relevant bands in a hyperspectral image. In this paper, we are interested in training an intelligent agent that is capable of automatically learning policy to select an optimal band subset. We frame the problem of unsupervised band selection as a Markov decision process, propose an effective method to parameterize it, and finally solve the problem by deep reinforcement learning.
  arXiv  Detail & Related papers  (2021-03-15T22:06:15Z)
• Non-Adaptive Adaptive Sampling on Turnstile Streams [57.619901304728366]
  We give the first relative-error algorithms for column subset selection, subspace approximation, projective clustering, and volume on turnstile streams that use space sublinear in $n$. Our adaptive sampling procedure has a number of applications to various data summarization problems that either improve state-of-the-art or have only been previously studied in the more relaxed row-arrival model.
  arXiv  Detail & Related papers  (2020-04-23T05:00:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.