On Using Projection Onto Convex Sets for Solving the Hyperspectral Unmixing Problem

We present a new algorithm for solving the fully constrained least-squares problem in hyperspectral unmixing, based on the Dykstra algorithm for projections onto convex sets, integrated with a solution validation phase based on the Kolmogorov criterion. We first show the equivalence between the full...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE geoscience and remote sensing letters 2013-11, Vol.10 (6), p.1522-1526
Hauptverfasser:	Heylen, Rob, Akhter, Muhammad Awais, Scheunders, Paul
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation algorithms Convergence Geometric hyperspectral unmixing Hardware Hyperspectral imaging Projection algorithms projection onto convex sets Runtime
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!