Publication
Title
Hyperspectral unmixing using an active set algorithm
Author
Abstract
The inversion problem in hyperspectral unmixing involves solving a constrained least-squares problem. Several solutions have been proposed, often based on convex optimization techniques, such as alternating optimization strategies, projection onto convex sets, augmenting positively constrained optimization algorithms, or quadratic programming. One of the most popular techniques, fully-constrained least-squares unmixing, is based on extending the Lawson-Hanson nonnegatively constrained least-squares algorithm with an extra weighted term that takes the sum-to-one constraint into account. In this paper, we present an alternative active-set algorithm, inspired by the Lawson-Hanson algorithm, which solves the unmixing problem exactly, and does not require any weighting parameters. The resulting algorithm always finds the correct solution, and works an order of magnitude faster than the fully-constrained least-squares algorithm.
Language
English
Source (book)
IEEE ICIP 2014 : International Conference on Image Processing, October 27-30, Paris, France
Publication
S.l. : IEEE, 2014
Volume/pages
p. 694-697
ISI
000370063600141
UAntwerpen
Faculty/Department
Research group
[E?say:metaLocaldata.cgzprojectinf]
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 16.02.2015
Last edited 23.09.2017
To cite this reference