A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
From MaRDI portal
Publication:5380322
DOI10.1162/NECO_A_00763zbMATH Open1472.68147WikidataQ50578588 ScholiaQ50578588MaRDI QIDQ5380322FDOQ5380322
Authors: Shuxue Ding, Yujie Li, Zhenni Li 
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Recommendations
- Proximal alternating method for dictionary learning
- Dictionary Learning Algorithms for Sparse Representation
- An efficient algorithm for learning dictionary under coherence constraint
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Efficient dictionary learning with sparseness-enforcing projections
Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Least angle regression. (With discussion)
- Title not available (Why is that?)
- Matching pursuits with time-frequency dictionaries
- Learning the parts of objects by non-negative matrix factorization
- Proximal splitting methods in signal processing
- Signal Recovery by Proximal Forward-Backward Splitting
- Greed is Good: Algorithmic Results for Sparse Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Title not available (Why is that?)
- Online learning for matrix factorization and sparse coding
- Atomic decomposition by basis pursuit
- Dictionary Learning Algorithms for Sparse Representation
- Recursive Least Squares Dictionary Learning Algorithm
- Dictionary Learning for Sparse Approximations With the Majorization Method
- Parametric Dictionary Design for Sparse Coding
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Direct Optimization of the Dictionary Learning Problem
- Simultaneous Codeword Optimization (SimCO) for Dictionary Update and Learning
Cited In (16)
- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
- Proximal methods for hierarchical sparse coding
- Manifold optimization-based analysis dictionary learning with an \(\ell_{1/2}\)-norm regularizer
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Alternating proximal regularized dictionary learning
- Dictionary Learning Algorithms for Sparse Representation
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A fast patch-dictionary method for whole image recovery
- An efficient algorithm for learning dictionary under coherence constraint
- An efficient algorithm for overcomplete sparsifying transform learning with signal denoising
- An incoherent dictionary learning method with border condition constrained for sparse representation
- Improving the incoherence of a learned dictionary via rank shrinkage
- Toward fast transform learning
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Learning: Wavelet-dictionaries and continuous dictionaries.
- Efficient dictionary learning with sparseness-enforcing projections
Uses Software
This page was built for publication: A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380322)
