Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning

Abstract

Representing images by compact hash codes is an attractive approach for large-scale content-based image retrieval. In most state-of-the-art hashing-based image retrieval systems, for each image, local descriptors are first aggregated as a global representation vector. This global vector is then subjected to a hashing function to generate a binary hash code. In previous works, the aggregating and the hashing processes are designed independently. Hence these frameworks may generate suboptimal hash codes. In this paper, we first propose a novel unsupervised hashing framework in which feature aggregating and hashing are designed simultaneously and optimized jointly. Specifically, our joint optimization generates aggregated representations that can be better reconstructed by some binary codes. This leads to more discriminative binary hash codes and improved retrieval accuracy. In addition, the proposed method is flexible. It can be extended for supervised hashing. When the data label is ava

Stats

• citations20
• S2 citations—
• github stars0
• HF likes0
• heat score9.92
• arxiv keydo2019simultaneous

Related papers

• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Simultaneous Region Localization And Hash Coding For Fine-grained Image Retrieval (2019)0.00
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Binary Constrained Deep Hashing Network For Image Retrieval Without Manual Annotation (2018)5.84
• Supervised Hashing With End-to-end Binary Deep Neural Network (2017)2.26
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00