SPEC hashing: Similarity preserving algorithm for entropy-based coding
Citations Over TimeTop 10% of 2010 papers
Abstract
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary hash functions for fast nearest neighbor retrieval. The nearest neighbors are defined according to the semantic similarity between the objects. Our method uses the information of these semantic similarities and learns a hash function with binary code such that only objects with high similarity have small Hamming distance. The hash function is incrementally trained one bit at a time, and as bits are added to the hash code Hamming distances between dissimilar objects increase. We further link our method to the idea of maximizing conditional entropy among pair of bits and derive an extremely efficient linear time hash learning algorithm. Experiments on similar image retrieval and celebrity face recognition show that our method produces apparent improvement in performance over some state-of-the-art methods.
Related Papers
- → A hash centroid construction method with Swin transformer for multi-label image retrieval(2023)9 cited
- → Using self-organizing maps to learn geometric hash functions for model-based object recognition(1998)17 cited
- → Image databases and near-perfect hash table(1997)18 cited
- → Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time(2006)
- Hash Table: Computer science, Data structure, Hash function, Unique key, Value (mathematics), Array data type, Collision (computer science), Instruction ... science), Amortized analysis, Search tree(2009)