Hyperspectral Image Data Reduction for Endmember Extraction

• URL: http://arxiv.org/abs/2512.10506v1
• Date: Thu, 11 Dec 2025 10:27:40 GMT
• Title: Hyperspectral Image Data Reduction for Endmember Extraction
• Abstract summary: Endmember extraction from hyperspectral images aims to identify the spectral signatures of materials present in a scene.<n>Recent studies have shown that self-dictionary methods can achieve high extraction accuracy; however, their high computational cost limits their applicability to large-scale hyperspectral images.<n>We propose a data-reduced self-dictionary method that integrates the data reduction with a self-dictionary method based on a linear programming formulation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Endmember extraction from hyperspectral images aims to identify the spectral signatures of materials present in a scene. Recent studies have shown that self-dictionary methods can achieve high extraction accuracy; however, their high computational cost limits their applicability to large-scale hyperspectral images. Although several approaches have been proposed to mitigate this issue, it remains a major challenge. Motivated by this situation, this paper pursues a data reduction approach. Assuming that the hyperspectral image follows the linear mixing model with the pure-pixel assumption, we develop a data reduction technique that removes pixels that do not contain endmembers. We analyze the theoretical properties of this reduction step and show that it preserves pixels that lie close to the endmembers. Building on this result, we propose a data-reduced self-dictionary method that integrates the data reduction with a self-dictionary method based on a linear programming formulation. Numerical experiments demonstrate that the proposed method can substantially reduce the computational time of the original self-dictionary method without sacrificing endmember extraction accuracy.

Related papers

• Rethinking Contrastive Learning in Graph Anomaly Detection: A Clean-View Perspective [54.605073936695575]
  Graph anomaly detection aims to identify unusual patterns in graph-based data, with wide applications in fields such as web security and financial fraud detection.<n>Existing methods rely on contrastive learning, assuming that a lower similarity between a node and its local subgraph indicates abnormality.<n>The presence of interfering edges invalidates this assumption, since it introduces disruptive noise that compromises the contrastive learning process.<n>We propose a Clean-View Enhanced Graph Anomaly Detection framework (CVGAD), which includes a multi-scale anomaly awareness module to identify key sources of interference in the contrastive learning process.
  arXiv  Detail & Related papers  (2025-05-23T15:05:56Z)
• Score-Based Turbo Message Passing for Plug-and-Play Compressive Image Recovery [24.60447255507278]
  Off-the-shelf image denoisers mostly rely on some generic or hand-crafted priors for denoising.<n>We devise a message passing framework that integrates a score-based minimum mean squared error (MMSE) denoiser for compressive image recovery.
  arXiv  Detail & Related papers  (2025-03-28T04:30:58Z)
• Integrating Generative and Physics-Based Models for Ptychographic Imaging with Uncertainty Quantification [0.0]
  Ptychography is a scanning coherent diffractive imaging technique that enables imaging nanometer-scale features in extended samples.<n>This paper proposes a Bayesian inversion method for ptychography that performs effectively even with less overlap between neighboring scan locations.
  arXiv  Detail & Related papers  (2024-12-14T16:16:37Z)
• Image steganography based on generative implicit neural representation [2.2972561982722346]
  This paper proposes an image steganography based on generative implicit neural representation. By fixing a neural network as the message extractor, we effectively redirect the training burden to the image itself. The accuracy of message extraction attains an impressive mark of 100%.
  arXiv  Detail & Related papers  (2024-06-04T03:00:47Z)
• Endmember Extraction from Hyperspectral Images Using Self-Dictionary Approach with Linear Programming [0.0]
  A key step in utilizing hyperspectral imaging technology is endmember extraction, which aims to identify the spectral signatures of materials in observed scenes.<n> Theoretical studies suggest that self-dictionary methods using linear programming (LP), known as Hottopixx methods, are effective in extracting endmembers.<n>We propose an enhanced implementation of Hottopixx designed to reduce computational time and improve endmember extraction performance.
  arXiv  Detail & Related papers  (2024-04-19T07:28:51Z)
• Minimizing the Accumulated Trajectory Error to Improve Dataset Distillation [151.70234052015948]
  We propose a novel approach that encourages the optimization algorithm to seek a flat trajectory. We show that the weights trained on synthetic data are robust against the accumulated errors perturbations with the regularization towards the flat trajectory. Our method, called Flat Trajectory Distillation (FTD), is shown to boost the performance of gradient-matching methods by up to 4.7%.
  arXiv  Detail & Related papers  (2022-11-20T15:49:11Z)
• Learning Discriminative Shrinkage Deep Networks for Image Deconvolution [122.79108159874426]
  We propose an effective non-blind deconvolution approach by learning discriminative shrinkage functions to implicitly model these terms. Experimental results show that the proposed method performs favorably against the state-of-the-art ones in terms of efficiency and accuracy.
  arXiv  Detail & Related papers  (2021-11-27T12:12:57Z)
• Learned Block Iterative Shrinkage Thresholding Algorithm for Photothermal Super Resolution Imaging [52.42007686600479]
  We propose a learned block-sparse optimization approach using an iterative algorithm unfolded into a deep neural network. We show the benefits of using a learned block iterative shrinkage thresholding algorithm that is able to learn the choice of regularization parameters.
  arXiv  Detail & Related papers  (2020-12-07T09:27:16Z)
• Improved Slice-wise Tumour Detection in Brain MRIs by Computing Dissimilarities between Latent Representations [68.8204255655161]
  Anomaly detection for Magnetic Resonance Images (MRIs) can be solved with unsupervised methods. We have proposed a slice-wise semi-supervised method for tumour detection based on the computation of a dissimilarity function in the latent space of a Variational AutoEncoder. We show that by training the models on higher resolution images and by improving the quality of the reconstructions, we obtain results which are comparable with different baselines.
  arXiv  Detail & Related papers  (2020-07-24T14:02:09Z)
• Deep Dimension Reduction for Supervised Representation Learning [51.10448064423656]
  We propose a deep dimension reduction approach to learning representations with essential characteristics. The proposed approach is a nonparametric generalization of the sufficient dimension reduction method. We show that the estimated deep nonparametric representation is consistent in the sense that its excess risk converges to zero.
  arXiv  Detail & Related papers  (2020-06-10T14:47:43Z)
• Learning regularization and intensity-gradient-based fidelity for single image super resolution [0.0]
  We study the image degradation progress, and establish degradation model both in intensity and gradient space. A comprehensive data consistency constraint is established for the reconstruction. The proposed fidelity term and designed regularization term are embedded into the regularization framework.
  arXiv  Detail & Related papers  (2020-03-24T07:03:18Z)

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.