Beyond coherence: Recovering structured time-frequency representations

DOI10.1016/J.ACHA.2007.09.002MaRDI QIDQ2470546zbMATH OpenOpenAlexFDO

Authors Lasse Borup, Rémi Gribonval, Morten Nielsen

Publication date 14 February 2008

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.acha.2007.09.002

zbMATH Keywords

\(l^1\)-minimizationbasis pursuitgreedy algorithmmatching pursuitrecovering structured representationssparse representationtime-frequency dictionarieswaveletsWilson basis

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for wavelets (65T60) Application of orthogonal and other special functions (94A11)

Review text

The authors consider the problem of recovering a structured sparse representation of a signal in a overcomplete time-frequency dictionary with a particular structure. For infinite dictionaries that are the union of a wavelet basis and a Wilson basis, sufficient conditions are given for the basis pursuit (\(l^1\)-minimization) and (orthogonal) matching pursuit algorithms (also known as greedy algorithms) to recover a structured representation of an admissible signal. The conditions allow very large (even infinite) support sets to be recovered.

Recommendations

• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• Sparsity in time-frequency representations
• Matching pursuits with time-frequency dictionaries
• scientific article; zbMATH DE number 884923
• Atomic Decomposition by Basis Pursuit

Cites work

• A generalized uncertainty principle and sparse representation in pairs of bases
• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• Compressed sensing
• Greed is Good: Algorithmic Results for Sparse Approximation
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• scientific article; zbMATH DE number 49667 (Why is no real title available?)
• scientific article; zbMATH DE number 937467 (Why is no real title available?)
• Hybrid representations for audiophonic signal encoding
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Sparse representations in unions of bases
• Sparsity and incoherence in compressive sampling
• Stable signal recovery from incomplete and inaccurate measurements
• Ten Lectures on Wavelets
• Uncertainty principles and ideal atomic decomposition

Cited in

(9)

• Geometric separation by single-pass alternating thresholding
• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• When does OMP achieve exact recovery with continuous dictionaries?
• Low complexity regularization of linear inverse problems
• Theory and applications of compressed sensing
• Pulse signal recovery method based on sparse representation
• Microlocal analysis of the geometric separation problem
• Analysis of simultaneous inpainting and geometric separation based on sparse decomposition
• A time-causal and time-recursive scale-covariant scale-space representation of temporal signals and past time

This page was built for publication: Beyond coherence: Recovering structured time-frequency representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2470546)