Dictionary-sparse recovery via thresholding-based algorithms
From MaRDI portal
Publication:5964229
DOI10.1007/s00041-015-9411-4zbMath1356.42023OpenAlexW609936745MaRDI QIDQ5964229
Publication date: 29 February 2016
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-015-9411-4
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Iterative numerical methods for linear systems (65F10) General harmonic expansions, frames (42C15)
Related Items (4)
Iterative hard thresholding for compressed data separation ⋮ Flavors of Compressive Sensing ⋮ Solving inverse problems using data-driven models ⋮ Preserving injectivity under subgaussian mappings and its application to compressed sensing
Uses Software
Cites Work
- Compressed sensing with coherent and redundant dictionaries
- The cosparse analysis model and algorithms
- Greedy signal space methods for incoherence and beyond
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- Greedy-like algorithms for the cosparse analysis model
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Sparse recovery with pre-Gaussian random matrices
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
This page was built for publication: Dictionary-sparse recovery via thresholding-based algorithms