Computing and analyzing recoverable supports for sparse reconstruction

DOI10.1007/S10444-015-9403-6zbMath1338.94018arXiv1309.2460OpenAlexW2144404742MaRDI QIDQ269197

Christian Kruschel, Dirk A. Lorenz

Publication date: 18 April 2016

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2460

zbMATH Keywords

phase transitionsparse recoverycompressed sensinghypercube sections

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

An infeasible-point subgradient method using adaptive approximate projections

Uses Software

• PDCO
• L1TestPack

Cites Work

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

This page was built for publication: Computing and analyzing recoverable supports for sparse reconstruction