A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary
arXiv:1610.01349 · doi:10.1109/TIP.2017.2753400
Abstract
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.
References in corpus (15)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
- The Why and How of Nonnegative Matrix Factorization
- Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization
- A convex model for non-negative matrix factorization and dimensionality reduction on physical space
- A Practical Algorithm for Topic Modeling with Provable Guarantees
- Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization
- Factoring nonnegative matrices with linear programs
- Hierarchical Clustering of Hyperspectral Images using Rank-Two Nonnegative Matrix Factorization
- Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
- Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
- Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Related
- Topic Discovery through Data Dependent and Random Projections
- Using separable non-negative matrix factorization techniques for the analysis of time-resolved Raman spectra
- Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matrices
Cited by in corpus (10)
- Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
- Generalized Separable Nonnegative Matrix Factorization
- Introduction to Nonnegative Matrix Factorization
- Dictionary-based Tensor Canonical Polyadic Decomposition
- Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank-Wolfe Approach
- Matrix Cofactorization for Joint Representation Learning and Supervised Classification -- Application to Hyperspectral Image Analysis
- Spectral Unmixing with Multiple Dictionaries
- Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees
- Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability
- Endmember Extraction from Hyperspectral Images Using Self-Dictionary Approach with Linear Programming