Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
Summary: Sparse representation of signals via an overcomplete dictionary has recently received much attention as it has produced promising results in various applications. Since the nonnegativities of the signals and the dictionary are required in some applications, for example, multispectral data analysis, the conventional dictionary learning methods imposed simply with nonnegativity may become inapplicable. In this paper, we propose a novel method for learning a nonnegative, overcomplete dictionary for such a case. This is accomplished by posing the sparse representation of nonnegative signals as a problem of nonnegative matrix factorization (NMF) with a sparsity constraint. By employing the coordinate descent strategy for optimization and extending it to multivariable case for processing in parallel, we develop a so-called parallel coordinate descent dictionary learning (PCDDL) algorithm, which is structured by iteratively solving the two optimal problems, the learning process of the dictionary and the estimating process of the coefficients for constructing the signals. Numerical experiments demonstrate that the proposed algorithm performs better than the conventional nonnegative K-SVD (NN-KSVD) algorithm and several other algorithms for comparison. What is more, its computational consumption is remarkably lower than that of the compared algorithms.
- Nonlinear dimensionality reduction based on dictionary learning
- Robust Non-Linear Matrix Factorization for Dictionary Learning, Denoising, and Clustering
- Non-linear dictionary learning with partially labeled data
- Proximal alternating method for dictionary learning
- Alternating direction method of multipliers for solving dictionary learning models
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
- Dictionary Learning With Few Samples and Matrix Concentration
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Review of Image Denoising Algorithms, with a New One
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- Document clustering using nonnegative matrix factorization
- Learning the parts of objects by non-negative matrix factorization
- Least angle regression. (With discussion)
- Non-negative matrix factorization with sparseness constraints
- Nonnegative matrix factorization for spectral data analysis
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Online learning for matrix factorization and sparse coding
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Pathwise coordinate optimization
- Recursive Least Squares Dictionary Learning Algorithm
This page was built for publication: Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015273)
