Spectral Unmixing with Sparsity and Structuring Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Spectral Unmixing with Sparsity and Structuring Constraints

Résumé

This paper addresses the linear spectral unmixing problem, by incorporating different constraints that may be of interest in order to cope with spectral variability: sparsity (few nonzero abundances), group exclusivity (at most one nonzero abundance within subgroups of endmembers) and significance (non-zero abundances must exceed a threshold). We show how such problems can be solved exactly with mixed-integer programming techniques. Numerical simulations show that solutions can be computed for problems of limited, yet realistic , complexity, with improved estimation performance over existing methods, but with higher computing time. Index Terms-sparse spectral unmixing, L0-norm optimization , structured sparsity, mixed-integer programming.
Fichier principal
Vignette du fichier
BenMhenni_WHISPERS18.pdf (282.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02051443 , version 1 (27-02-2019)

Identifiants

  • HAL Id : hal-02051443 , version 1

Citer

Ramzi Ben Mhenni, Sébastien Bourguignon, Jordan Ninin, Frédéric Schmidt. Spectral Unmixing with Sparsity and Structuring Constraints. IEEE Whispers (2018) : 9th Workshop on Hyperspectral Image and Signal Processing, Sep 2018, Amsterdam, Netherlands. ⟨hal-02051443⟩
93 Consultations
248 Téléchargements

Partager

Gmail Facebook X LinkedIn More