Computer Science – Information Theory
Scientific paper
2010-08-18
Computer Science
Information Theory
28pages, 11 figures; fix minor errors of v1; add a new section on extended objects and a few figures
Scientific paper
This paper studies the problem of exact localization of sparse (point or extended) objects with noisy data. The crux of the proposed approach consists of random illumination. Several recovery methods are analyzed: the Lasso, BPDN and the One-Step Thresholding (OST). For independent random probes, it is shown that both recovery methods can localize exactly $s=\cO(m)$, up to a logarithmic factor, objects where $m$ is the number of data. Moreover, when the number of random probes is large the Lasso with random illumination has a performance guarantee for superresolution, beating the Rayleigh resolution limit. Numerical evidence confirms the predictions and indicates that the performance of the Lasso is superior to that of the OST for the proposed set-up with random illumination.
No associations
LandOfFree
Exact Localization and Superresolution with Noisy Data and Random Illumination 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 Exact Localization and Superresolution with Noisy Data and Random Illumination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Localization and Superresolution with Noisy Data and Random Illumination will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-507798