Computing and analyzing recoverable supports for sparse reconstruction (Q269197): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The minimum number of vertices of a simple polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagrams for centrally symmetric polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical exploration of compressed sampling recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sparse Representations in Arbitrary Redundant Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grassmannian frames with applications to coding and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting the d-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random sections of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Test Instances for Basis Pursuit Denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's theorem and the number of facets of centrally symmetric polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equiangular tight frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperplane cuts of an n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polar Polytopes and the Recovery of Sparse Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random projections of regular simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 19:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Computing and analyzing recoverable supports for sparse reconstruction
scientific article

    Statements

    Computing and analyzing recoverable supports for sparse reconstruction (English)
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    sparse recovery
    0 references
    hypercube sections
    0 references
    phase transition
    0 references
    compressed sensing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers