Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
type: Item
instance of: scholarly article
title: Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
zbMATH Open document ID: 1181.94045
author: Rémi Gribonval
author: Holger Rauhut
author: Karin Schnass
author: P. Vandergheynst
published in: The Journal of Fourier Analysis and Applications
publication date: 2009-10-14T00:00:00Z
full work available at URL: 2008 JFAA AverageGreed.pdf
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 41A28
Mathematics Subject Classification ID: 41A46
Mathematics Subject Classification ID: 60D05
zbMATH DE Number: 5614923
zbMATH Keywords: sparse approximation
zbMATH Keywords: probabilistic signal model
zbMATH Keywords: Gaussian distribution
describes a project that uses: JPEG2000
MaRDI profile type: Publication
OpenAlex ID: W2086413318
cites work: A simple proof of the restricted isometry property for random matrices
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
cites work: Q4273944
cites work: Stable recovery of sparse overcomplete representations in the presence of noise
cites work: Data compression and harmonic analysis
cites work: Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
cites work: Probability and random processes.
cites work: The concentration of measure phenomenon
cites work: Q3997990
cites work: Stability Results for Random Sampling of Sparse Trigonometric Polynomials
cites work: Compressed Sensing and Redundant Dictionaries
cites work: Combinatorics of random processes and sections of convex bodies
cites work: Dictionary Preconditioning for Greedy Algorithms
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
cites work: Just relax: convex programming methods for identifying sparse signals in noise
cites work: On the conditioning of random subdictionaries
cites work: Algorithms for simultaneous sparse approximation. I: Greedy pursuit
DOI: 10.1007/S00041-008-9044-Y
Recommended article: Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Recommended article: Greedy Algorithms for Joint Sparse Recovery
Recommended article: Greedy approach to sparse multi-path channel estimation using sensing dictionary
Recommended article: Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
Recommended article: Unified Theory for Recovery of Sparse Signals in a General Transform Domain
Recommended article: Distributed Recovery of Jointly Sparse Signals Under Communication Constraints
Recommended article: Q5190161
Recommended article: Simultaneous Sparse Recovery and Blind Demodulation
Recommended article: Support Recovery of Sparse Signals in the Presence of Multiple Measurement Vectors
description: scientific article; zbMATH DE number 5614923