Robust near-separable nonnegative matrix factorization using linear optimization (Q2934034)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6378110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust near-separable nonnegative matrix factorization using linear optimization |
scientific article; zbMATH DE number 6378110 |
Statements
8 December 2014
0 references
matrix factorization
0 references
separability
0 references
linear programming
0 references
convex optimization
0 references
robustness to noise
0 references
pure-pixel assumption
0 references
hyperspectral unmixing
0 references
0.8999858498573303
0 references
0.8310093283653259
0 references
0.8165876269340515
0 references
0.8127699494361877
0 references
