Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices

preprint2013arXivOpen access

Abstract

This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool which represents points in a polytope by convex combinations of sparse vectors. The technique is elementary while leads to sharp results. It is shown that for any given constant t≥4/3t\ge {4/3}, in compressed sensing δtkA<(t−1)/tδ_{tk}^A < \sqrt{(t-1)/t} guarantees the exact recovery of all kk sparse signals in the noiseless case through the constrained ℓ1\ell_1 minimization, and similarly in affine rank minimization δtrM<(t−1)/tδ_{tr}^\mathcal{M}< \sqrt{(t-1)/t} ensures the exact reconstruction of all matrices with rank at most rr in the noiseless case via the constrained nuclear norm minimization. Moreover, for any ε>0ε>0, δtkA<t−1t+εδ_{tk}^A<\sqrt{\frac{t-1}{t}}+ε is not sufficient to guarantee the exact recovery of all kk-sparse signals for large kk. Similar result also holds for matrix recovery. In addition, the conditions δtkA<(t−1)/tδ_{tk}^A < \sqrt{(t-1)/t} and δtrM<(t−1)/tδ_{tr}^\mathcal{M}< \sqrt{(t-1)/t} are also shown to be sufficient respectively for stable recovery of approximately sparse signals and low-rank matrices in the noisy case.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.