Probabilistic Recovery Guarantees for Sparsely Corrupted Signals

DOI10.1109/TIT.2013.2240436MaRDI QIDQ2989275zbMATH OpenOpenAlexFDO

Authors Graeme Pope, Annina Bracher, Christoph Studer

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.6001

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

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.

Cited in

(6)

• Sharp recovery bounds for convex demixing, with applications
• Heuristics for the network design problem with connectivity requirements
• Stable restoration and separation of approximately sparse signals
• A general theory for subspace-sparse recovery
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization

This page was built for publication: Probabilistic Recovery Guarantees for Sparsely Corrupted Signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989275)