A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
From MaRDI portal
Publication:5236637
DOI10.1137/18M1165116zbMath1475.94024arXiv1812.10538OpenAlexW2964184986MaRDI QIDQ5236637
Publication date: 9 October 2019
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10538
Image analysis in multivariate analysis (62H35) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Atomic Decomposition by Basis Pursuit
- Sparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Uncertainty principles and ideal atomic decomposition
- Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
- Shift & 2D Rotation Invariant Sparse Coding for Multivariate Signals
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Weighted Couple Sparse Representation With Classified Regularization for Impulse Noise Removal
- Efficient Algorithms for Convolutional Sparse Representations
- Convolutional Sparse and Low-Rank Coding-Based Image Decomposition
- Trainlets: Dictionary Learning in High Dimensions
- Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Matching pursuits with time-frequency dictionaries
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
