A simple test to check the optimality of a sparse signal approximation (Q1027249)
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: A simple test to check the optimality of a sparse signal approximation |
scientific article; zbMATH DE number 5573414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple test to check the optimality of a sparse signal approximation |
scientific article; zbMATH DE number 5573414 |
Statements
A simple test to check the optimality of a sparse signal approximation (English)
0 references
1 July 2009
0 references
sparse representation
0 references
approximation
0 references
overcomplete dictionary
0 references
matching pursuit
0 references
basis pursuit
0 references
FOCUSS
0 references
convex programming
0 references
greedy algorithm
0 references
identifiability
0 references
inverse problem
0 references
sparse prior
0 references
Bayesian estimation
0 references
0.7975444197654724
0 references
0.7813621163368225
0 references
0.7746849656105042
0 references
0.7604489326477051
0 references
