Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
From MaRDI portal
Publication:2464708
DOI10.1007/s10444-005-9009-5zbMath1128.41004OpenAlexW2080709627MaRDI QIDQ2464708
Rémi Gribonval, Morten Nielsen
Publication date: 17 December 2007
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-005-9009-5
linear programminggreedy algorithmsparse component analysissparse approximationsbasis pursuit algorithmmultichannel representations
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)
Related Items
When does OMP achieve exact recovery with continuous dictionaries?, Sampling rates for \(\ell^1\)-synthesis, Representation of operators using fusion frames, Compressed sensing with structured sparsity and structured acquisition, Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms, Beyond coherence: Recovering structured time-frequency representations, Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all, Stable restoration and separation of approximately sparse signals, Low Complexity Regularization of Linear Inverse Problems, Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
Uses Software
Cites Work
- Unnamed Item
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Hybrid representations for audiophonic signal encoding
- Weak greedy algorithms
- Simultaneous approximation by greedy algorithms
- Blind Source Separation by Sparse Decomposition in a Signal Dictionary
- Sparse representations in unions of bases
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Greed is Good: Algorithmic Results for Sparse Approximation
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- A generalized uncertainty principle and sparse representation in pairs of bases
- On sparse representation in pairs of bases
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Adaptive greedy approximations
