Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708)

From MaRDI portal
Revision as of 23:00, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
scientific article

    Statements

    Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (English)
    0 references
    0 references
    0 references
    17 December 2007
    0 references
    0 references
    sparse approximations
    0 references
    greedy algorithm
    0 references
    basis pursuit algorithm
    0 references
    linear programming
    0 references
    multichannel representations
    0 references
    sparse component analysis
    0 references