Theoretical guarantees for graph sparse coding (Q778037): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.acha.2019.03.003 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128102175 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ACHA.2019.03.003 / rank | |||
Normal rank | |||
Latest revision as of 04:22, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theoretical guarantees for graph sparse coding |
scientific article |
Statements
Theoretical guarantees for graph sparse coding (English)
0 references
30 June 2020
0 references
sparse representations
0 references
graph sparse coding
0 references
graph regularization
0 references
manifold learning
0 references
signal recovery
0 references
orthogonal matching pursuit
0 references
basis pursuit
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
