On the Computational Intractability of Exact and Approximate Dictionary Learning
@article{Tillmann2015OnTC, title={On the Computational Intractability of Exact and Approximate Dictionary Learning}, author={A. Tillmann}, journal={IEEE Signal Processing Letters}, year={2015}, volume={22}, pages={45-49} }
The efficient sparse coding and reconstruction of signal vectors via linear observations has received a tremendous amount of attention over the last decade. In this context, the automated learning of a suitable basis or overcomplete dictionary from training data sets of certain signal classes for use in sparse representations has turned out to be of particular importance regarding practical signal processing applications. Most popular dictionary learning algorithms involve NP-hard sparse… CONTINUE READING
Topics from this paper
58 Citations
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Mathematics, Computer Science
- SIAM J. Optim.
- 2016
- 143
- PDF
Dictionary learning with equiprobable matching pursuit
- Computer Science
- 2017 International Joint Conference on Neural Networks (IJCNN)
- 2017
- 5
- Highly Influenced
- PDF
Learning fast sparsifying overcomplete dictionaries
- Computer Science
- 2017 25th European Signal Processing Conference (EUSIPCO)
- 2017
- 1
- PDF
Learning Fast Sparsifying Transforms
- Computer Science, Mathematics
- IEEE Transactions on Signal Processing
- 2017
- 9
- PDF
DOLPHIn—Dictionary Learning for Phase Retrieval
- Computer Science, Mathematics
- IEEE Transactions on Signal Processing
- 2016
- 41
- PDF
References
SHOWING 1-10 OF 78 REFERENCES
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Mathematics, Computer Science
- IEEE Transactions on Signal Processing
- 2006
- 6,874
- PDF
K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation
- 2005
- 5,741
- PDF
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Mathematics, Computer Science
- SIAM J. Optim.
- 2016
- 143
- PDF
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Mathematics
- 2006
- 201
- PDF
Dictionary Learning Algorithms for Sparse Representation
- Mathematics, Computer Science
- Neural Computation
- 2003
- 787
- PDF
Learning unions of orthonormal bases with thresholded singular value decomposition
- Computer Science
- Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
- 2005
- 137
- PDF
Regularized dictionary learning for sparse approximation
- Computer Science
- 2008 16th European Signal Processing Conference
- 2008
- 17
- PDF
Online Learning for Matrix Factorization and Sparse Coding
- Computer Science, Mathematics
- J. Mach. Learn. Res.
- 2010
- 2,335
- PDF
Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
- Computer Science
- IEEE Transactions on Signal Processing
- 2010
- 551
- PDF