Fast overcomplete dictionary construction with probabilistic guarantees
From MaRDI portal
Publication:2198175
Recommendations
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Alternating direction method of multipliers for solving dictionary learning models
- Proximal alternating method for dictionary learning
- Toward fast transform learning
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
Cites work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A conditional construction of restricted isometries
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Compressed sensing
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- Dictionary learning and tensor decomposition via the sum-of-squares method
- Greed is Good: Algorithmic Results for Sparse Approximation
- Iterative hard thresholding for compressed sensing
- Iteratively reweighted least squares minimization for sparse recovery
- JENSEN'S OPERATOR INEQUALITY
- Learning Multiscale Sparse Representations for Image and Video Restoration
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Multi-frame compression: theory and design.
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Orthogonal matching pursuit under the restricted isometry property
- Proportional response dynamics in the Fisher market
- Proximal methods for hierarchical sparse coding
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stable signal recovery from incomplete and inaccurate measurements
- The Double Dixie Cup Problem
Cited in
(6)- Alternating direction method of multipliers for solving dictionary learning models
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Global optimality in separable dictionary learning with applications to the analysis of diffusion MRI
- Toward fast transform learning
- Learning sparsely used overcomplete dictionaries via alternating minimization
- A Distribution-Sensitive Dictionary with Low Space Overhead
This page was built for publication: Fast overcomplete dictionary construction with probabilistic guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198175)
