The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Error correction via linear programming
Abstract
Suppose we wish to transmit a vector f ϵ Rnreliably. A frequently discussed approach consists in encoding f with an m by n coding matrix A. Assume now that a fraction of the entries of Af are corrupted in a completely arbitrary fashion by an error e. We do not know which entries are affected nor do we know how they are affected. Is it possible to recover f exactly from the corrupted m-dimensional vector y = Af + e?
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
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
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
Self-citation
Cited by
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Self-citationAdvances on Spectrum Sensing for Cognitive Radio Networks: Theory and Applications
Ali, A., & Hamouda, W. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2631080 · Cited by 624
Restricted isometry properties and nonconvex compressive sensing
Chartrand, R., & Staneva, V. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/3/035020 · Cited by 597
Image melding: combining inconsistent images using patch-based synthesis
Darabi, S., Shechtman, E., Barnes, C., Goldman, D. B., & Sen, P. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185578 · Cited by 550
Bayesian Compressive Sensing Via Belief Propagation
Baron, D., Sarvotham, S., & Baraniuk, R. G. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027773 · Cited by 498
A new compressive imaging camera architecture using optical-domain compression:
Takhar, D., Laska, J. N., Wakin, M. B., Duarte, M. F., Baron, D., Sarvotham, S., Kelly, K. F., & Baraniuk, R. G. (2006) · SPIE Proceedings · doi:10.1117/12.659602 · Cited by 497
Minimization of $\ell_{1-2}$ for Compressed Sensing
Yin, P., Lou, Y., He, Q., & Xin, J. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140952363 · Cited by 473
Random Projections of Smooth Manifolds
Baraniuk, R. G., & Wakin, M. B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-007-9011-z · Cited by 404
Analog-to-Information Conversion via Random Demodulation
Kirolos, S., Laska, J., Wakin, M., Duarte, M., Baron, D., Ragheb, T., Massoud, Y., & Baraniuk, R. (2006) · 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software · doi:10.1109/dcas.2006.321036 · Cited by 393
One‐Bit Compressed Sensing by Linear Programming
Plan, Y., & Vershynin, R. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21442 · Cited by 383
Self-citationKoltchinskii, V. (2011) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-22147-7 · Cited by 346
Distributed Compressive Sensing
Baron, D., Duarte, M. F., Wakin, M. B., Sarvotham, S., & Baraniuk, R. G. (2009) · doi:10.21236/ada521228 · Cited by 346
An Architecture for Compressive Imaging
Wakin, M. B., Laska, J. N., Duarte, M. F., Baron, D., Sarvotham, S., Takhar, D., Kelly, K. F., & Baraniuk, R. G. (2006) · 2006 International Conference on Image Processing · doi:10.1109/icip.2006.312577 · Cited by 323
Distributed Compressed Sensing
Coluccia, G., Ravazzi, C., & Magli, E. (2015) · SpringerBriefs in Electrical and Computer Engineering · doi:10.1007/978-981-287-390-3_2 · Cited by 323
Metadata
- Authors
- Candes, E., Rudelson, M., Tao, T., & Vershynin, R.
- Venue
- 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
- Publisher
- IEEE
- Published
- 2005
- Pages
- 668-681
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2096185893
- Cited by
- 251
- References
- 2
- FWCI
- 45.73
- Type
- conference paper
- 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.