The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Blind Compressed Sensing
Abstract
The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is essential for the recovery process. This work introduces the concept of blind compressed sensing, which avoids the need to know the sparsity basis in both the sampling and the recovery process. We suggest three possible constraints on the sparsity basis that can be added to the problem in order to guarantee a unique solution. For each constraint, we prove conditions for uniqueness, and suggest a simple method to retrieve the solution. We demonstrate through simulations that our methods can achieve results similar to those of standard compressed sensing, which rely on prior knowledge of the sparsity basis, as long as the signals are sparse enough. This offers a general sampling and reconstruction system that fits all sparse signals, regardless of the sparsity basis, under the conditions and constraints presented in this work.
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
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Cited by
Nonparametric Bayesian Dictionary Learning for Analysis of Noisy and Incomplete Images
Zhou, M., Chen, H., Paisley, J., Ren, L., Li, L., Xing, Z., Dunson, D., Sapiro, G., & Carin, L. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2160072 · Cited by 378
Rank Awareness in Joint Sparse Recovery
Davies, M. E., & Eldar, Y. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173722 · Cited by 351
Self-citationImage Reconstruction: From Sparsity to Data-Adaptive Methods and Machine Learning
Ravishankar, S., Ye, J. C., & Fessler, J. A. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2936204 · Cited by 294
Efficient Generation of Transcriptomic Profiles by Random Composite Measurements
Cleary, B., Cong, L., Cheung, A., Lander, E. S., & Regev, A. (2017) · Cell · doi:10.1016/j.cell.2017.10.023 · Cited by 114
Metadata
- Authors
- Gleichman, S., & Eldar, Y. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-10
- Volume
- 57
- Issue
- 10
- Pages
- 6958-6975
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2170962921
- Cited by
- 216
- References
- 1
- FWCI
- 13.23
- 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: Blind Compressed Sensing. https://app.cochat.ai/papers/10.1109/tit.2011.2165821
- The paper
- Gleichman, S., & Eldar, Y. C. (2011). Blind Compressed Sensing. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2165821
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.