Multiple Code Hashing for Efficient Image Retrieval

arXiv:2008.01503v2 Announce Type: replace
Abstract: Due to its low storage cost and fast query speed, hashing has been widely used in large-scale image retrieval tasks. Hash bucket search returns data points within a given Hamming radius to each query, which can enable search at a constant or sub-linear time cost. However, existing hashing methods cannot achieve satisfactory retrieval performance for hash bucket search in complex scenarios, since they learn only one hash code for each image. More specifically, by using …

abstract arxiv code cost cs.cv cs.lg data hash hashing however image linear low multiple query retrieval returns scale search speed stat.ml storage tasks type