Computer Science – Information Theory
Scientific paper
2011-02-02
Computer Science
Information Theory
submitted to IEEE Trans. Inf. Theory
Scientific paper
We present an uncertainty relation for the representation of signals in two different general (possibly redundant or incomplete) signal sets. This uncertainty relation is relevant for the analysis of signals containing two distinct features each of which can be described sparsely in a suitable general signal set. Furthermore, the new uncertainty relation is shown to lead to improved sparsity thresholds for recovery of signals that are sparse in general dictionaries. Specifically, our results improve on the well-known $(1+1/d)/2$-threshold for dictionaries with coherence $d$ by up to a factor of two. Furthermore, we provide probabilistic recovery guarantees for pairs of general dictionaries that also allow us to understand which parts of a general dictionary one needs to randomize over to "weed out" the sparsity patterns that prohibit breaking the square-root bottleneck.
Bölcskei Helmut
Durisi Giuseppe
Kuppinger Patrick
No associations
LandOfFree
Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets 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 Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-81814