The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Signal Reconstruction From Noisy Random Projections
Abstract
Recent results show that a relatively small number of random projections of a signal can contain most of its salient information. It follows that if a signal is compressible in some orthonormal basis, then a very accurate reconstruction can be obtained from random projections. This "compressive sampling" approach is extended here to show that signals can be accurately recovered from random projections contaminated with noise. A practical iterative algorithm for signal reconstruction is proposed, and potential applications to coding, analog-digital (A/D) conversion, and remote wireless sensing are discussed
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
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
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
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
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
An EM algorithm for wavelet-based image restoration
Figueiredo, M. A. T., & Nowak, R. D. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.814255 · Cited by 1,219
Self-citationSampling signals with finite rate of innovation
Vetterli, M., Marziliano, P., & Blu, T. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1003065 · Cited by 1,079
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
To code, or not to code: lossy source-channel communication revisited
Gastpar, M., Rimoldi, B., & Vetterli, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810631 · Cited by 550
Bajwa, W., Haupt, J., Sayeed, A., & Nowak, R. (2006) · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06 · doi:10.1145/1127777.1127801 · Cited by 314
Self-citationSource-Channel Communication in Sensor Networks
Gastpar, M., & Vetterli, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36978-3_11 · Cited by 283
Spectrum-blind minimum-rate sampling and reconstruction of multiband signals
Feng, P., & Bresler, Y. (2002) · 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings · doi:10.1109/icassp.1996.544131 · Cited by 273
Near-optimal sparse fourier representations via sampling
Gilbert, A. C., Guha, S., Indyk, P., Muthukrishnan, S., & Strauss, M. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509933 · Cited by 259
Sampling and reconstruction of signals with finite rate of innovation in the presence of noise
Maravić, I., & Vetterli, M. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850321 · Cited by 256
A bound optimization approach to wavelet-based image deconvolution
Figueiredo, M. A. T., & Nowak, R. D. (2005) · IEEE International Conference on Image Processing 2005 · doi:10.1109/icip.2005.1530172 · Cited by 189
Self-citationDecentralized compression and predistribution via randomized gossiping
Rabbat, M., Haupt, J., Singh, A., & Nowak, R. (2006) · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06 · doi:10.1145/1127777.1127789 · Cited by 165
Self-citationComplexity Regularization with Application to Artificial Neural Networks
Barron, A. R. (1991) · Nonparametric Functional Estimation and Related Topics · doi:10.1007/978-94-011-3222-0_42 · Cited by 160
Bajwa, W. U., Haupt, J., Sayeed, A. M., et al. (2006) · International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2006.244128 · Cited by 121
Self-citationMatched source-channel communication for field estimation in wireless sensor networks
Bajwa, W. U., Sayeed, A. M., & Nowak, R. M. (2005) · Cited by 56
Self-citationMatched source-channel communication for field estimation in wireless sensor networks
Bajwa, W. U., Sayeed, A. M., & Nowak, R. M. (2005) · International Symposium on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2005.1440943 · Cited by 49
Self-citationZou, J., Gilbert, A. C., Strauss, M. J., et al. (2005) · Journal of Computational Physics · doi:10.1016/j.jcp.2005.06.005 · Cited by 34
Cited by
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
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Compressive Sensing [Lecture Notes]
Baraniuk, R. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286571 · Cited by 4,177
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Self-citationJi, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
Metadata
- Authors
- Haupt, J., & Nowak, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-09
- Volume
- 52
- Issue
- 9
- Pages
- 4036-4048
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2154304330
- Cited by
- 608
- References
- 25
- FWCI
- 61.75
- 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.