Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
From MaRDI portal
Publication:734954
DOI10.1007/s00041-008-9044-yzbMath1181.94045OpenAlexW2086413318MaRDI QIDQ734954
Karin Schnass, Rémi Gribonval, Pierre Vandergheynst, Holger Rauhut
Publication date: 14 October 2009
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00544761/file/2008_JFAA_AverageGreed.pdf
Geometric probability and stochastic geometry (60D05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Simultaneous approximation (41A28) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items
Fusion of sparse reconstruction algorithms for multiple measurement vectors, Single-Trial Analysis of Bioelectromagnetic Signals: The Quest for Hidden Information, On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals, Typical reconstruction performance for distributed compressed sensing based on ℓ2,1-norm regularized least square and Bayesian optimal reconstruction: influences of noise, Joint Sparse Recovery Based on Variances, On rank awareness, thresholding, and MUSIC for joint sparse recovery, Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness, Low Complexity Regularization of Linear Inverse Problems, Uniform recovery of fusion frame structured sparse signals, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs, A perturbation analysis of block-sparse compressed sensing via mixed ℓ2/ℓ1 minimization, Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients, Theoretical guarantees for graph sparse coding, Analysis of sparse recovery algorithms via the replica method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorics of random processes and sections of convex bodies
- On the conditioning of random subdictionaries
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- A simple proof of the restricted isometry property for random matrices
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Dictionary Preconditioning for Greedy Algorithms
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Data compression and harmonic analysis
- Stable signal recovery from incomplete and inaccurate measurements
