Computing and analyzing recoverable supports for sparse reconstruction

  title={Computing and analyzing recoverable supports for sparse reconstruction},
  author={Christian Kruschel and Dirk A. Lorenz},
  journal={Advances in Computational Mathematics},
Designing computational experiments involving ℓ1 minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number k of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for example for small k or for certain matrices, simply placing entries with desired characteristics on a randomly chosen support will produce vectors which can be recovered by ℓ1 minimization. In this work, we… 
An infeasible-point subgradient method using adaptive approximate projections
A new subgradient method for the minimization of nonsmooth convex functions over a convex set using adaptive approximate projections only requiring to move within a certain distance of the exact projections (which decreases in the course of the algorithm) is proposed.
Computational aspects of compressed sensing


On Polar Polytopes and the Recovery of Sparse Representations
  • Mark D. Plumbley
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2007
This paper explores the sparse representation problem using the geometry of convex polytopes, and finds that the so-called polar polytope P* of the centrally symmetric polytopes P whose vertices are the atom pairs plusmnai is particularly helpful in providing geometrical insight into optimality conditions given by Fuchs and Tropp for non-unit-norm atom sets.
Breakdown of equivalence between the minimal l1-norm solution and the sparsest solution
This paper quantifies the 'sufficient sparsity' condition, defining an equivalence breakdown point (EBP), and describes a semi-empirical heuristic for predicting the local EBP at this ensemble of 'typical' matrices with unit norm columns.
On sparse representations in arbitrary redundant bases
  • J. Fuchs
  • Mathematics, Computer Science
    IEEE Transactions on Information Theory
  • 2004
The purpose of this contribution is to generalize some recent results on sparse representations of signals in redundant bases and give a sufficient condition for the unique sparsest solution to be the unique solution to both a linear program or a parametrized quadratic program.
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
The aim of this paper is to introduce a few key notions and applications connected to sparsity, targeting newcomers interested in either the mathematical aspects of this area or its applications.
Neighborly Polytopes And Sparse Solution Of Underdetermined Linear Equations
For large d, the overwhelming majority of systems of linear equations with d equations and 4d/3 unknowns have the following property: if there is a solution with fewer than .49d nonzeros, it is the unique minimum ` solution.
Geometrical Interpretations and Algorithmic Verification of Exact Solutions in Compressed Sensing
The result is a comprehensive study of the geometry of basis pursuit which contains many new insights to necessary geometrical conditions for unique solutions and an explicit number of equivalence classes of unique solutions.
A numerical exploration of compressed sampling recovery
This paper explores numerically the efficiency of $\lun$ minimization for the recovery of sparse signals from compressed sampling measurements in the noiseless case. Inspired by topological criteria
Sparse representations in unions of bases
It is proved that the result of Donoho and Huo, concerning the replacement of the /spl lscr//sup 0/ optimization problem with a linear programming problem when searching for sparse representations has an analog for dictionaries that may be highly redundant.
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
  • D. Donoho
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2006
The face numbers of randomly projected cross polytopes in the proportional-dimensional case where d ∼ δn, where the projector A is chosen uniformly at random from the Grassmann manifold of d-dimensional orthoprojectors of Rn, are studied.
Borsuk's theorem and the number of facets of centrally symmetric polytopes
Let C"={x~R": Ix~]<-i i=1 , . . . ,n} be the n-dimensional cube and A be a d-dimensional subspace of R" having no point in common with the ( n d 1 ) dimensional faces of C". We want to find a lower