Performance comparisons of greedy algorithms in compressed sensing. (Q2948099)
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: Performance comparisons of greedy algorithms in compressed sensing. |
scientific article; zbMATH DE number 6487066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance comparisons of greedy algorithms in compressed sensing. |
scientific article; zbMATH DE number 6487066 |
Statements
Performance comparisons of greedy algorithms in compressed sensing (English)
0 references
29 September 2015
0 references
greedy algorithm
0 references
compressed sensing
0 references
GPU computing
0 references
hard thresholding
0 references
sparse approximation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8573702573776245
0 references
0.8087199330329895
0 references
0.7975963950157166
0 references
0.793528139591217
0 references
0.7897704243659973
0 references
