A fast algorithm to find all paths for hyperspectral unmixing

Yang Liu, Yi Guo, Feng Li, Lei Xin, Puming Huang

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

![CDATA[Abundance estimation is one of the most important procedures in spectral unmixing. When the spectral library is fixed, the abundance estimation is to find the optimal subset of the library. This is solved by linear regression with sparsity constraint with nonnegativity i.e. the socalled nonnegative L-1 regression (NNL1). However, it is not clear how to choose the regularisation parameter for a given spectrum to be unmixed. In this paper, a fast algorithm is proposed to find all regularisation paths of NNL1, named as FastNNL1, which selects an optimal result from all paths as the final active set of fractional abundances. The simulation results show that the proposed method performs much better than conventional sparse unmixing algorithms in abundance estimation.]]
Original languageEnglish
Title of host publicationProceedings of the 2018 IEEE International Geoscience and Remote Sensing Symposium (IGARSS 2018): Observing, Understanding and Forecasting the Dynamics of our Planet, 22-27 July, 2018, Valencia, Spain
PublisherIEEE
Pages4269-4272
Number of pages4
ISBN (Print)9781538671504
DOIs
Publication statusPublished - 2018
EventInternational Geoscience and Remote Sensing Symposium -
Duration: 28 Jul 2019 → …

Conference

ConferenceInternational Geoscience and Remote Sensing Symposium
Period28/07/19 → …

Keywords

  • algorithms
  • coding theory
  • hyperspectral imaging
  • sparse matrices

Fingerprint

Dive into the research topics of 'A fast algorithm to find all paths for hyperspectral unmixing'. Together they form a unique fingerprint.

Cite this