Publication

Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine

Laurent Jacques
2009
Report or working paper
Abstract

The theory of Compressed Sensing (CS) is based on reconstructing sparse signals from random linear measurements. As measurement of continuous signals by digital devices always involves some form of quantization, in practice devices based on CS encoding must be able to accommodate the distortions in the linear measurements created by quantization. In this paper we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present a new class of convex optimization programs, or decoders, coined Basis Pursuit DeQuantizer of moment pp (BPDQp_p), that model the quantization distortion more faithfully than the commonly used Basis Pursuit DeNoise (BPDN) program. Our decoders proceed by minimizing the sparsity of the signal to be reconstructed subject to a particular data-fidelity constraint imposing that the difference between the original and the reproduced measurements has bounded ellpell_p norm, for 2leqpleqinfty2leq pleq infty. We show that, in an oversampled situation, i.e. when the ratio between the number of measurements and the sparsity of the signal becomes large, the performance of the BPDQp_p decoders are significantly better than that of BPDN. Indeed, in this case the reconstruction error due to quantization is divided by sqrtp+1sqrt{p+1}. The condition guaranteeing this reduction relies on a modified Restricted Isometry Property (RIPp_p) of the sensing matrix bounding the projections of sparse signals in the ellpell_p norm. Surprisingly, Gaussian random matrices are also RIPp_p with high probability. To demonstrate the theoretical power of BPDQp_p, we report numerical simulations on signal and image reconstruction problems.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.