SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding

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-ofthe-art methods.

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Ruei-Sung Lin, David Ross, Jay Yagnik
• Keywords: Approximate Nearest Neighbors, Computer Vision, CVPR 2010, Hash Function, Nearest Neighbors