On quantized compressed sensing with saturated measurements via greedy pursuit
暂无分享,去创建一个
Naofal Al-Dhahir | Ridha Hamila | Mohamed Siala | Fatma Abdelkefi | Ines Elleuch | N. Al-Dhahir | M. Siala | R. Hamila | F. Abdelkefi | Ines Elleuch
[1] Yaniv Plan,et al. One‐Bit Compressed Sensing by Linear Programming , 2011, ArXiv.
[2] Ieee Staff. 2017 25th European Signal Processing Conference (EUSIPCO) , 2017 .
[3] Matthias Hein,et al. Sparse recovery by thresholded non-negative least squares , 2011, NIPS.
[4] Richard G. Baraniuk,et al. Democracy in Action: Quantization, Saturation, and Compressive Sensing , 2011 .
[5] P. Boufounos. Greedy sparse signal reconstruction from sign measurements , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.
[6] Laurent Jacques,et al. Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine , 2009, IEEE Transactions on Information Theory.
[7] Mike E. Davies,et al. Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.
[8] Laurent Jacques,et al. Quantized Iterative Hard Thresholding: Bridging 1-bit and High-Resolution Quantized Compressed Sensing , 2013, ArXiv.
[9] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[10] Richard G. Baraniuk,et al. Regime Change: Bit-Depth Versus Measurement-Rate in Compressive Sensing , 2011, IEEE Transactions on Signal Processing.
[11] Emmanuel J. Candès,et al. Highly Robust Error Correction byConvex Programming , 2006, IEEE Transactions on Information Theory.
[12] Laurent Jacques,et al. Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.