Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10444-005-9009-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080709627 / rank | |||
Normal rank |
Revision as of 15:23, 19 March 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