Query-adaptive Hash Code Ranking For Large-scale Multi-view Visual Search

Abstract

Hash based nearest neighbor search has become attractive in many applications. However, the quantization in hashing usually degenerates the discriminative power when using Hamming distance ranking. Besides, for large-scale visual search, existing hashing methods cannot directly support the efficient search over the data with multiple sources, and while the literature has shown that adaptively incorporating complementary information from diverse sources or views can significantly boost the search performance. To address the problems, this paper proposes a novel and generic approach to building multiple hash tables with multiple views and generating fine-grained ranking results at bitwise and tablewise levels. For each hash table, a query-adaptive bitwise weighting is introduced to alleviate the quantization loss by simultaneously exploiting the quality of hash functions and their complement for nearest neighbor search. From the tablewise aspect, multiple hash tables are built for differ

Stats

• citations67
• S2 citations—
• github stars0
• HF likes0
• heat score13.74
• arxiv keyliu2019query

Related papers

• Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68
• Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
• Learning Discriminative Hashing Codes For Cross-modal Retrieval Based On Multi-view Features (2018)3.58
• Robust Hashing For Multi-view Data: Jointly Learning Low-rank Kernelized Similarity Consensus And Hash Functions (2016)11.19
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Locality Preserving Multiview Graph Hashing For Large Scale Remote Sensing Image Search (2023)4.52
• Set-to-set Hashing With Applications In Visual Recognition (2017)0.00
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00