Scalable Solution for Approximate Nearest Subspace Search


Finding the nearest subspace is a fundamental problem and influential to many applications. In particular, a scalable solution that is fast and accurate for a large problem has a great impact. The existing methods for the problem are, however, useless in a large-scale problem with a large number of subspaces and high dimensionality of the feature space. A… (More)


6 Figures and Tables

Slides referencing similar topics