A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators
From MaRDI portal
Publication:5380322
DOI10.1162/NECO_a_00763zbMath1472.68147WikidataQ50578588 ScholiaQ50578588MaRDI QIDQ5380322
Shuxue Ding, Yujie Li, Zhen-ni Li
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Least angle regression. (With discussion)
- Atomic Decomposition by Basis Pursuit
- Proximal Splitting Methods in Signal Processing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Dictionary Learning Algorithms for Sparse Representation
- Dictionary Learning for Sparse Approximations With the Majorization Method
- Parametric Dictionary Design for Sparse Coding
- Recursive Least Squares Dictionary Learning Algorithm
- Simultaneous Codeword Optimization (SimCO) for Dictionary Update and Learning
- Direct Optimization of the Dictionary Learning Problem
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Matching pursuits with time-frequency dictionaries
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Learning the parts of objects by non-negative matrix factorization
- Signal Recovery by Proximal Forward-Backward Splitting
- Unnamed Item
- Unnamed Item
- Unnamed Item
