J4 ›› 2015, Vol. 42 ›› Issue (4): 159-164.doi: 10.3969/j.issn.1001-2400.2015.04.026

• Original Articles • Previous Articles     Next Articles

Data-oriented multi-index Hashing

MA Yanping1,2;JI Guangrong1;ZOU Hailin2;XIE Hongtao3   

  1. (1. School of Information Science and Engineering, Ocean Univ. of China, Qingdao  266100, China;
    2. Scholol of Information and Electrical Engineering, Ludong Univ., Yantai  264025, China;
    3. Institute of Information Engineering, Chinese Academy of Sciences, Beijing  100093, China)
  • Received:2014-06-06 Online:2015-08-20 Published:2015-10-12
  • Contact: MA Yanping E-mail:myp74920@126.com

Abstract:

The multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes. However, it is based on the dataset codes uniform distribution assumption, and will lower efficiency in dealing with non-uniformly distributed codes. In this paper, we propose a data-oriented multi-index hashing method. We first compute the correlations between bits and learn adaptive projection vector for each binary substring. Then, instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are nearly uniformly distributed. Besides, we put forward an entropy based measurement to evaluate the distribution of data items in each hash table. Experiments conducted on reference large scale datasets show that compared to the MIH the time performance of our method can be 36.9%~87.4% better .

Key words: nearest neighbor search, binary codes, indexing, multi-index Hashing

CLC Number: 

  • TP391