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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Morten Nielsen / rank
Normal rank
 
Property / author
 
Property / author: Morten Nielsen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10444-005-9009-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080709627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive greedy approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Huber concerning the convergence of projection pursuit regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized uncertainty principle and sparse representation in pairs of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly sparse representations from dictionaries are unique and independent of the sparseness measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponential convergence of matching pursuits in quasi-incoherent dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid representations for audiophonic signal encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Source Separation by Sparse Decomposition in a Signal Dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for simultaneous sparse approximation. I: Greedy pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous approximation by greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse solutions to linear inverse problems with multiple measurement vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse representation in pairs of bases / rank
 
Normal rank

Latest revision as of 14:19, 27 June 2024

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
    0 references