Learning overcomplete, low coherence dictionaries with linear inference
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- 10.1162/jmlr.2003.4.7-8.1235
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Data
- A Limited Memory Algorithm for Bound Constrained Optimization
- Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
- Analysis versus synthesis in signal priors
- Atomic decomposition by basis pursuit
- Convolutional Dictionary Learning: Acceleration and Convergence
- Efficient occlusive components analysis
- Equiangular Tight Frames From Hyperovals
- Estimating overcomplete independent component bases for image windows
- Estimation of non-normalized statistical models by score matching
- Grassmannian frames with applications to coding and communication
- Independent component analysis, a new concept?
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Mathematical problems for the next century
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse spectrotemporal coding of sounds
- Unifying blind separation and clustering for resting-state EEG/MEG functional connectivity analysis
- When Can Dictionary Learning Uniquely Recover Sparse Data From Subsamples?
Cited in
(3)
This page was built for publication: Learning overcomplete, low coherence dictionaries with linear inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214276)