On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them (Q2497239)
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: On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them |
scientific article; zbMATH DE number 5043489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them |
scientific article; zbMATH DE number 5043489 |
Statements
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them (English)
0 references
4 August 2006
0 references
The authors study the problem of dictionary design for sparse representations. It is proved that the uniqueness of such factorization will be useful to generalise the K-means. The algorithm developed has been validated by numerical experiments. It is also mentioned that the work can be extended for future investigation in the area.
0 references
K-means
0 references
vector quantization
0 references
sparse representation
0 references
matching pursuit
0 references
0 references
0 references
0 references
0 references
0 references
0.8012002110481262
0 references
0.7982482314109802
0 references
0.7750717401504517
0 references
0.7672860026359558
0 references
0.766219973564148
0 references
