1 June 2005 An algorithm for fully constrained abundance estimation in hyperspectral unmixing
Author Affiliations +
Abstract
This paper presents an algorithm for abundance estimation in hyperspectral imagery. The fully constrained abundance estimation problem where the positivity and the sum to less than or equal to one (or sum equal to one) constraints are enforced is solved by reformulating the problem as a least distance (LSD) least squares (LS) problem. The advantage of reformulating the problem as a least distance problem is that the resulting LSD problem can be solved using a duality theory using a nonnegative LS problem (NNLS). The NNLS problem can then be solved using Hanson and Lawson algorithm or one of several multiplicative iterative algorithms presented in the literature. The paper presents the derivation of the algorithm and a comparison to other approaches described in the literature. Application to HYPERION image taken over La Parguera, Puerto Rico is presented.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Samuel Rosario-Torres, Samuel Rosario-Torres, Miguel Velez-Reyes, Miguel Velez-Reyes, } "An algorithm for fully constrained abundance estimation in hyperspectral unmixing", Proc. SPIE 5806, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XI, (1 June 2005); doi: 10.1117/12.605670; https://doi.org/10.1117/12.605670
PROCEEDINGS
9 PAGES


SHARE
Back to Top