The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Compressive Sampling and Lossy Compression
Abstract
Recent results in compressive sampling have shown that sparse signals can be recovered from a small number of random measurements. This property raises the question of whether random measurements can provide an efficient representation of sparse signals in an information-theoretic sense. Through both theoretical and experimental results, we show that encoding a sparse signal through simple scalar quantization of random measurements incurs a significant penalty relative to direct or adaptive encoding of the sparse signal. Information theory provides alternative quantization strategies, but they come at the cost of much greater estimation complexity.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
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
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
The rate-distortion function for source coding with side information at the decoder
Wyner, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055508 · Cited by 3,023
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Multiple description coding: compression meets the network
Goyal, V. K. (2001) · IEEE Signal Processing Magazine · doi:10.1109/79.952806 · Cited by 1,344
Self-citationUncertainty Principles and Signal Recovery
Donoho, D. L., & Stark, P. B. (1989) · SIAM Journal on Applied Mathematics · doi:10.1137/0149053 · Cited by 1,054
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2006) · Cited by 744
Berger, T. (2003) · Wiley Encyclopedia of Telecommunications · doi:10.1002/0471219282.eot142 · Cited by 717
Signal Reconstruction From Noisy Random Projections
Haupt, J., & Nowak, R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880031 · Cited by 608
Quantized Frame Expansions with Erasures
Goyal, V. K., Kovačević, J., & Kelner, J. A. (2001) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.2000.0340 · Cited by 464
Self-citationData compression and harmonic analysis
Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720544 · Cited by 432
Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
Goyal, V. K., Vetterli, M., & Thao, N. T. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.650985 · Cited by 417
Self-citationOn universal quantization by randomized uniform/lattice quantizers
Zamir, R., & Feder, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119699 · Cited by 221
Ziv, J. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057034 · Cited by 177
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2006) · Defense Technical Information Center (DTIC) · doi:10.21236/ada472998 · Cited by 49
Cited by
Comparing Measures of Sparsity
Hurley, N., & Rickard, S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2027527 · Cited by 757
IF-CNN: Image-Aware Inference Framework for CNN With the Collaboration of Mobile Devices and Cloud
Shu, G., Liu, W., Zheng, X., & Li, J. (2018) · IEEE Access · doi:10.1109/access.2018.2880196 · Cited by 30
Human-inspired Perspectives: A Survey on AI Long-term Memory
He, Z., Lin, W., Zheng, H., Zhang, F., Jones, M. W., Aitchison, L., Xu, X., Liu, M., Kristensson, P. O., & Shen, J. (2024) · arXiv · doi:10.48550/arxiv.2411.00489 · Cited by 3
“The goal of compression, especially the lossy compression, is to reduce the storage space or transmission bandwidth required to represent data, while ensuring that the data quality remains acceptable [268, 269, 270].”
Metadata
- Authors
- Goyal, V. K., Fletcher, A. K., & Rangan, S.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2008-03
- Volume
- 25
- Issue
- 2
- Pages
- 48-56
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2118016489
- Cited by
- 252
- References
- 21
- FWCI
- 21.70
- 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
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.