Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708)
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 sparsity: recovering structured representations by ^1 minimization and greedy algorithms |
scientific article; zbMATH DE number 5220764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms |
scientific article; zbMATH DE number 5220764 |
Statements
Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (English)
0 references
17 December 2007
0 references
sparse approximations
0 references
greedy algorithm
0 references
basis pursuit algorithm
0 references
linear programming
0 references
multichannel representations
0 references
sparse component analysis
0 references
0 references
0 references
0.8304650187492371
0 references
0.826957643032074
0 references
0.7957685589790344
0 references
0.7819196581840515
0 references
0.780460774898529
0 references
