One-bit compressed sensing by linear programming

Communications on Pure and Applied Mathematics

Volumn 66, Issue 8, 2013, Pages 1275-1297

  Plan, Yaniv ^a   Vershynin, Roman ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84878419165     PISSN: 00103640     EISSN: 10970312     Source Type: Journal    
DOI: 10.1002/cpa.21442     Document Type: Article

References (28)

1. Alon, N.; Spencer, J. H. The probabilistic method. Second edition. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
2. Ardestanizadeh, E.;Cheraghchi, M.; Shokrollahi, A. Bit precision analysis for compressed sensing. Proceedings of the 2009 IEEE International Conference on Symposium on Information Theory, vol. 1, 1-5. Piscataway, N.J., IEEE Press, 2009 Available at: http://dl.acm.org/citation.cfm?id=1701495.1701496
3. Bickel, P. J.;Ritov, Y.
4. Boufounos, P. T. Greedy sparse signal reconstruction from sign measurements. 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 1305-1309. doi: 10.1109/ACSSC.2009.5469926
5. Boufounos, P. T. Reconstruction of sparse signals from distorted randomized measurements. 2010 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 3998-4001. doi: 10.1109/ICASSP.2010.5495766
6. Boufounos, P. T.; Baraniuk, R. G. 1-bit compressive sensing. In 42nd Annual Conference on Information Sciences and Systems (CISS), 2008, 16-21. doi: 10.1109/CISS.2008.4558487
7. Candès, E. J.; Romberg, J. K.; Tao, T. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59 (2006), no. 8, 1207-1223. doi: 10.1002/cpa.20124
8. Candes, E.;Rudelson, M.;Vershynin, R.; Tao, T. Error correction via linear programming. 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, 668-681. doi: 10.1109/SFCS.2005.5464411
9. Candes, E. J.; Tao, T. Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Transactions on Information Theory 52 (2006), no. 12, 5406-5425. doi: 10.1109/TIT.2006.885507
10. Candes, E.; Tao, T. The Dantzig selector: statistical estimation when p is much larger than n. Ann. Statist. 35 (2007), no. 6, 2313-2351. doi: 10.1214/009053606000001523
11. Dai, W.; Pham, H. V.; Milenkovic, O. A comparative study of quantized compressive sensing schemes. IEEE International Symposium on Information Theory, 2009, 11-15. doi: 10.1109/ISIT.2009.5206032
12. Damaschke, P. Threshold group testing. Electronic Notes in Discrete Mathematics 21 (2005), 265-271. doi: 10.1016/j.endm.2005.07.040
13. Goemans, M. X.; Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach 42 (1995), no. 6, 1115-1145. doi: 10.1145/227683.227684
14. Güntürk, C.;Lammers, M.;Powell, A.;Saab, R.; Ylmaz, O. Sigma delta quantization for compressed sensing. 2010 44th Annual Conference on Information Sciences and Systems (CISS), 1-6. doi: 10.1109/CISS.2010.5464825
15. Güntürk, C.;Powell, A.;Saab, R.; Ylmaz, Ö. Sobolev duals for random frames and sigma-delta quantization of compressed sensing measurements. Preprint, 2010. arXiv: 1002.0182 [cs.IT]
16. Gupta, A.;Nowak, R.; Recht, B. Sample complexity for 1-bit compressed sensing and sparse classification. 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), 1553-1557. doi: 10.1109/ISIT.2010.5513510
17. Jacques, L.; Hammond, D. K.; Fadili, J. M. Dequantizing compressed sensing: when oversampling and non-gaussian constraints combine. IEEE Trans. Inform. Theory 57 (2011), no. 1, 559-571.
18. Jacques, L.; Laska, J. N.; Boufounos, P. T.; Baraniuk, R. G. Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors. Preprint, 2011. arXiv: 1104.3160 [cs.IT]
19. Laska, J. N.; Boufounos, P. T.; Davenport, M. A.; Baraniuk, R. G. Democracy in action: quantization, saturation, and compressive sensing. Appl. Comput. Harmon. Anal. 31 (2011), no. 3, 429-443. doi: 10.1016/j.acha.2011.02.002
20. Laska, J. N.;Wen, Z.;Yin, W.
21. Mackenzie, D. Compressed sensing makes every pixel count. What's Happening in the Mathematical Sciences (2009), no. 7, 114-127.
22. Miles, R. E. Random points, sets and tessellations on the surface of a sphere. Sankhyā Ser. A 33 (1971), 145-174.
23. Moller, J.; Stoyan, D. Stochastic geometry and random tessellations. In Tessellations in the sciences: virtues, techniques and applications of geometric tilings, to appear.
24. Pisier, G. The volume of convex bodies and Banach space geometry. Cambridge Tracts in Mathematics, 94. Cambridge University Press, Cambridge, 1989.
25. Sun, J.; Goyal, V. Optimal quantization of random measurements in compressed sensing. IEEE International Symposium on Information Theory, 2009, 6-10. doi: 10.1109/ISIT.2009.5205695
26. Vershynin, R. Introduction to the non-asymptotic analysis of random matrices. Compressed sensing: theory and applications, 210-268. Cambridge University Press, Cambridge, 2012.
27. Wojtaszczyk, P. Stability and instance optimality for Gaussian measurements in compressed sensing. Found. Comput. Math. 10 (2010), no. 1, 1-13. doi: 10.1007/s10208-009-9046-4
28. Zymnis, A.;Boyd, S.; Candes, E. Compressed sensing with quantized measurements. IEEE Signal Processing Letters 17 (2010), no. 2, 149-152. doi: 10.1109/LSP.2009.2035667