Greedy-like algorithms for the cosparse analysis model (Q2437331): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Theory for Sampling Signals From a Union of Subspaces / 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: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive greedy approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the restricted isometry constant \(\delta _{2k}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Sensing and Redundant Dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Pursuit for Compressive Sensing Signal Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Recovery With Orthogonal Matching Pursuit Under RIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cosparse analysis model and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis versus synthesis in signal priors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing with coherent and redundant dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Sparse Analysis Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteratively reweighted least squares minimization for sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform uncertainty principle for Bernoulli and subgaussian ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the restricted isometry property for random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity and Smoothness Via the Fused Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix recipes for hard thresholding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-asymptotic theory of random matrices: extreme singular values / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting faces of randomly projected polytopes when the projection radically lowers dimension / rank
 
Normal rank

Latest revision as of 10:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Greedy-like algorithms for the cosparse analysis model
scientific article

    Statements

    Greedy-like algorithms for the cosparse analysis model (English)
    0 references
    0 references
    3 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    sparse representations
    0 references
    compressed sensing
    0 references
    synthesis
    0 references
    analysis
    0 references
    CoSaMP
    0 references
    subspace-pursuit
    0 references
    iterative hard thresholding
    0 references
    hard thresholding pursuit
    0 references
    0 references
    0 references