Emergent Mind

Recovery Analysis for Weighted $\ell_1$-Minimization Using a Null Space Property

(1412.1565)
Published Dec 4, 2014 in cs.IT and math.IT

Abstract

We study the recovery of sparse signals from underdetermined linear measurements when a potentially erroneous support estimate is available. Our results are twofold. First, we derive necessary and sufficient conditions for signal recovery from compressively sampled measurements using weighted $\ell1$-norm minimization. These conditions, which depend on the choice of weights as well as the size and accuracy of the support estimate, are on the null space of the measurement matrix. They can guarantee recovery even when standard $\ell1$ minimization fails. Second, we derive bounds on the number of Gaussian measurements for these conditions to be satisfied, i.e., for weighted $\ell1$ minimization to successfully recover all sparse signals whose support has been estimated sufficiently accurately. Our bounds show that weighted $\ell1$ minimization requires significantly fewer measurements than standard $\ell_1$ minimization when the support estimate is relatively accurate.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.