Hierarchy Neighborhood Discriminative Hashing For An Unified View Of Single-label And Multi-label Image Retrieval

Abstract

Recently, deep supervised hashing methods have become popular for large-scale image retrieval task. To preserve the semantic similarity notion between examples, they typically utilize the pairwise supervision or the triplet supervised information for hash learning. However, these methods usually ignore the semantic class information which can help the improvement of the semantic discriminative ability of hash codes. In this paper, we propose a novel hierarchy neighborhood discriminative hashing method. Specifically, we construct a bipartite graph to build coarse semantic neighbourhood relationship between the sub-class feature centers and the embeddings features. Moreover, we utilize the pairwise supervised information to construct the fined semantic neighbourhood relationship between embeddings features. Finally, we propose a hierarchy neighborhood discriminative hashing loss to unify the single-label and multilabel image retrieval problem with a one-stream deep neural network archite

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyma2019hierarchy

Related papers

• Supervised Deep Hashing For Hierarchical Labeled Data (2017)8.09
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• Semantic Hierarchy Preserving Deep Hashing For Large-scale Image Retrieval (2019)5.24
• Improved Deep Hashing With Soft Pairwise Similarity For Multi-label Image Retrieval (2018)16.82
• Improved Deep Classwise Hashing With Centers Similarity Learning For Image Retrieval (2021)5.84
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Deep Supervised Discrete Hashing (2017)0.00