Paper Info
Title
Online Hashing With Bit Selection For Image Retrieval
Abstract
Online hashing methods have been intensively investigated in semantic image retrieval due to their efficiency in learning the hash functions with one pass through the streaming data. Among the online hashing methods, those based on the target codes are usually superior to others. However, the target codes in these methods are generated heuristically in advance and cannot be learned online to capture the characteristics of the data. In this paper, we propose a new online hashing method in which the target codes are constructed according to the data characteristics and are used to learn the hash functions online. By designing a metric to select the effective bits online for constructing the target codes, the learned hash functions are resistant to the bit-flipping error. At the same time, the correlation between the hash functions is also considered in the designed metric. Hence, the hash functions have low redundancy. Extensive experiments show that our method can achieve comparable or better performance than other online hashing methods on both the static database and the dynamic database.
Year
DOI
Venue
2021
10.1109/TMM.2020.3004962
IEEE TRANSACTIONS ON MULTIMEDIA
Keywords
DocType
Volume
Hash functions, Binary codes, Correlation, Image retrieval, Measurement, Streaming media, Online hashing, approximate nearest neighbor search, bit selection, target codes, image retrieval
Journal
23
ISSN
Citations 
PageRank 
1520-9210
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Zhenyu Weng163.85
Zhu Yuesheng211239.21