期刊
IEEE SIGNAL PROCESSING LETTERS
卷 22, 期 10, 页码 1703-1707出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LSP.2015.2426654
关键词
Compressed sensing; denoising; nonconvex optimization; sparsity; weighted l(p) minimization
资金
- NSERC of Canada
We study the problem of recovering sparse and compressible signals using a weighted l(p) minimization with 0 < p <= 1 from noisy compressed sensing measurements when part of the support is known a priori. To better model different types of non-Gaussian (bounded) noise, the minimization program is subject to a data-fidelity constraint expressed as the l(p)(2 <= q < infinity) norm of the residual error. We show theoretically that the reconstruction error of this optimization is bounded (stable) if the sensing matrix satisfies an extended restricted isometry property. Numerical results show that the proposed method, which extends the range of and comparing with previous works, outperforms other noise-aware basis pursuit programs. For p < 1 since the optimization is not convex, we use a variant of an iterative reweighted l(2) algorithm for computing a local minimum.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据