J-STAGE Home  >  Publications - Top  > Bibliographic Information

IEICE Transactions on Information and Systems
Vol. E98.D (2015) No. 3 pp. 671-680

Language:

http://doi.org/10.1587/transinf.2014EDP7212

Regular Section

One of the fast approximate similarity search techniques is a binary hashing method that transforms a real-valued vector into a binary code. The similarity between two binary codes is measured by their Hamming distance. In this method, a hash table is often used when undertaking a constant-time similarity search. The number of accesses to the hash table, however, increases when the number of bits lengthens. In this paper, we consider a method that does not access data with a long Hamming radius by using multiple binary codes. Further, we attempt to integrate the proposed approach and the existing multi-index hashing (MIH) method to accelerate the performance of the similarity search in the Hamming space. Then, we propose a learning method of the binary hash functions for multiple binary codes. We conduct an experiment on similarity search utilizing a dataset of up to 50 million items and show that our proposed method achieves a faster similarity search than that possible with the conventional linear scan and hash table search.

Copyright © 2015 The Institute of Electronics, Information and Communication Engineers

Article Tools

Share this Article