Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PDCO / rank | |||
Normal rank | |||
Revision as of 18:36, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms |
scientific article |
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
