Modified Compressive Sensing
Introduction:
We study the problem of
reconstructing a sparse signal from a limited number of its linear
projections when a part of its support is known. This may be available
from prior knowledge. Alternatively, in a problem of recursively
reconstructing time sequences of sparse spatial signals, one may use
the support estimate from the previous time instant as the "known"
part of the support. The idea of our solution (modified-CS) is
to solve a convex relaxation of the following problem: find the
sparsest possible signal that satisfies the data constraint and whose
support contains the "known"
part of the support. In other words, we try to find a signal with the
smallest number of new additions to the known support that satisfies
the data constraint.
We derive sufficient conditions for exact reconstruction using modified-CS. These are much weaker than the sufficient conditions needed for CS, particularly when the known part of the support is large compared to the unknown part.
| Paper |
Code | Email |
Results |
Paper
1. Modified Compressive Sensing for Noiseless Measurements
2. Modified Compressive Sensing for Noisy Measurements
Wei Lu and Namrata Vaswani, Modified Basis Pursuit Denoising (Modified-BPDN) For Noisy Compressive Sensing With Partially Known Support, IEEE Intl. Conf. Acous. Speech. Sig.Proc.(ICASSP), 2010
Modified-CS(noiseless): modcs.zip(small size signal) modcslargedata.zip(large size signal(64X64 image and larger))
Modified-CS-residual(noisy):
modcsresidual.zip
Modified-CS-residual for fMRI: fMRI.zip
Email: luwei@iastate.edu











