The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Compressed Sensing Off the Grid
Open accessAbstract
This paper investigates the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a grid, but can assume any values in the normalized frequency domain [0, 1]. An atomic norm minimization approach is proposed to exactly recover the unobserved samples and identify the unknown frequencies, which is then reformulated as an exact semidefinite program. Even with this continuous dictionary, it is shown that O(slog s log n) random samples are sufficient to guarantee exact frequency localization with high probability, provided the frequencies are well separated. Extensive numerical experiments are performed to illustrate the effectiveness of the proposed method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Self-citationBenchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Compressive Sensing [Lecture Notes]
Baraniuk, R. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286571 · Cited by 4,177
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Self-citationSpectral Analysis of Signals: The Missing Data Case
Wang, Y., Li, J., & Stoica, P. (2005) · Synthesis Lectures on Signal Processing · doi:10.1007/978-3-031-02525-9 · Cited by 2,890
A sparse signal reconstruction perspective for source localization with sensor arrays
Malioutov, D., Cetin, M., & Willsky, A. S. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850882 · Cited by 2,638
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
Hua, Y., & Sarkar, T. K. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.56027 · Cited by 1,537
Towards a Mathematical Theory of Super‐resolution
Candès, E. J., & Fernandez‐Granda, C. (2014) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21455 · Cited by 1,169
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
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
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
1 USER-FRIENDLY TAIL BOUNDS FOR SUMS OF RANDOM MATRICES
Tropp, J. A. (2010) · Cited by 1,018
Sensitivity to Basis Mismatch in Compressed Sensing
Chi, Y., Scharf, L. L., Pezeshki, A., & Calderbank, A. R. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2112650 · Cited by 920
Baraniuk, R., & Steeghs, P. (2007) · 2007 IEEE Radar Conference · doi:10.1109/radar.2007.374203 · Cited by 889
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 718
A Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
Self-citationRecovering Low-Rank Matrices From Few Coefficients in Any Basis
Gross, D. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2104999 · Cited by 602
Sparse nonnegative solution of underdetermined linear equations by linear programming
Donoho, D. L., & Tanner, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0502269102 · Cited by 577
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen
Carathéodory, C. (1911) · Rendiconti del Circolo Matematico di Palermo · doi:10.1007/bf03014795 · Cited by 564
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Sparse Sampling of Signal Innovations
Blu, T., Dragotti, P.-L., Vetterli, M., Marziliano, P., & Coulot, L. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914998 · Cited by 427
A Simpler Approach to Matrix Completion
RechtBenjamin (2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2185803 · Cited by 310
Stoica, P., Babu, P., & Li, J. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2086452 · Cited by 270
Positive Trigonometric Polynomials and Signal Processing Applications
Dumitrescu, B. (2007) · Springer eBooks · doi:10.1007/978-1-4020-5125-8 · Cited by 255
SPICE and LIKES: Two hyperparameter-free methods for sparse-parameter estimation
Stoica, P., & Babu, P. (2012) · Signal Processing · doi:10.1016/j.sigpro.2011.11.010 · Cited by 199
Sanyal, R., Sottile, F., & Sturmfels, B. (2011) · Mathematika · doi:10.1112/s002557931100132x · Cited by 73
Positivity of trigonometric polynomials
Megretski, A. (2004) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2003.1271743 · Cited by 38
Cited by
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
Lee, J., Gil, G.-T., & Lee, Y. H. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2557791 · Cited by 691
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
Self-citationDuarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Metadata
- Authors
- Tang, G., Bhaskar, B. N., Shah, P., & Recht, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-11
- Volume
- 59
- Issue
- 11
- Pages
- 7465-7490
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2565293665
- Cited by
- 1,163
- References
- 35
- FWCI
- 72.75
- 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.