DeepAI AI Chat
Log In Sign Up

Robust Dequantized Compressive Sensing

by   Ji Liu, et al.
University of Wisconsin-Madison

We consider the reconstruction problem in compressed sensing in which the observations are recorded in a finite number of bits. They may thus contain quantization errors (from being rounded to the nearest representable value) and saturation errors (from being outside the range of representable values). Our formulation has an objective of weighted ℓ_2-ℓ_1 type, along with constraints that account explicitly for quantization and saturation errors, and is solved with an augmented Lagrangian method. We prove a consistency result for the recovered solution, stronger than those that have appeared to date in the literature, showing in particular that asymptotic consistency can be obtained without oversampling. We present extensive computational comparisons with formulations proposed previously, and variants thereof.


page 1

page 2

page 3

page 4


Quantization in Compressive Sensing: A Signal Processing Approach

Influence of the finite-length registers and quantization effects on the...

Total variation reconstruction for compressive sensing using nonlocal Lagrangian multiplier

Total variation has proved its effectiveness in solving inverse problems...

Robust one-bit compressed sensing with partial circulant matrices

We present optimal sample complexity estimates for one-bit compressed se...

Compressed sensing with a jackknife and a bootstrap

Compressed sensing proposes to reconstruct more degrees of freedom in a ...

Fast binary embeddings, and quantized compressed sensing with structured matrices

This paper deals with two related problems, namely distance-preserving b...

The Variable Projected Augmented Lagrangian Method

Inference by means of mathematical modeling from a collection of observa...