The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Sensitivity to Basis Mismatch in Compressed Sensing
Abstract
The theory of compressed sensing suggests that successful inversion of an image of the physical world (broadly defined to include speech signals, radar/sonar returns, vibration records, sensor array snapshot vectors, 2-D images, and so on) for its source modes and amplitudes can be achieved at measurement dimensions far lower than what might be expected from the classical theories of spectrum or modal analysis, provided that the image is sparse in an apriori known basis. For imaging problems in spectrum analysis, and passive and active radar/sonar, this basis is usually taken to be a DFT basis. However, in reality no physical field is sparse in the DFT basis or in any apriori known basis. No matter how finely we grid the parameter space the sources may not lie in the center of the grid cells and consequently there is mismatch between the assumed and the actual bases for sparsity. In this paper, we study the sensitivity of compressed sensing to mismatch between the assumed and the actual sparsity bases. We start by analyzing the effect of basis mismatch on the bestk-term approximation error, which is central to providing exact sparse recovery guarantees. We establish achievable bounds for thel1error of the bestk-term approximation and show that these bounds grow linearly with the image (or grid) dimension and the mismatch level between the assumed and actual bases for sparsity. We then derive bounds, with similar growth behavior, for the basis pursuitl1recovery error, indicating that the sparse recovery may suffer large errors in the presence of basis mismatch. Although, we present our results in the context of basis pursuit, our analysis applies to any sparse recovery principle that relies on the accuracy of bestk-term approximations for its performance guarantees. We particularly highlight the problematic nature of basis mismatch in Fourier imaging, where spillage from off-grid DFT components turns a sparse representation into an incompressible one. We substantiate our mathematical analysis by numerical examples that demonstrate a considerable performance degradation for image inversion from compressed sensing measurements in the presence of basis mismatch, for problem sizes common to radar and sonar.
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
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
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
ESPRIT-estimation of signal parameters via rotational invariance techniques
Roy, R., & Kailath, T. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.32276 · Cited by 7,289
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
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory
Van Trees, H. L. (2002) · Wiley eBooks · doi:10.1002/0471221104 · Cited by 5,188
Two decades of array signal processing research: the parametric approach
Krim, H., & Viberg, M. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.526899 · Cited by 4,719
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
Compressive Sensing [Lecture Notes]
Baraniuk, R. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286571 · Cited by 4,177
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
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
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
Compressed Channel Sensing: A New Approach to Estimating Sparse Multipath Channels
Bajwa, W. U., Haupt, J., Sayeed, A. M., & Nowak, R. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2042415 · Cited by 1,152
ESPRIT--A subspace rotation approach to estimation of parameters of cisoids in noise
Roy, R., Paulraj, A., & Kailath, T. (1986) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1986.1164935 · Cited by 1,088
High-Resolution Radar via Compressed Sensing
Herman, M. A., & Strohmer, T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2014277 · Cited by 1,048
Tufts, D. W., & Kumaresan, R. (1982) · Proceedings of the IEEE · doi:10.1109/proc.1982.12428 · Cited by 1,018
Imaging via Compressive Sampling
Romberg, J. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914729 · Cited by 1,014
Baraniuk, R., & Steeghs, P. (2007) · 2007 IEEE Radar Conference · doi:10.1109/radar.2007.374203 · Cited by 889
Needell, D., & Vershynin, R. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042412 · Cited by 850
Optimized Projections for Compressed Sensing
Elad, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.900760 · Cited by 835
Bayesian Bounds for Parameter Estimation and Nonlinear Filtering/Tracking
Van Trees, H. L., & Bell, K. L. (2007) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544198 · Cited by 611
(2012) · SpringerReference · doi:10.1007/springerreference_205634 · Cited by 526
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Haupt, J., Bajwa, W. U., Raz, G., & Nowak, R. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2070191 · Cited by 424
Singular value decomposition and improved frequency estimation using linear prediction
Tufts, D. W., & Kumaresan, R. (1982) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1982.1163927 · Cited by 239
Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
Jafarpour, S., Xu, W., Hassibi, B., & Calderbank, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025528 · Cited by 174
Huang, Y.-F. (2005) · Elsevier eBooks · doi:10.1016/b978-012170960-0/50066-9 · Cited by 130
Cited by
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Enabling Joint Communication and Radar Sensing in Mobile Networks—A Survey
Zhang, J. A., Rahman, M. L., Wu, K., Huang, X., Guo, Y. J., Chen, S., & Yuan, J. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3122519 · Cited by 1,091
MIMO Radar for Advanced Driver-Assistance Systems and Autonomous Driving: Advantages and Challenges
Sun, S., Petropulu, A. P., & Poor, H. V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2978507 · Cited by 632
Atomic Norm Denoising With Applications to Line Spectral Estimation
Bhaskar, B. N., Tang, G., & Recht, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2273443 · Cited by 579
Metadata
- Authors
- Chi, Y., Scharf, L. L., Pezeshki, A., & Calderbank, A. R.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2011-05
- Volume
- 59
- Issue
- 5
- Pages
- 2182-2195
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2123457453
- Cited by
- 920
- References
- 31
- FWCI
- 48.07
- Type
- journal article
- Language
- en
- Open access
- closed
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.