The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Random Filters for Compressive Sampling and Reconstruction
Abstract
We propose and study a new technique for efficiently acquiring and reconstructing signals based on convolution with a fixed FIR filter having random taps. The method is designed for sparse and compressible signals, i.e., ones that are well approximated by a short linear combination of vectors from an orthonormal basis. Signal reconstruction involves a nonlinear orthogonal matching pursuit algorithm that we implement efficiently by exploiting the nonadaptive, time-invariant structure of the measurement process. While simpler and more efficient than other random acquisition techniques like compressed sensing, random filtering is sufficiently generic to summarize many types of compressible signals and generalizes to streaming and continuous-time signals. Extensive numerical experiments demonstrate its efficacy for acquiring and reconstructing signals sparse in the time, frequency, and wavelet domains, as well as piecewise smooth signals and Poisson processes
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
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
Signal 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
Self-citationNear-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
Sampling 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
Cited by
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
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-citationFixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
Baraniuk, R., & Steeghs, P. (2007) · 2007 IEEE Radar Conference · doi:10.1109/radar.2007.374203 · Cited by 889
Self-citationOptimized Projections for Compressed Sensing
Elad, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.900760 · Cited by 835
Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
Mishali, M., & Eldar, Y. C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2012791 · Cited by 819
Block Compressed Sensing of Natural Images
Gan, L. (2007) · 2007 15th International Conference on Digital Signal Processing · doi:10.1109/icdsp.2007.4288604 · Cited by 708
Robust 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
Self-citationSignal 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
Self-citationNon-parametric seismic data recovery with curvelet frames
Herrmann, F. J., & Hennenfent, G. (2008) · Geophysical Journal International · doi:10.1111/j.1365-246x.2007.03698.x · Cited by 552
A Systematic Review of Compressive Sensing: Concepts, Implementations and Applications
Rani, M., Dhok, S. B., & Deshmukh, R. B. (2018) · IEEE Access · doi:10.1109/access.2018.2793851 · Cited by 530
Compressive Sensing by Random Convolution
Romberg, J. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/08072975x · Cited by 458
Compressive sensing: From theory to applications, a survey
Qaisar, S., Bilal, R. M., Iqbal, W., Naureen, M., & Lee, S. (2013) · Journal of Communications and Networks · doi:10.1109/jcn.2013.000083 · Cited by 457
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
Random Projections of Smooth Manifolds
Baraniuk, R. G., & Wakin, M. B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-007-9011-z · Cited by 404
Self-citationRandomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Self-citationWen, Z., Yin, W., Goldfarb, D., & Zhang, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090747695 · Cited by 280
A Nyquist folding analog-to-information receiver
Fudge, G. L., Bland, R. E., Chivers, M. A., Ravindran, S., Haupt, J., & Pace, P. E. (2008) · 2008 42nd Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.2008.5074464 · Cited by 76
Metadata
- Authors
- Tropp, J. A., Wakin, M. B., Duarte, M. F., Baron, D., & Baraniuk, R. G.
- Venue
- 2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings
- Publisher
- IEEE
- Published
- 2006-08-02
- Volume
- 3
- Pages
- III-872-III-875
- OpenAlex
- W2110005331
- Cited by
- 264
- References
- 5
- FWCI
- 49.17
- Type
- conference paper
- 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.