The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Newtonized Orthogonal Matching Pursuit: Frequency Estimation Over the Continuum
Open accessAbstract
We propose a fast sequential algorithm for the fundamental problem of estimating frequencies and amplitudes of a noisy mixture of sinusoids. The algorithm is a natural generalization of Orthogonal Matching Pursuit (OMP) to the continuum using Newton refinements, and hence is termed Newtonized OMP (NOMP). Each iteration consists of two phases: detection of a new sinusoid, and sequential Newton refinements of the parameters of already detected sinusoids. The refinements play a critical role in two ways: 1) sidestepping the potential basis mismatch from discretizing a continuous parameter space and 2) providing feedback for locally refining parameters estimated in previous iterations. We characterize convergence and provide a constant false alarm rate (CFAR) based termination criterion. By benchmarking against the Cramér-Rao Bound, we show that NOMP achieves near-optimal performance under a variety of conditions. We compare the performance of NOMP with classical algorithms such as MUSIC and more recent Atomic norm Soft Thresholding (AST) and Lasso algorithms, both in terms of frequency estimation accuracy and run time.
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 new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
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
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
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
Detection, Estimation, And Modulation Theory
Trees, H. L. V. (1968) · Cited by 5,969
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
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
Detection of signals by information theoretic criteria
Wax, M., & Kailath, T. (1985) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1985.1164557 · Cited by 3,426
Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty - I
Slepian, D., & Pollak, H. O. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03976.x · Cited by 2,492
Introduction To Numerical Analysis
Hildebrand, F. B. (1956) · Cited by 1,967
Pathwise coordinate optimization
Friedman, J., Hastie, T., Höfling, H., & Tibshirani, R. (2007) · The Annals of Applied Statistics · doi:10.1214/07-aoas131 · Cited by 1,895
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
Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
Slepian, D. (1978) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1978.tb02104.x · Cited by 1,741
Iterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
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
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
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
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
Analysis of CFAR processors in nonhomogeneous background
Gandhi, P. P., & Kassam, S. A. (1988) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.7185 · Cited by 787
Coordinate descent algorithms for lasso penalized regressionPreprint
Wu, T. T., & Lange, K. L. (2008) · Cited by 735
Yardibi, T., Li, J., Stoica, P., Xue, M., & Baggeroer, A. B. (2010) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2010.5417172 · Cited by 699
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
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
Coordinate descent algorithms for lasso penalized regression
Wu, T. T., & Lange, K. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas147 · Cited by 563
Efficient mixed-spectrum estimation with applications to target feature extraction
Li, J., & Stoica, P. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.485924 · Cited by 546
Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
Davenport, M. A., & Wakin, M. B. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054653 · Cited by 519
Super-Resolution from Noisy Data
Candès, E. J., & Fernandez-Granda, C. (2013) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-013-9292-3 · Cited by 392
Bayesian Bounds for Parameter Estimation and Nonlinear Filtering/Tracking
Dosso, S. (2008) · The Journal of the Acoustical Society of America · doi:10.1121/1.2897043 · Cited by 324
Approximation and learning by greedy algorithms
Barron, A. R., Cohen, A., Dahmen, W., & DeVore, R. A. (2008) · The Annals of Statistics · doi:10.1214/009053607000000631 · Cited by 305
Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
Zhang, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146690 · Cited by 248
Near Minimax Line Spectral Estimation
Tang, G., Bhaskar, B. N., & Recht, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2368122 · Cited by 171
Super-resolution of point sources via convex programming
Fernandez‐Granda, C. (2015) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaw005 · Cited by 151
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2009) · Defense Technical Information Center (DTIC) · doi:10.21236/ada633835 · Cited by 140
DFT-based Estimation of Damped Oscillation Parameters in Low-Frequency Mechanical Spectroscopy
Duda, K., Magalas, L. B., Majewski, M., & Zieliński, T. P. (2011) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2011.2113124 · Cited by 104
Linear system identification via atomic norm regularization
Shah, P., Bhaskar, B. N., Tang, G., & Recht, B. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426006 · Cited by 101
Frequency and Damping Estimation Methods - An Overview
Zieliński, T. P., & Duda, K. (2011) · Metrology and Measurement Systems · doi:10.2478/v10178-011-0051-y · Cited by 98
Orthogonal Matching Pursuit with ReplacementPreprint
Jain, P., Tewari, A., & Dhillon, I. S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.2774 · Cited by 50
A Geometrical Study of Matching Pursuit Parametrization
Jacques, L., & Vleeschouwer, C. D. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.917379 · Cited by 25
Cited by
Zhang, R., Cheng, L., Wang, S., Lou, Y., Gao, Y., Wu, W., & Ng, D. W. K. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3351856 · Cited by 318
Channel Estimation for Extremely Large-Scale Massive MIMO Systems
Han, Y., Jin, S., Wen, C.-K., & Ma, X. (2020) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2019.2963877 · Cited by 282
Beam Alignment in mmWave V2X Communications: A Survey
Tan, J., Luan, T. H., Guan, W., Wang, Y., Peng, H., Zhang, Y., Zhao, D., & Lu, N. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3383093 · Cited by 75
Metadata
- Authors
- Mamandipoor, B., Ramasamy, D., & Madhow, U.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-10-01
- Volume
- 64
- Issue
- 19
- Pages
- 5066-5081
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2139961842
- Cited by
- 262
- References
- 43
- FWCI
- 12.95
- 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.