Beyond sparsity: recovering structured representations by ^1 minimization and greedy algorithms

DOI10.1007/S10444-005-9009-5MaRDI QIDQ2464708zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

linear programminggreedy algorithmsparse component analysissparse approximationsbasis pursuit algorithmmultichannel representations

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)

Recommendations

• Beyond coherence: Recovering structured time-frequency representations
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ 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

Cites work

• scientific article; zbMATH DE number 884923 (Why is no real title available?)
• A generalized uncertainty principle and sparse representation in pairs of bases
• Adaptive greedy approximations
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Atomic Decomposition by Basis Pursuit
• Blind source separation by sparse decomposition in a signal dictionary
• Greed is Good: Algorithmic Results for Sparse Approximation
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• Hybrid representations for audiophonic signal encoding
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• On sparse representation in pairs of bases
• On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Simultaneous approximation by greedy algorithms
• Sparse representations in unions of bases
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Uncertainty principles and ideal atomic decomposition
• Weak greedy algorithms

Cited in

(14)

• Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Representation of operators using fusion frames
• Sampling rates for \(\ell^1\)-synthesis
• When does OMP achieve exact recovery with continuous dictionaries?
• A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
• Learning the Structure for Structured Sparsity
• 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
• Compressed sensing with structured sparsity and structured acquisition
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
• Low complexity regularization of linear inverse problems
• A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding

Describes a project that uses

Uses Software

• PDCO

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)