The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Open accessAbstract
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is an inverse relationship between the achievable sampling rate and the bit depth. In this paper, we investigate an alternative CS approach that shifts the emphasis from the sampling rate to the number of bits per measurement. In particular, we explore the extreme case of 1-bit CS measurements, which capture just their sign. Our results come in two flavors. First, we consider ideal reconstruction from noiseless 1-bit measurements and provide a lower bound on the best achievable reconstruction error. We also demonstrate that i.i.d. random Gaussian matrices provide measurement mappings that, with overwhelming probability, achieve nearly optimal error decay. Next, we consider reconstruction robustness to measurement errors and noise and introduce the binary$\epsilon $-stable embedding property, which characterizes the robustness of the measurement process to sign changes. We show that the same class of matrices that provide almost optimal noiseless performance also enable such a robust mapping. On the practical side, we introduce the binary iterative hard thresholding algorithm for signal reconstruction from 1-bit measurements that offers state-of-the-art performance.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
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
Continuous Univariate Distributions.
Omori, Y., Johnson, N. L., Kotz, S., & Balakrishnan, N. (1995) · Journal of the American Statistical Association · doi:10.2307/2291547 · Cited by 9,084
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
Atomic 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
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
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
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
Self-citationFigueiredo, 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
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997857 · Cited by 2,936
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
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
Self-citationRobust Regression: Asymptotics, Conjectures and Monte Carlo
Huber, P. J. (1973) · The Annals of Statistics · doi:10.1214/aos/1176342503 · Cited by 2,328
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
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
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
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-citationGrassmannian frames with applications to coding and communication
Strohmer, T., & Heath, R. W. (2003) · Applied and Computational Harmonic Analysis · doi:10.1016/s1063-5203(03)00023-x · Cited by 955
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Needell, D., & Vershynin, R. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9031-3 · Cited by 952
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Har-Peled, S., Indyk, P., & Motwani, R. (2012) · Theory of Computing · doi:10.4086/toc.2012.v008a014 · Cited by 693
An overview of sigma-delta converters
Aziz, P. M., Sorensen, H. V., & vn der Spiegel, J. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.482138 · Cited by 659
Locality-sensitive binary codes from shift-invariant kernels
Raginsky, M., & Lazebnik, S. (2009) · Cited by 600
Are Loss Functions All the Same?
Rosasco, L., Vito, E. D., Caponnetto, A., Piana, M., & Verri, A. (2004) · Neural Computation · doi:10.1162/089976604773135104 · Cited by 501
An Elementary Introduction to Modern Convex Geometry
Ball, K. (1997) · Cambridge University Press eBooks · doi:10.1017/9781009701853.002 · Cited by 483
Compressive Sensing by Random Convolution
Romberg, J. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/08072975x · Cited by 458
Continuous Univariate Distributions, Volume 1
Famoye, F. (1995) · Technometrics · doi:10.1080/00401706.1995.10484392 · Cited by 430
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
Nearest-neighbor methods in learning and vision : theory and practice
Shakhnarovich, G., Indyk, P., & Darrell, T. (2005) · Cited by 399
One‐Bit Compressed Sensing by Linear Programming
Plan, Y., & Vershynin, R. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21442 · Cited by 383
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
Compressed Sensing With Quantized Measurements
Zymnis, A., Boyd, S., & Candes, E. (2010) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2035667 · Cited by 316
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
Self-citationThe Princeton companion to mathematics
(2009) · Choice Reviews Online · doi:10.5860/choice.46-3606 · Cited by 249
Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
Jacques, L., Hammond, D. K., & Fadili, J. M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2093310 · Cited by 213
Self-citationOn-Line Algorithms in Machine Learning
Blum, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0029575 · Cited by 162
Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
Benedetto, J. J., Powell, A. M., & Yılmaz, Ö. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.872849 · Cited by 156
Dimension Reduction by Random Hyperplane Tessellations
Plan, Y., & Vershynin, R. (2013) · Discrete & Computational Geometry · doi:10.1007/s00454-013-9561-6 · Cited by 123
Efficient Margin Maximizing with Boosting
Rätsch, G., & Warmuth, M. K. (2005) · doi:10.5555/1046920.1194915 · Cited by 102
Sample complexity for 1-bit compressed sensing and sparse classification
Gupta, A. K., Nowak, R. D., & Recht, B. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513510 · Cited by 77
Random Observations on Random Observations: Sparse Signal Acquisition and Processing
Davenport, M. A. (2010) · Rice Research Repository (Rice University) · Cited by 75
Albers, S., & Leonardi, S. (1999) · ACM Computing Surveys · doi:10.1145/333580.333583 · Cited by 65
CMOS compressed imaging by Random Convolution
Jacques, L., Vandergheynst, P., Bibet, A., Majidzadeh, V., Schmid, A., & Leblebici, Y. (2009) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2009.4959783 · Cited by 58
Self-citationSmoothness, Low Noise and Fast RatesPreprint
Srebro, N., Sridharan, K., & Tewari, A. (2010) · arXiv (Cornell University) · Cited by 52
Sigma delta quantization for compressive sensing
Boufounos, P. T., & Baraniuk, R. G. (2007) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.734880 · Cited by 22
Self-citation
Cited by
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Heath, R. W., Gonzalez-Prelcic, N., Rangan, S., Roh, W., & Sayeed, A. M. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2523924 · Cited by 2,899
Arjoune, Y., & Kaabouch, N. (2019) · Sensors · doi:10.3390/s19010126 · Cited by 442
Capacity Analysis of One-Bit Quantized MIMO Systems With Transmitter Channel State Information
Mo, J., & Heath, R. W. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2455527 · Cited by 427
Channel Estimation in Broadband Millimeter Wave MIMO Systems With Few-Bit ADCs
Mo, J., Schniter, P., & Heath, R. W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2781644 · Cited by 348
Davenport, M. A., Plan, Y., van den Berg, E., & Wootters, M. (2014) · Information and Inference · doi:10.1093/imaiai/iau006 · Cited by 277
Metadata
- Authors
- Jacques, L., Laska, J. N., Boufounos, P. T., & Baraniuk, R. G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-04
- Volume
- 59
- Issue
- 4
- Pages
- 2082-2102
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2112038498
- Cited by
- 653
- References
- 51
- FWCI
- 59.52
- Type
- journal article
- Language
- en
- Open access
- green
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.