Publications

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 XRn, associated with the Euclidean metric, with points in the cube ±1m 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…
Communications on Pure and Applied Mathematics, 2018

Contact

  • tlh007@ucsd.edu
  • Department of Mathematics, UC San Diego, California, 92093, USA