Probabilistic Recovery Guarantees for Sparsely Corrupted Signals

Abstract

We consider the recovery of sparse signals subject to sparse interference, as introduced in Studer et al., IEEE Trans. IT, 2012. We present novel probabilistic recovery guarantees for this framework, covering varying degrees of knowledge of the signal and interference support, which are relevant for a large number of practical applications. Our results assume that the sparsifying dictionaries are characterized by coherence parameters and we require randomness only in the signal and/or interference. The obtained recovery guarantees show that one can recover sparsely corrupted signals with overwhelming probability, even if the sparsity of both the signal and interference scale (near) linearly with the number of measurements.

arXiv commentsubmitted

References in corpus (7)

• Sparsity and Incoherence in Compressive Sampling
• Modified-CS: Modifying Compressive Sensing for Problems with Partially Known Support
• LS-CS-residual (LS-CS): Compressive Sensing on Least Squares Residual
• Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
• A Short Note on Compressed Sensing with Partially Known Signal Support
• Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions
• Sharp recovery bounds for convex demixing, with applications