In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vector multiply can be computed in log-linear time, providing efficient dimensionality reduction of general sets. In particular, we show that using such matrices any set from high dimensions can be embedded into lower dimensions with near optimal distor-tion. We obtain our results by connecting dimensionality reduction of any set to dimensionality reduction of sparse vectors via a chaining argument.
Many emerging applications involve sparse signals, and their processing is a subject of active resea...
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube ...
The restricted isometry property (RIP) is at the center of important developments in compressive sen...
In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of spars...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
International audienceThis paper considers compressed sensing matrices and neighbor- liness of a cen...
Recently, many works have focused on the characterization of non-linear dimensionality reduction met...
A methodology for using random sketching in the context of model order reduction for high-dimensiona...
In this paper, we present novel constructions of matrices with the restricted isometry property (RIP...
<p>We propose a new method for linear dimensionality reduction of manifold-modeled data. Given a tra...
We present a new bound for suprema of a special type of chaos processes indexed by a set of matrices...
Abstract—Many sparse approximation algorithms accurately recover the sparsest solution to an underde...
Abstract. Compressed Sensing (CS) seeks to recover an unknown vector with N entries by making far fe...
This paper establishes the restricted isometry property for a Gabor system generated by n^2 time–fre...
This article introduces a novel structured random matrix composed blockwise from subsampled randomiz...
Many emerging applications involve sparse signals, and their processing is a subject of active resea...
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube ...
The restricted isometry property (RIP) is at the center of important developments in compressive sen...
In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of spars...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
International audienceThis paper considers compressed sensing matrices and neighbor- liness of a cen...
Recently, many works have focused on the characterization of non-linear dimensionality reduction met...
A methodology for using random sketching in the context of model order reduction for high-dimensiona...
In this paper, we present novel constructions of matrices with the restricted isometry property (RIP...
<p>We propose a new method for linear dimensionality reduction of manifold-modeled data. Given a tra...
We present a new bound for suprema of a special type of chaos processes indexed by a set of matrices...
Abstract—Many sparse approximation algorithms accurately recover the sparsest solution to an underde...
Abstract. Compressed Sensing (CS) seeks to recover an unknown vector with N entries by making far fe...
This paper establishes the restricted isometry property for a Gabor system generated by n^2 time–fre...
This article introduces a novel structured random matrix composed blockwise from subsampled randomiz...
Many emerging applications involve sparse signals, and their processing is a subject of active resea...
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube ...
The restricted isometry property (RIP) is at the center of important developments in compressive sen...