LOH and behold: Web-scale visual search, recommendation and clustering using Locally Optimized Hashing

04/21/2016
by   Yannis Kalantidis, et al.
0

We propose a novel hashing-based matching scheme, called Locally Optimized Hashing (LOH), based on a state-of-the-art quantization algorithm that can be used for efficient, large-scale search, recommendation, clustering, and deduplication. We show that matching with LOH only requires set intersections and summations to compute and so is easily implemented in generic distributed computing systems. We further show application of LOH to: a) large-scale search tasks where performance is on par with other state-of-the-art hashing approaches; b) large-scale recommendation where queries consisting of thousands of images can be used to generate accurate recommendations from collections of hundreds of millions of images; and c) efficient clustering with a graph-based algorithm that can be scaled to massive collections in a distributed environment or can be used for deduplication for small collections, like search results, performing better than traditional hashing approaches while only requiring a few milliseconds to run. In this paper we experiment on datasets of up to 100 million images, but in practice our system can scale to larger collections and can be used for other types of data that have a vector representation in a Euclidean space.

READ FULL TEXT

page 12

page 13

page 14

research
01/31/2016

Unsupervised Deep Hashing for Large-scale Visual Search

Learning based hashing plays a pivotal role in large-scale visual search...
research
08/09/2017

An evaluation of large-scale methods for image instance and class discovery

This paper aims at discovering meaningful subsets of related images from...
research
04/04/2017

Simultaneous Feature Aggregating and Hashing for Large-scale Image Search

In most state-of-the-art hashing-based visual search systems, local imag...
research
06/16/2016

Deep Image Set Hashing

In applications involving matching of image sets, the information from m...
research
04/08/2020

Search Result Clustering in Collaborative Sound Collections

The large size of nowadays' online multimedia databases makes retrieving...
research
08/06/2012

One Permutation Hashing for Efficient Search and Learning

Recently, the method of b-bit minwise hashing has been applied to large-...
research
01/06/2021

Scalable Feature Matching Across Large Data Collections

This paper is concerned with matching feature vectors in a one-to-one fa...

Please sign up or login with your details

Forgot password? Click here to reset