The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Compressive Sensing by Random Convolution
Abstract
This paper demonstrates that convolution with random waveform followed by random time-domain subsampling is a universally efficient compressive sensing strategy. We show that an n-dimensional signal which is S-sparse in any fixed orthonormal representation can be recovered from $m\gtrsim S\log n$ samples from its convolution with a pulse whose Fourier transform has unit magnitude and random phase at all frequencies. The time-domain subsampling can be done in one of two ways: in the first, we simply observe m samples of the random convolution; in the second, we break the random convolution into m blocks and summarize each with a single randomized sum. We also discuss several imaging applications where convolution with a random pulse allows us to superresolve fine-scale features, allowing us to recover high-resolution signals from low-resolution measurements.
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
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
Self-citationSignal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
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
Self-citationAtomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
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
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Single-pixel imaging via compressive sampling
Duarte, M. F., Davenport, M. A., Takhar, D., Laska, J. N., Sun, T., Kelly, K. F., & Baraniuk, R. G. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914730 · Cited by 3,575
Fundamentals of Radar Signal Processing
Richards, M. A. (2005) · Cited by 2,807
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
Analog-to-digital converter survey and analysis
Walden, R. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.761034 · Cited by 2,186
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
Self-citationThe Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
(1976) · Lecture Notes in Mathematics · doi:10.1007/bfb0082336 · Cited by 1,297
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
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
High-Resolution Radar via Compressed Sensing
Herman, M. A., & Strohmer, T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2014277 · Cited by 1,048
Baraniuk, R., & Steeghs, P. (2007) · 2007 IEEE Radar Conference · doi:10.1109/radar.2007.374203 · Cited by 889
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
A tomographic formulation of spotlight-mode synthetic aperture radar
Munson, D. C., O'Brien, J. D., & Jenkins, W. K. (1983) · Proceedings of the IEEE · doi:10.1109/proc.1983.12698 · Cited by 693
New concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Haupt, J., Bajwa, W. U., Raz, G., & Nowak, R. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2070191 · Cited by 424
Analog-to-Information Conversion via Random Demodulation
Kirolos, S., Laska, J., Wakin, M., Duarte, M., Baron, D., Ragheb, T., Massoud, Y., & Baraniuk, R. (2006) · 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software · doi:10.1109/dcas.2006.321036 · Cited by 393
Decoupling: from dependence to independence
(1999) · Choice Reviews Online · doi:10.5860/choice.37-0366 · Cited by 382
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Ailon, N., & Chazelle, B. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132597 · Cited by 379
Le, B., Rondeau, T. W., Reed, J. H., & Bostian, C. W. (2005) · IEEE Signal Processing Magazine · doi:10.1109/msp.2005.1550190 · Cited by 344
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Fuchs, J. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855614 · Cited by 314
Toeplitz-Structured Compressed Sensing Matrices
Bajwa, W. U., Haupt, J., Raz, G. M., Wright, S. J., & Nowak, R. D. (2007) · IEEE/SP Workshop on Statistical Signal Processing (SSP) · doi:10.1109/ssp.2007.4301266 · Cited by 301
Random Filters for Compressive Sampling and Reconstruction
Tropp, J. A., Wakin, M. B., Duarte, M. F., Baron, D., & Baraniuk, R. G. (2006) · 2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings · doi:10.1109/icassp.2006.1660793 · Cited by 264
Coifman, R., Geshwind, F., & Meyer, Y. (2001) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.2000.0313 · Cited by 171
Circulant and Toeplitz matrices in compressed sensingPreprint
Rauhut, H. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0902.4394 · Cited by 133
Bostwick, A. E. (1896) · Science · doi:10.1126/science.3.54.66-a · Cited by 117
Norms of random submatrices and sparse approximation
Tropp, J. A. (2008) · Comptes Rendus Mathématique · doi:10.1016/j.crma.2008.10.008 · Cited by 81
Cited by
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
Self-citationRobust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Jacques, L., Laska, J. N., Boufounos, P. T., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2234823 · Cited by 653
Signal Processing With Compressive Measurements
Davenport, M. A., Boufounos, P. T., Wakin, M. B., & Baraniuk, R. G. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039178 · Cited by 623
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
Metadata
- Authors
- Romberg, J.
- Venue
- SIAM Journal on Imaging Sciences
- Published
- 2009-01
- Volume
- 2
- Issue
- 4
- Pages
- 1098-1128
- ISSN
- 1936-4954 (ISSN-L)
- OpenAlex
- W1966637115
- Cited by
- 458
- References
- 39
- FWCI
- 44.18
- 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.