Optimal Transport Based Hyperspectral Unmixing for Highly Mixed Observations

D. Doutsas, B. Figliuzzi
9/24/2025
eess.IVcs.CVstat.AP

No confident code implementation found for this paper.

Abstract

We propose a novel approach based on optimal transport (OT) for tackling the problem of highly mixed data in blind hyperspectral unmixing. Our method constrains the distribution of the estimated abundance matrix to resemble a targeted Dirichlet distribution more closely. The novelty lies in using OT to measure the discrepancy between the targeted and true abundance distributions, which we incorporate as a regularization term in our optimization problem. We demonstrate the efficiency of our method through a case study involving an unsupervised deep learning approach. Our experiments show that the proposed approach allows for a better estimation of the endmembers in the presence of highly mixed data, while displaying robustness to the choice of target abundance distribution.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{doutsas2025optimal,
  title  = {Optimal Transport Based Hyperspectral Unmixing for Highly Mixed Observations},
  author = {D. Doutsas and B. Figliuzzi},
  year   = {2025},
  eprint = {2509.20417},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.20417v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.20417.svg)](https://codeofpaper.com/paper/2509.20417)

Discussion