pith. sign in

arxiv: 1606.01295 · v2 · pith:S3ZVH2DPnew · submitted 2016-06-03 · 💻 cs.IT · math.IT

Weighted ell₁-Minimization for Sparse Recovery under Arbitrary Prior Information

classification 💻 cs.IT math.IT
keywords minimizationrecoverysignalsupportweightedwhenestimateestimates
0
0 comments X
read the original abstract

Weighted $\ell_1$-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted $\ell_1$-minimization when arbitrarily many distinct weights are permitted. For example, such a setup might be used when one has multiple estimates for the support of a signal, and these estimates have varying degrees of accuracy. Our analysis yields an extension to existing works that assume only a single support estimate set upon which a constant weight is applied. We include numerical experiments, with both synthetic signals and real video data, that demonstrate the benefits of allowing non-uniform weights in the reconstruction procedure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.