.png){kind=icon}
Return
A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2017.2753400.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self-dictionaries, and require the solution of large-scale convex optimization problems. In this paper, we study a particular nonnegative sparse regression model with self-dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem, where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.
Keywords:
Nonnegative matrix factorization
separability
sparse regression
self dictionary
fast gradient
hyperspectral imaging
pure-pixel assumption
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
Cited Papers
ShareSaveShareSaveRecognition of hemi-methylated DNA by the SRA protein UHRF1 by a base-flipping mechanism.png)
Nature
NatureIF0
PREAI
ShareSaveA Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
OAAI
OAAIShareSaveShareSave
View more