Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
In this article, we give an overview of efficient algorithms for the approximate and exact
nearest neighbor problem. The goal is to preprocess a dataset of objects (eg, images) so
that later, given a new query object, one can quickly return the dataset object that is most
similar to the query. The problem is of significant interest in a wide variety of areas.
nearest neighbor problem. The goal is to preprocess a dataset of objects (eg, images) so
that later, given a new query object, one can quickly return the dataset object that is most
similar to the query. The problem is of significant interest in a wide variety of areas.
In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The problem is of significant interest in a wide variety of areas.
ACM Digital LibraryShowing the best result for this search. See all results