On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6342760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD |
scientific article; zbMATH DE number 6342760 |
Statements
On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (English)
0 references
11 September 2014
0 references
dictionary learning
0 references
sparse coding
0 references
sparse component analysis
0 references
K-SVD
0 references
finite sample size
0 references
sampling complexity
0 references
dictionary identification
0 references
minimisation criterion
0 references
sparse representation
0 references
0 references
0 references
0 references
0 references
0.88654256
0 references
0.87775314
0 references
0.8631296
0 references
0.8458591
0 references
0.8347294
0 references
0.8333458
0 references
0.82392615
0 references
0.8219549
0 references
0.8167249
0 references
