On the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements
Information Theory
2013-03-22 v1 math.IT
Abstract
This short note proves the instance optimality of a solver, i.e a variant of \emph{basis pursuit denoising} with a fidelity constraint, when applied to the estimation of sparse (or compressible) signals observed by sparsely corrupted compressive measurements. The approach simply combines two known results due to Y. Plan, R. Vershynin and E. Cand\`es.
Keywords
Cite
@article{arxiv.1303.5097,
title = {On the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements},
author = {Laurent Jacques},
journal= {arXiv preprint arXiv:1303.5097},
year = {2013}
}
Comments
4 pages (all comments are welcome)