Efficient Querying from Weighted Binary Codes

11/21/2019
by   Zhenyu Weng, et al.
0

Binary codes are widely used to represent the data due to their small storage and efficient computation. However, there exists an ambiguity problem that lots of binary codes share the same Hamming distance to a query. To alleviate the ambiguity problem, weighted binary codes assign different weights to each bit of binary codes and compare the binary codes by the weighted Hamming distance. Till now, performing the querying from the weighted binary codes efficiently is still an open issue. In this paper, we propose a new method to rank the weighted binary codes and return the nearest weighted binary codes of the query efficiently. In our method, based on the multi-index hash tables, two algorithms, the table bucket finding algorithm and the table merging algorithm, are proposed to select the nearest weighted binary codes of the query in a non-exhaustive and accurate way. The proposed algorithms are justified by proving their theoretic properties. The experiments on three large-scale datasets validate both the search efficiency and the search accuracy of our method. Especially for the number of weighted binary codes up to one billion, our method shows a great improvement of more than 1000 times faster than the linear scan.

READ FULL TEXT
research
09/18/2020

Accelerating Search on Binary Codes in Weighted Hamming Space

Compared to Hamming distance, weighted Hamming distance as a similarity ...
research
06/06/2023

Constant Sequence Extension for Fast Search Using Weighted Hamming Distance

Representing visual data using compact binary codes is attracting increa...
research
07/11/2013

Fast Exact Search in Hamming Space with Multi-Index Hashing

There is growing interest in representing image data and feature descrip...
research
01/16/2020

Weight Enumerators for Number-Theoretic Codes and Cardinalities of Non-binary VT Codes

This paper investigates the extended weight enumerators for the number-t...
research
03/14/2016

Learning Binary Codes and Binary Weights for Efficient Classification

This paper proposes a generic formulation that significantly expedites t...
research
05/15/2018

Efficient end-to-end learning for quantizable representations

Embedding representation learning via neural networks is at the core fou...
research
10/21/2014

Learning to Rank Binary Codes

Binary codes have been widely used in vision problems as a compact featu...

Please sign up or login with your details

Forgot password? Click here to reset