A Learning-Based Framework for Quantized Compressed Sensing

Sparse recovery from undersampled random quan- tization measurements is a recent active research topic. Previous work asserts that stable recovery can be guaranteed via the basis pursuit dequantizer (BPDQ) if the measurements number is large enough, considering random sampling patterns. In this paper, we study a learning-based method for optimizing the sampling pattern, within the framework of sparse recovery via BPDQ from their uniformly quantized measurements. Given a set of representative training signals, the method finds the sampling pattern that performs the best on average over these signals. We compare our approach with the random sampling and other state-of-the-art sampling methods, which shows that it achieves superior reconstruction performance. We demonstrate that proper accounting for sampling and careful sampler de- sign has a significant impact on the performance of quantized compressive sensing methods.

Published in:
IEEE Signal Processing Letters

 Record created 2019-01-29, last modified 2019-03-16

Rate this document:

Rate this document:
(Not yet reviewed)