The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
Open accessAbstract
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, although the known part may contain some errors. The “known” part of the support, denoted T, 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. The idea of our proposed solution (modified-CS) is to solve a convex relaxation of the following problem: find the signal that satisfies the data constraint and is sparsest outside of T. We obtain sufficient conditions for exact reconstruction using modified-CS. These are much weaker than those needed for compressive sensing (CS) when the sizes of the unknown part of the support and of errors in the known part are small compared to the support size. An important extension called regularized modified-CS (RegModCS) is developed which also uses prior signal estimate knowledge. Simulation comparisons for both sparse and compressible signals are shown.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559 · cited 1×
“other potential applications where sparse reconstruction for time sequences of signals/images may be needed, e.g. see [3], [4]. Sparse reconstruction has been well studied for a while, e.g. see [5], [6]. Recent work on Compressed Sensing (CS) gives conditions for its exact reconstruction [7], [8], [9] and bounds the e…”
BackgroundJust relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1
Foucart, S., & Lai, M.-J. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.09.001 · Cited by 715
k‐t FOCUSS: A general compressed sensing framework for high resolution dynamic MRI
Jung, H., Sung, K., Nayak, K. S., Kim, E. Y., & Ye, J. C. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21757 · Cited by 669
Signal Reconstruction From Noisy Random Projections
Haupt, J., & Nowak, R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880031 · Cited by 608
Compressed sensing in dynamic MRI
Gamper, U., Boesiger, P., & Kozerke, S. (2008) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21477 · Cited by 569
Compressive Sensing for Background Subtraction
Cevher, V., Sankaranarayanan, A., Duarte, M. F., Reddy, D., Baraniuk, R. G., & Chellappa, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_12 · Cited by 305
Kalman filtered Compressed Sensing
Vaswani, N. (2008) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2008.4711899 · Cited by 283
Self-citationLS-CS-Residual (LS-CS): Compressive Sensing on Least Squares Residual
Vaswani, N. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2048105 · Cited by 160
Self-citationRLS-weighted Lasso for adaptive estimation of sparse signals
Angelosante, D., & Giannakis, G. B. (2009) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2009.4960316 · Cited by 104
Compressive Sensing Reconstruction With Prior Information by Iteratively Reweighted Least-Squares
Miosso, C. J., von Borries, R. F., Argáez, M., Velázquez, L., Quintero, C., & Potes, C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016889 · Cited by 103
Modified compressive sensing for real-time dynamic MR imaging
Lu, W., & Vaswani, N. (2009) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2009.5414208 · Cited by 58
Self-citationReal-time dynamic MR image reconstruction using Kalman Filtered Compressed Sensing
Qiu, C., Lu, W., & Vaswani, N. (2009) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2009.4959603 · Cited by 55
Self-citationA numerical exploration of compressed sampling recovery
Dossal, C., Gabriel Peyré, A., & Fadili, J. M. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.11.022 · Cited by 44
Cited by
Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning
Zhang, Z., & Rao, B. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2159773 · Cited by 868
Signal Processing With Compressive Measurements
Davenport, M. A., Boufounos, P. T., Wakin, M. B., & Baraniuk, R. G. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039178 · Cited by 623
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
Vaswani, N., Bouwmans, T., Javed, S., & Narayanamurthy, P. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2826566 · Cited by 356
Self-citationCompressed Sensing for Wireless Communications: Useful Tips and Tricks
Choi, J. W., Shim, B., Ding, Y., Rao, B., & Kim, D. I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2664421 · Cited by 351
Recovering Compressively Sampled Signals Using Partial Support Information
Friedlander, M. P., Mansour, H., Saab, R., & Yilmaz, Ö. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2167214 · Cited by 261
Metadata
- Authors
- Vaswani, N., & Lu, W.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-09
- Volume
- 58
- Issue
- 9
- Pages
- 4595-4607
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2762625016
- Cited by
- 517
- References
- 26
- FWCI
- 46.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.