Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing (Q2299008)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing |
scientific article; zbMATH DE number 7171516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing |
scientific article; zbMATH DE number 7171516 |
Statements
Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing (English)
0 references
20 February 2020
0 references
Summary: Hyperspectral unmixing is a powerful method of the remote sensing image mining that identifies the constituent materials and estimates the corresponding fractions from the mixture. We consider the application of nonnegative matrix factorization (NMF) for the mining and analysis of spectral data. In this paper, we develop two effective active set type NMF algorithms for hyperspectral unmixing. Because the factor matrices used in unmixing have sparse features, the active set strategy helps reduce the computational cost. These active set type algorithms for NMF is based on an alternating nonnegative constrained least squares (ANLS) and achieve a quadratic convergence rate under the reasonable assumptions. Finally, numerical tests demonstrate that these algorithms work well and that the function values decrease faster than those obtained with other algorithms.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8332517743110657
0 references
0.8255282640457153
0 references
0.8130797743797302
0 references
0.8043209910392761
0 references