Euclidean Distance to Convex Polyhedra and Application to Class Representation in Spectral Images
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910894564311040 |
|---|---|
| author | Bottenmuller, Antoine Magaud, Florent Demortière, Arnaud Decencière, Etienne Dokladal, Petr |
| author_facet | Bottenmuller, Antoine Magaud, Florent Demortière, Arnaud Decencière, Etienne Dokladal, Petr |
| contents | With the aim of estimating the abundance map from observations only, linear unmixing approaches are not always suitable to spectral images, especially when the number of bands is too small or when the spectra of the observed data are too correlated. To address this issue in the general case, we present a novel approach which provides an adapted spatial density function based on any arbitrary linear classifier. A robust mathematical formulation for computing the Euclidean distance to polyhedral sets is presented, along with an efficient algorithm that provides the exact minimum-norm point in a polyhedron. An empirical evaluation on the widely-used Samson hyperspectral dataset demonstrates that the proposed method surpasses state-of-the-art approaches in reconstructing abundance maps. Furthermore, its application to spectral images of a Lithium-ion battery, incompatible with linear unmixing models, validates the method's generality and effectiveness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20328 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Euclidean Distance to Convex Polyhedra and Application to Class Representation in Spectral Images Bottenmuller, Antoine Magaud, Florent Demortière, Arnaud Decencière, Etienne Dokladal, Petr Image and Video Processing Computer Vision and Pattern Recognition With the aim of estimating the abundance map from observations only, linear unmixing approaches are not always suitable to spectral images, especially when the number of bands is too small or when the spectra of the observed data are too correlated. To address this issue in the general case, we present a novel approach which provides an adapted spatial density function based on any arbitrary linear classifier. A robust mathematical formulation for computing the Euclidean distance to polyhedral sets is presented, along with an efficient algorithm that provides the exact minimum-norm point in a polyhedron. An empirical evaluation on the widely-used Samson hyperspectral dataset demonstrates that the proposed method surpasses state-of-the-art approaches in reconstructing abundance maps. Furthermore, its application to spectral images of a Lithium-ion battery, incompatible with linear unmixing models, validates the method's generality and effectiveness. |
| title | Euclidean Distance to Convex Polyhedra and Application to Class Representation in Spectral Images |
| topic | Image and Video Processing Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2503.20328 |