Computer Science – Information Theory
Scientific paper
2009-10-08
Computer Science
Information Theory
5 pages, 3 figures, submitted ICASSP 2010
Scientific paper
In this work, we study the problem of reconstructing a sparse signal from a limited number of linear 'incoherent' noisy measurements, when a part of its support is known. The known part of the support may be available from prior knowledge or from the previous time instant (in applications requiring recursive reconstruction of a time sequence of sparse signals, e.g. dynamic MRI). We study a modification of Basis Pursuit Denoising (BPDN) and bound its reconstruction error. A key feature of our work is that the bounds that we obtain are computable. Hence, we are able to use Monte Carlo to study their average behavior as the size of the unknown support increases. We also demonstrate that when the unknown support size is small, modified-BPDN bounds are much tighter than those for BPDN, and hold under much weaker sufficient conditions (require fewer measurements).
Lu Wei
Vaswani Namrata
No associations
LandOfFree
Modified Basis Pursuit Denoising(MODIFIED-BPDN) for Noisy Compressive Sensing with Partially Known Support 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 Modified Basis Pursuit Denoising(MODIFIED-BPDN) for Noisy Compressive Sensing with Partially Known Support, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified Basis Pursuit Denoising(MODIFIED-BPDN) for Noisy Compressive Sensing with Partially Known Support will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-50511