Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices
Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices
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 Ī§ ā ā n , associated with the euclidean metric, with points in the cube {Ā±1} m , and we associate the cube ā¦