Hyperspectral Unmixing Based on Sparsity-Constrained Nonnegative Matrix Factorization with Adaptive Total Variation

Xin Ru Feng, Heng Chao Li, Rui Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Hyperspectral unmixing is a critical processing step for many remote sensing applications. Nonnegative matrix factorization (NMF) has drawn extensive attention in hyperspectral image analysis recently. Considering that the abundance matrix is generally sparse and smooth, we propose a sparsity-constrained NMF with adaptive total variation (SNMF-ATV) algorithm for hyperspectral unmixing. Specifically, the ATV could promote the smoothness of the estimated abundances while avoid the staircase effect caused by TV model. The comparison with other unmixing methods on both synthetic and real data sets demonstrates the effectiveness and superiority of the proposed SNMF-ATV algorithm with regard to the other considered methods.

Original languageEnglish
Title of host publication2019 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2139-2142
Number of pages4
ISBN (Electronic)9781538691540
DOIs
StatePublished - Jul 2019
Externally publishedYes
Event39th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2019 - Yokohama, Japan
Duration: Jul 28 2019Aug 2 2019

Publication series

NameInternational Geoscience and Remote Sensing Symposium (IGARSS)

Conference

Conference39th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2019
Country/TerritoryJapan
CityYokohama
Period07/28/1908/2/19

Keywords

  • Hyperspectral unmixing
  • adaptive total variation
  • nonnegative matrix factorization

Fingerprint

Dive into the research topics of 'Hyperspectral Unmixing Based on Sparsity-Constrained Nonnegative Matrix Factorization with Adaptive Total Variation'. Together they form a unique fingerprint.

Cite this