DeepAI AI Chat
Log In Sign Up

Fast binary embeddings, and quantized compressed sensing with structured matrices

by   Thang Huynh, et al.
University of California, San Diego

This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset X⊂R^n, associated with the Euclidean metric, with points in the cube {± 1}^m and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in X. Our methods rely on quantizing fast Johnson-Lindenstrauss embeddings based on bounded orthonormal systems and partial circulant ensembles, both of which admit fast transforms. Our quantization methods utilize noise-shaping, and include Sigma-Delta schemes and distributed noise-shaping schemes. The resulting approximation errors decay polynomially and exponentially fast in m, depending on the embedding method. This dramatically outperforms the current decay rates associated with binary embeddings and Hamming distances. Additionally, it is the first such binary embedding result that applies to fast Johnson-Lindenstrauss maps while preserving ℓ_2 norms. Second, we again consider noise-shaping schemes, albeit this time to quantize compressed sensing measurements arising from bounded orthonormal ensembles and partial circulant matrices. We show that these methods yield a reconstruction error that again decays with the number of measurements (and bits), when using convex optimization for reconstruction. Specifically, for Sigma-Delta schemes, the error decays polynomially in the number of measurements, and it decays exponentially for distributed noise-shaping schemes based on beta encoding. These results are near optimal and the first of their kind dealing with bounded orthonormal systems.


page 1

page 2

page 3

page 4


Faster Binary Embeddings for Preserving Euclidean Distances

We propose a fast, distance-preserving, binary embedding algorithm to tr...

On one-stage recovery for ΣΔ-quantized compressed sensing

Compressed sensing (CS) is a signal acquisition paradigm to simultaneous...

Quantized Compressed Sensing by Rectified Linear Units

This work is concerned with the problem of recovering high-dimensional s...

New Algorithms and Improved Guarantees for One-Bit Compressed Sensing on Manifolds

We study the problem of approximately recovering signals on a manifold f...

Binarized Johnson-Lindenstrauss embeddings

We consider the problem of encoding a set of vectors into a minimal numb...

Robust Dequantized Compressive Sensing

We consider the reconstruction problem in compressed sensing in which th...

Novel Near-Optimal Scalar Quantizers with Exponential Decay Rate and Global Convergence

Many modern distributed real-time signal sensing/monitoring systems requ...