Beyond sparsity: recovering structured representations by ^1 minimization and greedy algorithms
DOI10.1007/S10444-005-9009-5zbMATH Open1128.41004OpenAlexW2080709627MaRDI QIDQ2464708FDOQ2464708
Authors: 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
Recommendations
- Beyond coherence: Recovering structured time-frequency representations
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Optimization algorithms for sparse representations and applications
- Stable recovery of sparse overcomplete representations in the presence of noise
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
linear programminggreedy algorithmsparse component analysissparse approximationsbasis pursuit algorithmmultichannel representations
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)
Cites Work
- Atomic Decomposition by Basis Pursuit
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Greed is Good: Algorithmic Results for Sparse Approximation
- Uncertainty principles and ideal atomic decomposition
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Adaptive greedy approximations
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Weak greedy algorithms
- Sparse representations in unions of bases
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Blind source separation by sparse decomposition in a signal dictionary
- Title not available (Why is that?)
- A generalized uncertainty principle and sparse representation in pairs of bases
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- On sparse representation in pairs of bases
- Simultaneous approximation by greedy algorithms
- Hybrid representations for audiophonic signal encoding
Cited In (14)
- A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
- A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
- Learning the Structure for Structured Sparsity
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Low complexity regularization of linear inverse problems
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Stable restoration and separation of approximately sparse signals
- Representation of operators using fusion frames
- Beyond coherence: Recovering structured time-frequency representations
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- When does OMP achieve exact recovery with continuous dictionaries?
- Sampling rates for \(\ell^1\)-synthesis
- Compressed sensing with structured sparsity and structured acquisition
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Uses Software
This page was built for publication: Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464708)
