Beyond coherence: Recovering structured time-frequency representations (Q2470546)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Beyond coherence: Recovering structured time-frequency representations |
scientific article; zbMATH DE number 5235259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond coherence: Recovering structured time-frequency representations |
scientific article; zbMATH DE number 5235259 |
Statements
Beyond coherence: Recovering structured time-frequency representations (English)
0 references
14 February 2008
0 references
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.
0 references
sparse representation
0 references
basis pursuit
0 references
\(l^1\)-minimization
0 references
matching pursuit
0 references
greedy algorithm
0 references
time-frequency dictionaries
0 references
recovering structured representations
0 references
wavelets
0 references
Wilson basis
0 references
0 references
0 references
0 references
0.7957685589790344
0 references
0.7897931337356567
0 references
0.7593152523040771
0 references
0.7575735449790955
0 references
