pith. sign in

arxiv: 0904.3780 · v1 · submitted 2009-04-24 · 🧮 math.NA · cs.IT· math.IT

Noisy Signal Recovery via Iterative Reweighted L1-Minimization

classification 🧮 math.NA cs.ITmath.IT
keywords l1-minimizationmethodreweightedbeennoisyprovableresultsstandard
0
0 comments X
read the original abstract

Compressed sensing has shown that it is possible to reconstruct sparse high dimensional signals from few linear measurements. In many cases, the solution can be obtained by solving an L1-minimization problem, and this method is accurate even in the presence of noise. Recent a modified version of this method, reweighted L1-minimization, has been suggested. Although no provable results have yet been attained, empirical studies have suggested the reweighted version outperforms the standard method. Here we analyze the reweighted L1-minimization method in the noisy case, and provide provable results showing an improvement in the error bound over the standard bounds.

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.