Algorithms for simultaneous sparse approximation. I: Greedy pursuit (Q1027254)
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: Algorithms for simultaneous sparse approximation. I: Greedy pursuit |
scientific article; zbMATH DE number 5573418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for simultaneous sparse approximation. I: Greedy pursuit |
scientific article; zbMATH DE number 5573418 |
Statements
Algorithms for simultaneous sparse approximation. I: Greedy pursuit (English)
0 references
1 July 2009
0 references
greedy algorithms
0 references
orthogonal matching pursuit
0 references
multiple measurement vectors
0 references
simultaneous sparse approximation
0 references
subset selection
0 references
0.9510538578033448
0 references
0.8389572501182556
0 references
0.8315832614898682
0 references
0.7861472964286804
0 references
0.7851295471191406
0 references
