Fast overcomplete dictionary construction with probabilistic guarantees
From MaRDI portal
Publication:2198175
DOI10.1007/S00574-019-00171-YzbMATH Open1458.94071OpenAlexW2979666730WikidataQ127118500 ScholiaQ127118500MaRDI QIDQ2198175FDOQ2198175
Authors: Enrico Au-Yeung, Greg Zanotti 
Publication date: 9 September 2020
Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00574-019-00171-y
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
- Proximal methods for hierarchical sparse coding
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Iterative hard thresholding for compressed sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Iteratively reweighted least squares minimization for sparse recovery
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Learning Multiscale Sparse Representations for Image and Video Restoration
- JENSEN'S OPERATOR INEQUALITY
- The Double Dixie Cup Problem
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Multi-frame compression: theory and design.
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Orthogonal matching pursuit under the restricted isometry property
- Proportional response dynamics in the Fisher market
- Learning sparsely used overcomplete dictionaries via alternating minimization
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Dictionary learning and tensor decomposition via the sum-of-squares method
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- A conditional construction of restricted isometries
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)
