The University of Southampton
University of Southampton Institutional Repository

Algorithms and comparisons of nonnegative matrix factorizations with volume regularization for hyperspectral unmixing

Algorithms and comparisons of nonnegative matrix factorizations with volume regularization for hyperspectral unmixing
Algorithms and comparisons of nonnegative matrix factorizations with volume regularization for hyperspectral unmixing

In this paper, we consider nonnegative matrix factorization (NMF) with a regularization that promotes small volume of the convex hull spanned by the basis matrix. We present highly efficient algorithms for three different volume regularizers, and compare them on endmember recovery in hyperspectral unmixing. The NMF algorithms developed in this paper are shown to outperform the state-of-The-Art volume-regularized NMF methods, and produce meaningful decompositions on real-world hyperspectral images in situations where endmembers are highly mixed (no pure pixels). Furthermore, our extensive numerical experiments show that when the data is highly separable, meaning that there are data points close to the true endmembers, and there are a few endmembers, the regularizer based on the determinant of the Gramian produces the best results in most cases. For data that is less separable and/or contains more endmembers, the regularizer based on the logarithm of the determinant of the Gramian performs best in general.

Blind source separation, hyperspectral unmixing, nonnegative matrix factorization, volume regularization
1939-1404
4843-4853
Ang, Andersen Man Shun
ed509ecd-39a3-4887-a709-339fdaded867
Gillis, Nicolas
76af3b6e-6ece-4191-a229-a7ff3616915f
Ang, Andersen Man Shun
ed509ecd-39a3-4887-a709-339fdaded867
Gillis, Nicolas
76af3b6e-6ece-4191-a229-a7ff3616915f

Ang, Andersen Man Shun and Gillis, Nicolas (2019) Algorithms and comparisons of nonnegative matrix factorizations with volume regularization for hyperspectral unmixing. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 12 (12), 4843-4853, [8758144]. (doi:10.1109/JSTARS.2019.2925098).

Record type: Article

Abstract

In this paper, we consider nonnegative matrix factorization (NMF) with a regularization that promotes small volume of the convex hull spanned by the basis matrix. We present highly efficient algorithms for three different volume regularizers, and compare them on endmember recovery in hyperspectral unmixing. The NMF algorithms developed in this paper are shown to outperform the state-of-The-Art volume-regularized NMF methods, and produce meaningful decompositions on real-world hyperspectral images in situations where endmembers are highly mixed (no pure pixels). Furthermore, our extensive numerical experiments show that when the data is highly separable, meaning that there are data points close to the true endmembers, and there are a few endmembers, the regularizer based on the determinant of the Gramian produces the best results in most cases. For data that is less separable and/or contains more endmembers, the regularizer based on the logarithm of the determinant of the Gramian performs best in general.

Text
Algorithms_and_Comparisons_of_Nonnegative_Matrix_Factorizations_With_Volume_Regularization_for_Hyperspectral_Unmixing - Version of Record
Available under License Creative Commons Attribution.
Download (3MB)

More information

Published date: 9 July 2019
Additional Information: Publisher Copyright: © 2008-2012 IEEE.
Keywords: Blind source separation, hyperspectral unmixing, nonnegative matrix factorization, volume regularization

Identifiers

Local EPrints ID: 495133
URI: http://eprints.soton.ac.uk/id/eprint/495133
ISSN: 1939-1404
PURE UUID: b53855aa-a045-4dc7-bbf4-2e43ccf7c0f7
ORCID for Andersen Man Shun Ang: ORCID iD orcid.org/0000-0002-8330-758X

Catalogue record

Date deposited: 30 Oct 2024 17:39
Last modified: 31 Oct 2024 03:11

Export record

Altmetrics

Contributors

Author: Andersen Man Shun Ang ORCID iD
Author: Nicolas Gillis

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×