The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Atomic Norm Denoising With Applications to Line Spectral Estimation
Abstract
Motivated by recent work on atomic norms in inverse problems, we propose a new approach to line spectral estimation that provides theoretical guarantees for the mean-squared-error (MSE) performance in the presence of noise and without knowledge of the model order. We propose an abstract theory of denoising with atomic norms and specialize this theory to provide a convex optimization problem for estimating the frequencies and phases of a mixture of complex exponentials. We show that the associated convex optimization problem can be solved in polynomial time via semidefinite programming (SDP). We also show that the SDP can be approximated by an$\ell_{1}$-regularized least-squares problem that achieves nearly the same error rate as the SDP but can scale to much larger problems. We compare both SDP and$\ell_{1}$-based approaches with classical line spectral analysis methods and demonstrate that the SDP outperforms the$\ell_{1}$optimization which outperforms MUSIC, Cadzow's, and Matrix Pencil approaches in terms of MSE over a wide range of signal-to-noise ratios.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
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
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Ideal spatial adaptation by wavelet shrinkage
Donoho, D. L., & Johnstone, I. M. (1994) · Biometrika · doi:10.1093/biomet/81.3.425 · Cited by 8,760
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
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
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
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-citationTwo 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
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
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
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
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
Nonlinear Time Series Analysis
Kantz, H., & Schreiber, T. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755798 · Cited by 2,629
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
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
Singular-spectrum analysis: A toolkit for short, noisy chaotic signals
Vautard, R., Yiou, P., & Ghil, M. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90103-t · Cited by 1,460
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 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
Self-citationThe Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
Self-citationSensitivity 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
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
Self-citationSignal enhancement-a composite property mapping algorithm
CADZOW, J. A. (1988) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.1488 · Cited by 701
On the conditions used to prove oracle results for the Lasso
van de Geer, S. A., & Bühlmann, P. (2009) · Electronic Journal of Statistics · doi:10.1214/09-ejs506 · Cited by 684
Analysis of Time Series Structure: SSA and Related Techniques
Elsner, J. B. (2002) · Journal of the American Statistical Association · doi:10.1198/jasa.2002.s239 · Cited by 468
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
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
Persistence in high-dimensional linear predictor selection and the virtue of overparametrization
Greenshtein, E., & Ritov, Y. (2004) · Bernoulli · doi:10.3150/bj/1106314846 · Cited by 362
Imaging and time reversal in random media
Borcea, L., Papanicolaou, G., & Tsogka, C. (2002) · Inverse Problems · doi:10.1088/0266-5611/18/5/303 · Cited by 299
Positive Trigonometric Polynomials and Signal Processing Applications
Dumitrescu, B. (2007) · Springer eBooks · doi:10.1007/978-1-4020-5125-8 · Cited by 255
A Sparsity-Based Method for the Estimation of Spectral Lines From Irregularly Sampled Data
Bourguignon, S., Carfantan, H., & Idier, J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910275 · Cited by 92
Application of compressed sensing to the simulation of atomic systems
Andrade, X., Sanders, J. N., & Aspuru‐Guzik, A. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1209890109 · Cited by 52
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
On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data
Yang, Z., & Xie, L. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2420541 · Cited by 352
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
Channel Estimation for RIS-Aided mmWave MIMO Systems via Atomic Norm Minimization
He, J., Wymeersch, H., & Juntti, M. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3070064 · Cited by 319
Enhancing Sparsity and Resolution via Reweighted Atomic Norm Minimization
Yang, Z., & Xie, L. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2493987 · Cited by 304
Off-the-Grid Line Spectrum Denoising and Estimation With Multiple Measurement Vectors
Li, Y., & Chi, Y. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2496294 · Cited by 294
Metadata
- Authors
- Bhaskar, B. N., Tang, G., & Recht, B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2013-12
- Volume
- 61
- Issue
- 23
- Pages
- 5987-5999
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2028191993
- Cited by
- 579
- References
- 39
- FWCI
- 27.78
- 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.