Robust 1-bit Compressive Sensing via Gradient Support Pursuit

P. Boufounos and R. Baraniuk, “1-bit compressive sensing,” in Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on , Mar. 2008, pp. 16 –21

2008

Earlier work this paper cites.

J. N. Laska, P. T. Boufounos, and R. G. Baraniuk, “Finite range scalar quantization for compressive sensing,” in Proceedings of International Conferenece on Sampling Theory and Applications (SampTA) , Toulouse, France, May 18-22 2009

2009

Earlier work this paper cites.

W. Dai, H. V. Pham, and O. Milenkovic, “Distortion-rate functions for quantized compressive sensing,” in IEEE Information Theory Workshop on Networking and Information Theory, 2009. ITW 2009 , Jun. 2009, pp. 171 –175

2009

Earlier work this paper cites.

J. Sun and V. Goyal, “Optimal quantization of random measurements in compressed sensing,” in IEEE International Symposium on Information Theory, 2009. ISIT 2009 , Jul. 2009, pp. 6 –10

2009

Earlier work this paper cites.

P. Boufounos, “Greedy sparse signal reconstruction from sign measurements,” in Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009 , Nov. 2009, pp. 1305 –1309

2009

Earlier work this paper cites.

D. Needell and J. A. Tropp, “CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,” Applied and Computational Harmonic Analysis , vol. 26, no. 3, pp. 301–321, 2009

2009

Earlier work this paper cites.

A. Zymnis, S. Boyd, and E. Candès, “Compressed sensing with quantized measurements,” IEEE Signal Processing Letters , vol. 17, no. 2, pp. 149–152, Feb. 2010

2010

Cited alongside, same era.

L. Jacques, D. Hammond, and J. Fadili, “Dequantizing compressed sensing: when oversampling and non-gaussian constraints combine,” IEEE Transactions on Information Theory , vol. 57, no. 1, pp. 559–571, Jan. 2011

2011

Cited alongside, same era.

J. N. Laska, P. T. Boufounos, M. A. Davenport, and R. G. Baraniuk, “Democracy in action: Quantization, saturation, and compressive sensing,” Applied and Computational Harmonic Analysis , vol. 31, no. 3, pp. 429–443, Nov. 2011

2011

Cited alongside, same era.

J. Laska, Z. Wen, W. Yin, and R. Baraniuk, “Trust, but verify: Fast and accurate signal recovery from 1-bit compressive measurements,” IEEE Transactions on Signal Processing , vol. 59, no. 11, pp. 5289–5301, Nov. 2011

2011

Cited alongside, same era.

M. Yan, Y. Yang, and S. Osher, “Robust 1-bit compressive sensing using adaptive outlier pursuit,” IEEE Transactions on Signal Processing , vol. 60, no. 7, pp. 3868–3875, Jul. 2012

2012

Later among the works it cites.

Y. Plan and R. Vershynin, “Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach,” IEEE Transactions on Information Theory , vol. 59, no. 1, pp. 482–494, Jan. 2013

2013

Closest in time.

L. Jacques, J. Laska, P. Boufounos, and R. Baraniuk, “Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors,” IEEE Transactions on Information Theory , vol. PP, 2013, arXiv:1104.3160 [cs.IT]

Original

2013

Closest in time.

A. Ai, A. Lapanowski, P. Yaniv, and R. Vershynin, “One-bit compressed sensing with non-gaussian measurements,” Linear Algebra and its Applications , 2013, to appear

2013

Closest in time.