Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283)
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: Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) |
scientific article; zbMATH DE number 6478157
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) |
scientific article; zbMATH DE number 6478157 |
Statements
Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (English)
0 references
3 September 2015
0 references
highly coherent dictionary
0 references
sparse representation
0 references
\(L_1-L_2\) minimization
0 references
difference of convex programming
0 references
simulated annealing
0 references
comparison with \(L_{p} \
0 references
p \in (0,1)\)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
