Journal of Applied Sciences ›› 2017, Vol. 35 ›› Issue (2): 193-206.doi: 10.3969/j.issn.0255-8297.2017.02.006

Previous Articles     Next Articles

Euclidean Double Bits Embedding Hashing for Image Retrieval

LI Lei1,2, CEN Yi-gang1,2, ZHAO Rui-zhen1,2, CUI Li-hong3, WANG Yan-hong1,2   

  1. 1. Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China;
    2. Key Laboratory of Information Science and Network Technology, Beijing Jiaotong University Beijing 100044, China;
    3. College of Sciences, Beijing University of Chemical Technology, Beijing 100029, China
  • Received:2016-08-20 Revised:2016-10-18 Online:2017-03-30 Published:2017-03-30

Abstract:

We propose a double-bit embedding hashing method based on the Euclidean distance (DBE-E). Euclidean distance is used to measure similarity between the binary hash codes to better preserve similarity relations of the original feature space and improve retrieval precision. To speed computation, bit operation is used to calculate the Euclidean distance between the hash codes. It is 400 times faster than the traditional calculation method of the Euclidean distance for double-bit embedding of 64-bit hash code. Experiments on three image data sets show that the proposed method produces better results than other popular quantization strategies of hashing.

Key words: hashing, double-bit embedding, image retrieval, Euclidean distance

CLC Number: