The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
Abstract
Expander graphs have been recently proposed to construct efficient compressed sensing algorithms. In particular, it has been shown that anyn-dimensional vector that isk-sparse can be fully recovered usingO(klogn) measurements and onlyO(klogn) simple recovery iterations. In this paper, we improve upon this result by considering expander graphs with expansion coefficient beyond3/4and show that, with the same number of measurements, onlyO(k) recovery iterations are required, which is a significant improvement whennis large. In fact, full recovery can be accomplished by at most2kvery simple iterations. The number of iterations can be reduced arbitrarily close tok, and the recovery algorithm can be implemented very efficiently using a simple priority queue with total recovery timeO(nlog(n/k))). We also show that by tolerating a small penalty on the number of measurements, and not on the number of recovery iterations, one can use the efficient construction of a family of expander graphs to come up with explicit measurement matrices for this method. We compare our result with other recently developed expander-graph-based methods and argue that it compares favorably both in terms of the number of required measurements and in terms of the time complexity and the simplicity of recovery. Finally, we will show how our analysis extends to give a robust algorithm that finds the position and sign of theksignificant elements of an almostk-sparse signal and then, using very simple optimization techniques, finds ak-sparse signal which is close to the bestk-term approximation of the original signal.
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
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Cited by
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
A Probabilistic and RIPless Theory of Compressed Sensing
Candes, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2161794 · Cited by 598
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
- Jafarpour, S., Xu, W., Hassibi, B., & Calderbank, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-09
- Volume
- 55
- Issue
- 9
- Pages
- 4299-4308
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2140466267
- Cited by
- 174
- References
- 1
- FWCI
- 16.86
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient and Robust Compressed Sensing Using Optimized Expander Graphs. https://app.cochat.ai/papers/10.1109/tit.2009.2025528
- The paper
- Jafarpour, S., Xu, W., Hassibi, B., & Calderbank, R. (2009). Efficient and Robust Compressed Sensing Using Optimized Expander Graphs. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2025528
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.