<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Annals</journal-id>
<journal-title-group>
<journal-title>ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Annals</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9050</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprs-annals-XI-1-2026-53-2026</article-id>
<title-group>
<article-title>Abundance Estimation Methods in Spectral Unmixing for Real Data</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Cerra</surname>
<given-names>Daniele</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Pato</surname>
<given-names>Miguel</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Carmona</surname>
<given-names>Emiliano</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>DLR, Earth Observation Center, 82234 Wessling, Germany</addr-line>
</aff>
<pub-date pub-type="epub">
<day>03</day>
<month>07</month>
<year>2026</year>
</pub-date>
<volume>XI-1-2026</volume>
<fpage>53</fpage>
<lpage>59</lpage>
<permissions>
<copyright-statement>Copyright: &#x000a9; 2026 Daniele Cerra et al.</copyright-statement>
<copyright-year>2026</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri"  xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/XI-1-2026/53/2026/isprs-annals-XI-1-2026-53-2026.html">This article is available from https://isprs-annals.copernicus.org/articles/XI-1-2026/53/2026/isprs-annals-XI-1-2026-53-2026.html</self-uri>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/XI-1-2026/53/2026/isprs-annals-XI-1-2026-53-2026.pdf">The full text article is available as a PDF file from https://isprs-annals.copernicus.org/articles/XI-1-2026/53/2026/isprs-annals-XI-1-2026-53-2026.pdf</self-uri>
<abstract>
<p>Spectral unmixing estimates the fractional abundances of materials, having associated spectra called endmembers, in pixels acquired by imaging spectrometers. Validation of abundance estimation methods typically relies on synthetic data or comparisons to results obtained by other algorithms. This study considers results of typical abundance estimation algorithms on the DLR HySU (Hyper-Spectral Unmixing) benchmark dataset, which contains actual imaging spectrometer data acquired over several arrangements of known-size material patches for physically traceable validation. Abundance estimates are compared against measured target areas in pixels with different degrees of mixtures. We evaluate least squares and sparse unmixing methods across different noise scenarios on real data, and by contaminating the library through addition of non-relevant endmembers. Additionally, as a way to approximate hard sparsity constraints, we enforce cardinality constraints on endmember subsets, identifying those minimizing abundance errors relative to the full library. Results suggest that fully constrained least squares yields usually the best results, but struggles in cases of highly mixed pixels. Finally, we test quantization of abundance values as a way to enforce sparsity in non-negative least squares with limited but encouraging results. Overall, the increase in accuracy of results enforcing sparse solutions supports the use of computationally efficient sparse unmixing methods in practical scenarios, part of which may become feasible if quantum computing capabilities improve in the future.</p>
</abstract>
<counts><page-count count="7"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>