The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Restricted isometry properties and nonconvex compressive sensing
Open accessAbstract
The recently emerged field known as compressive sensing has produced powerful results showing the ability to recover sparse signals from surprisingly few linear measurements, using ℓ 1 minimization. In previous work, numerical experiments showed that ℓ p minimization with 0 < p < 1 recovers sparse signals from fewer linear measurements than does ℓ 1 minimization. It was also shown that a weaker restricted isometry property is sufficient to guarantee perfect recovery in the ℓ p case. In this work, we generalize this result to an ℓ p variant of the restricted isometry property, and then determine how many random, Gaussian measurements are sufficient for the condition to hold with high probability. The resulting sufficient condition is met by fewer measurements for smaller p . This adds to the theoretical justification for the methods already being applied to replacing high-dose CT scans with a small number of x-rays and reducing MRI scanning time. The potential benefits extend to any application of compressive sensing.
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
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
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Large Deviations Techniques and Applications
Dembo, A., & Zeitouni, O. (1998) · Springer eBooks · doi:10.1007/978-1-4612-5320-4 · Cited by 3,019
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Cited by
Iteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
Iteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248
Self-citation$L_{1/2}$ Regularization: A Thresholding Representation Theory and a Fast Solver
Xu, Z., Chang, X., Xu, F., & Zhang, H. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197412 · Cited by 1,062
A Systematic Review of Compressive Sensing: Concepts, Implementations and Applications
Rani, M., Dhok, S. B., & Deshmukh, R. B. (2018) · IEEE Access · doi:10.1109/access.2018.2793851 · Cited by 530
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
Metadata
- Authors
- Chartrand, R., & Staneva, V.
- Venue
- Inverse Problems
- Publisher
- IOP Publishing
- Published
- 2008-05-14
- Volume
- 24
- Issue
- 3
- Pages
- 035020
- ISSN
- 0266-5611 (ISSN-L)
- 1361-6420
- OpenAlex
- W2025666718
- Cited by
- 597
- References
- 27
- FWCI
- 24.51
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Restricted isometry properties and nonconvex compressive sensing. https://app.cochat.ai/papers/10.1088/0266-5611/24/3/035020
- The paper
- Chartrand, R., & Staneva, V. (2008). Restricted isometry properties and nonconvex compressive sensing. Inverse Problems. https://doi.org/10.1088/0266-5611/24/3/035020
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.