Computer Science – Information Theory
Scientific paper
2012-03-27
Computer Science
Information Theory
submitted
Scientific paper
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 solely 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.
Bracher Annina
Pope Graeme
Studer Christoph
No associations
LandOfFree
Probabilistic Recovery Guarantees for Sparsely Corrupted Signals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Probabilistic Recovery Guarantees for Sparsely Corrupted Signals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Recovery Guarantees for Sparsely Corrupted Signals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-641235