On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264)

From MaRDI portal
Revision as of 00:34, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
scientific article

    Statements

    On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (English)
    0 references
    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 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references