The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Off-the-Grid Line Spectrum Denoising and Estimation With Multiple Measurement Vectors
Open accessAbstract
Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is the spectrally-sparse signal, which is composed of a small number of spectral atoms with arbitrary frequencies on the unit interval. In this paper we study the problem of line spectrum denoising and estimation with an ensemble of spectrally-sparse signals composed of the same set of continuous-valued frequencies from their partial and noisy observations. Two approaches are developed based on atomic norm minimization and structured covariance estimation, both of which can be solved efficiently via semidefinite programming. The first approach aims to estimate and denoise the set of signals from their partial and noisy observations via atomic norm minimization, and recover the frequencies via examining the dual polynomial of the convex program. We characterize the optimality condition of the proposed algorithm and derive the expected error rate for denoising, demonstrating the benefit of including multiple measurement vectors. The second approach aims to recover the population covariance matrix from the partially observed sample covariance matrix by motivating its low-rank Toeplitz structure without recovering the signal ensemble. Performance guarantee is derived with a finite number of measurement vectors. The frequencies can be recovered via conventional spectrum estimation methods such as MUSIC from the estimated covariance matrix. Finally, numerical examples are provided to validate the favorable performance of the proposed algorithms, with comparisons against several existing approaches.
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
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
Multiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718 · cited 2×
“Finally, numerical examples are provided to validatethe performance of the proposed algorithms, with comparisons against several existing approaches.”
BackgroundMethodESPRIT-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
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
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.030 · Cited by 1,347
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
From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
Mishali, M., & Eldar, Y. C. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042414 · Cited by 1,168
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
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
Negahban, S. N. (2011) · Cited by 1,099
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
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
Self-citationCompressed sensing with coherent and redundant dictionaries
Candès, E. J., Eldar, Y. C., Needell, D., & Randall, P. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.10.002 · Cited by 898
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
Compressed Sensing for Wideband Cognitive Radios
Tian, Z., & Giannakis, G. B. (2007) · 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07 · doi:10.1109/icassp.2007.367330 · Cited by 736
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
Tropp, J. A. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.031 · Cited by 691
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
Estimating two-dimensional frequencies by matrix enhancement and matrix pencil
Hua, Y. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157226 · Cited by 508
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
Zhu, H., Leus, G., & Giannakis, G. B. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2109956 · Cited by 410
Rank Awareness in Joint Sparse Recovery
Davies, M. E., & Eldar, Y. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173722 · Cited by 351
Compressive MUSIC: Revisiting the Link Between Compressive Sensing and Array Signal Processing
Kim, J. M., Lee, O. K., & Ye, J. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2171529 · Cited by 269
Robust Spectral Compressed Sensing via Structured Matrix CompletionPreprint
Chen, Y., & Chi, Y. (n.d.) · Cited by 247
Self-citationRobust Spectral Compressed Sensing via Structured Matrix Completion
Chen, Y., & Chi, Y. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2343623 · Cited by 238
Self-citationA Discretization-Free Sparse and Parametric Approach for Linear Array Signal Processing
Yang, Z., Xie, L., & Zhang, C. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2339792 · Cited by 237
Subspace Methods for Joint Sparse Recovery
Lee, K., Bresler, Y., & Junge, M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2189196 · Cited by 229
Compressive Two-Dimensional Harmonic Retrieval via Atomic Norm Minimization
Chi, Y., & Chen, Y. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2386283 · Cited by 225
Self-citationRecovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
Ekanadham, C., Tranchina, D., & Simoncelli, E. P. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2160058 · Cited by 205
Sparsity and Structure in Hyperspectral Imaging : Sensing, Reconstruction, and Target Detection
Willett, R. M., Duarte, M. F., Davenport, M. A., & Baraniuk, R. G. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279507 · Cited by 200
1 Subspace Methods for Joint Sparse RecoveryPreprint
Lee, K., Bresler, Y., & Junge, M. (n.d.) · Cited by 181
Huang, Y.-F. (2005) · Elsevier eBooks · doi:10.1016/b978-012170960-0/50066-9 · Cited by 130
Pal, P., & Vaidyanathan, P. P. (2014) · IEEE Signal Processing Letters · doi:10.1109/lsp.2014.2314175 · Cited by 112
Compressive Parameter Estimation for Sparse Translation-Invariant Signals Using Polar Interpolation
Fyhn, K., Duarte, M. F., & Jensen, S. H. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385035 · Cited by 52
Joint sparsity recovery for spectral compressed sensing
Chi, Y. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854340 · Cited by 29
Self-citation
Cited by
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Metadata
- Authors
- Li, Y., & Chi, Y.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-03
- Volume
- 64
- Issue
- 5
- Pages
- 1257-1269
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1541064563
- Cited by
- 294
- References
- 37
- FWCI
- 22.55
- 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.