mlsanityData to 14 Oct 2026

Optimal Transport Based Hyperspectral Unmixing for Highly Mixed Observations

arXiv 2509.20417 ↗First posted 24 Sep 2025eess.IV cs.CV stat.APcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 15 references that are in the map. First posted on arXiv 24 Sep 2025.

Builds on

2 of 15 references.

References · 2

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2017Learning Generative Models with Sinkhorn Divergencescited by 314

Built on by

Not cited yet.