The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Compressed Sensing With Quantized Measurements
Abstract
We consider the problem of estimating a sparse signal from a set of quantized, Gaussian noise corrupted measurements, where each measurement corresponds to an interval of values. We give two methods for (approximately) solving this problem, each based on minimizing a differentiable convex function plus anl1regularization term. Using a first order method developed by Hale et al, we demonstrate the performance of the methods through numerical simulation. We find that, using these methods, compressed sensing can be carried out even when the quantization is very coarse, e.g., 1 or 2 bits per measurement.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationRegression 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
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
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Self-citationEfron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
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-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
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Self-citationAn Iterative Regularization Method for Total Variation-Based Image Restoration
Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040605412 · Cited by 1,787
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
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
Tseng, P. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012998338806 · Cited by 1,223
Fixed-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
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090756855 · Cited by 848
Robust Modeling With Erratic Data
Claerbout, J. F., & Muir, F. (1973) · Geophysics · doi:10.1190/1.1440378 · Cited by 833
The Entire Regularization Path for the Support Vector Machine
Hastie, T. J., Rosset, S., Tibshirani, R. J., & Zhu, J. (2004) · Journal of Machine Learning Research · Cited by 748
Kim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
Self-citationColor TV: total variation methods for restoration of vector-valued images
Blomgren, P., & Chan, T. F. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661180 · Cited by 610
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Deconvolution with the l 1 norm
Taylor, H. L., Banks, S. C., & McCoy, J. F. (1979) · Geophysics · doi:10.1190/1.1440921 · Cited by 436
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Self-citationDequantizing 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
Optimizing dominant time constant in RC circuits
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1998) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.681261 · Cited by 48
Self-citationOptimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1997) · doi:10.5555/266388.266485 · Cited by 27
Self-citationOptimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, Boyd, S., & Gamal, E. (1997) · International Conference on Computer Aided Design · doi:10.1109/iccad.1997.643528 · Cited by 27
Self-citation
Cited by
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
Choi, J., Mo, J., & Heath, R. W. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2545666 · Cited by 471
Throughput Analysis of Massive MIMO Uplink With Low-Resolution ADCs
Jacobsson, S., Durisi, G., Coldrey, M., Gustavsson, U., & Studer, C. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2691318 · Cited by 406
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
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
Metadata
- Authors
- Zymnis, A., Boyd, S., & Candes, E.
- Venue
- IEEE Signal Processing Letters
- Published
- 2010-02
- Volume
- 17
- Issue
- 2
- Pages
- 149-152
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2154423986
- Cited by
- 316
- References
- 28
- FWCI
- 16.53
- 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.