The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Vandermonde Decomposition of Multilevel Toeplitz Matrices With Application to Multidimensional Super-Resolution
Open accessAbstract
The Vandermonde decomposition of Toeplitz matrices, discovered by Carathéodory and Fejér in the 1910s and rediscovered by Pisarenko in the 1970s, forms the basis of modern subspace methods for 1-D frequency estimation. Many related numerical tools have also been developed for multidimensional (MD), especially 2-D, frequency estimation; however, a fundamental question has remained unresolved as to whether an analog of the Vandermonde decomposition holds for multilevel Toeplitz matrices in the MD case. In this paper, an affirmative answer to this question and a constructive method for finding the decomposition are provided when the matrix rank is lower than the dimension of each Toeplitz block. A numerical method for searching for a decomposition is also proposed when the matrix rank is higher. The new results are applied to study the MD frequency estimation within the recent super-resolution framework. A precise formulation of the atomic $\ell _{0}$ norm is derived using the Vandermonde decomposition. Practical algorithms for frequency estimation are proposed based on the relaxation techniques. Extensive numerical simulations are provided to demonstrate the effectiveness of these algorithms compared with the existing atomic norm and subspace methods.
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., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
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
Spectral 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
Self-citationSDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
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
The Retrieval of Harmonics from a Covariance Function
Pisarenko, V. F. (1973) · Geophysical Journal International · doi:10.1111/j.1365-246x.1973.tb03424.x · Cited by 1,109
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
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
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
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
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
Self-citationEnhancing 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
Self-citationLargest separable balls around the maximally mixed bipartite quantum state
Gurvits, L., & Barnum, H. (2002) · Physical Review A · doi:10.1103/physreva.66.062311 · Cited by 281
Robust Spectral Compressed Sensing via Structured Matrix CompletionPreprint
Chen, Y., & Chi, Y. (n.d.) · Cited by 247
Robust 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
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
Positive Trigonometric Polynomials and Signal Processing Applications
Dumitrescu, B. (2017) · Signals and Communication Technology · doi:10.1007/978-3-319-53688-0 · Cited by 206
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
Positive Trigonometric Polynomials and Signal Processing Applications
Dumitrescu, B. (2007) · Springer eBooks · doi:10.1007/978-1-4020-5125-8 · Cited by 141
Two-dimensional angle and polarization estimation using the ESPRIT algorithm
Li, J., & Compton, R. T. (1992) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.142630 · Cited by 121
A pencil-MUSIC algorithm for finding two-dimensional angles and polarizations using crossed dipoles
Hua, Y. (1993) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.233122 · Cited by 110
A New Frequency Estimation Method for Equally and Unequally Spaced Data
Андерссон, Ф., Carlsson, M., Tourneret, J., & Wendt, H. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2358961 · Cited by 81
Generalizing Caratheodory's uniqueness of harmonic parameterization to N dimensions
Sidiropoulos, N. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923759 · Cited by 53
Factorization of finite rank Hankel and Toeplitz matrices
Ellis, R. L., & Lay, D. C. (1992) · Linear Algebra and its Applications · doi:10.1016/0024-3795(92)90420-f · Cited by 21
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
Self-citationLimited feedforward waveform design for OFDM dual-functional radar-communications
Keskin, M. F., Koivunen, V., & Wymeersch, H. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3076894 · Cited by 188
Metadata
- Authors
- Yang, Z., Xie, L., & Stoica, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-06
- Volume
- 62
- Issue
- 6
- Pages
- 3685-3701
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2962727817
- Cited by
- 292
- References
- 29
- FWCI
- 22.74
- 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.