The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Robust Spectral Compressed Sensing via Structured Matrix Completion
Open accessAbstract
This paper explores the problem of spectral compressed sensing, which aims to recover a spectrally sparse signal from a small random subset of its n time domain samples. The signal of interest is assumed to be a superposition of r multidimensional complex sinusoids, while the underlying frequencies can assume any continuous values in the normalized frequency domain. Conventional compressed sensing paradigms suffer from the basis mismatch issue when imposing a discrete dictionary on the Fourier representation. To address this issue, we develop a novel algorithm, called enhanced matrix completion (EMaC), based on structured matrix completion that does not require prior knowledge of the model order. The algorithm starts by arranging the data into a low-rank enhanced form exhibiting multifold Hankel structure, and then attempts recovery via nuclear norm minimization. Under mild incoherence conditions, EMaC allows perfect recovery as soon as the number of samples exceeds the order of r log4n, and is stable against bounded noise. Even if a constant portion of samples are corrupted with arbitrary magnitude, EMaC still allows exact recovery, provided that the sample complexity exceeds the order of r2log3n. Along the way, our results demonstrate the power of convex relaxation in completing a low-rank multifold Hankel or Toeplitz matrix from minimal observed entries. The performance of our algorithm and its applicability to super resolution are further validated by numerical experiments.
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
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Cited by
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Self-citationOn 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
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
Self-citation
Metadata
- Authors
- Chen, Y., & Chi, Y.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-10
- Volume
- 60
- Issue
- 10
- Pages
- 6576-6601
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2064771273
- Cited by
- 238
- References
- 1
- FWCI
- 21.51
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust Spectral Compressed Sensing via Structured Matrix Completion. https://app.cochat.ai/papers/10.1109/tit.2014.2343623
- The paper
- Chen, Y., & Chi, Y. (2014). Robust Spectral Compressed Sensing via Structured Matrix Completion. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2014.2343623
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.