LOH And Behold: Web-scale Visual Search, Recommendation And Clustering Using Locally Optimized Hashing

Abstract

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 requirin

Stats

• citations3
• S2 citations—
• github stars0
• HF likes0
• heat score4.52
• arxiv keykalantidis2016loh

Related papers

• Query-adaptive Hash Code Ranking For Large-scale Multi-view Visual Search (2019)13.74
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Improving Similarity Search With High-dimensional Locality-sensitive Hashing (2018)0.00
• Improving Locality Sensitive Hashing By Efficiently Finding Projected Nearest Neighbors (2020)6.77
• Drawbacks And Proposed Solutions For Real-time Processing On Existing State-of-the-art Locality Sensitive Hashing Techniques (2019)0.00
• Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
• Locality Sensitive Hashing For Set-queries, Motivated By Group Recommendations (2020)0.00
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00