Computing and analyzing recoverable supports for sparse reconstruction
From MaRDI portal
Abstract: Designing computational experiments involving minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for small and for certain matrices, simply placing entries with desired characteristics on a randomly chosen support will produce vectors which can be recovered by minimization. In this work, we consider the case of large and propose both a methodology to quickly check whether a given vector is recoverable, and to construct vectors with the largest possible support. Moreover, we gain new insights in the recoverability in a non-asymptotic regime. The theoretical results are illustrated with computational experiments.
Recommendations
- Performance Analysis for Sparse Support Recovery
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- Sparse signal reconstruction via iterative support detection
- Sparse recovery with partial support knowledge
- Support Recovery for Sparse Multidimensional Phase Retrieval
- Sparse Reconstruction by Separable Approximation
- Computable Performance Bounds on Sparse Recovery
- Exact support recovery for linear inverse problems with sparsity constraints
- scientific article; zbMATH DE number 5853153
- Sparse recovery with integrality constraints
Cites work
- A mathematical introduction to compressive sensing
- A numerical exploration of compressed sampling recovery
- Atomic Decomposition by Basis Pursuit
- Borsuk's theorem and the number of facets of centrally symmetric polytopes
- Breakdown of equivalence between the minimal ^1-norm solution and the sparsest solution
- Constructing Test Instances for Basis Pursuit Denoising
- Convex Polytopes
- Cutting the d-cube
- Diagrams for centrally symmetric polytopes
- Equiangular tight frames
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Grassmannian frames with applications to coding and communication
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Hyperplane cuts of an n-cube
- Lectures on Polytopes
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On Polar Polytopes and the Recovery of Sparse Representations
- On Projection Algorithms for Solving Convex Feasibility Problems
- On random sections of the cube
- On Sparse Representations in Arbitrary Redundant Bases
- Random projections of regular simplices
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Sparse representations in unions of bases
- The maximum numbers of faces of a convex polytope
- The minimum number of vertices of a simple polytope
- Uncertainty principles and ideal atomic decomposition
Cited in
(5)- Sparse reconstruction with multiple Walsh matrices
- Scaling law for recovering the sparsest element in a subspace
- An infeasible-point subgradient method using adaptive approximate projections
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- Exact support recovery for sparse spikes deconvolution
This page was built for publication: Computing and analyzing recoverable supports for sparse reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269197)
