The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
Abstract
Compressed sensing is an emerging signal acquisition technique that enables signals to be sampled well below the Nyquist rate, given that the signal has a sparse representation in an orthonormal basis. In fact, sparsity in an orthonormal basis is only one possible signal model that allows for sampling strategies below the Nyquist rate. In this paper, we consider a more general signal model and assume signals that live on or close to the union of linear subspaces of low dimension. We present sampling theorems for this model that are in the same spirit as the Nyquist-Shannon sampling theorem in that they connect the number of required samples to certain model parameters. Contrary to the Nyquist-Shannon sampling theorem, which gives a necessary and sufficient condition for the number of required samples as well as a simple linear algorithm for signal reconstruction, the model studied here is more complex. We therefore concentrate on two aspects of the signal model, the existence ofonetoonemaps to lower dimensional observation spaces and the smoothness of the inverse map. We show thatalmostalllinear maps areonetoonewhen the observation space is at least of the same dimension as the largest dimension of the convex hull of the union ofanytwosubspaces in the model. However, we also show that in order for the inverse map to have certain smoothness properties such as a given finite Lipschitz constant, the required observation dimension necessarily depends logarithmically on the number of subspaces in the signal model. In other words, while unique linear sampling schemes require a small number of samples depending only on the dimension of the subspaces involved, in order to have stable sampling methods, the number of samples depends necessarily logarithmically on the number of subspaces in the model. These results are then applied to two examples, the standard compressed sensing signal model in which the signal has a sparse representation in an orthonormal basis and to a sparse signal model with additional tree structure.
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
Sauer, T., Yorke, J. A., & Casdagli, M. (1991) · Journal of Statistical Physics · doi:10.1007/bf01053745 · Cited by 2,045
Cited by
Sparsity-Aware Learning and Compressed Sensing: An Overview
Theodoridis, S., Kopsinis, Y., & Slavakis, K. (2014) · Academic Press Library in Signal Processing · doi:10.1016/b978-0-12-396502-8.00023-1 · Cited by 14
Metadata
- Authors
- Blumensath, T., & Davies, M. E.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-04
- Volume
- 55
- Issue
- 4
- Pages
- 1872-1882
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2159268085
- Cited by
- 269
- References
- 1
- FWCI
- 28.33
- 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: Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces. https://app.cochat.ai/papers/10.1109/tit.2009.2013003
- The paper
- Blumensath, T., & Davies, M. E. (2009). Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2013003
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.