Dual-level Semantic Transfer Deep Hashing for Efficient Social Image Retrieval

• URL: http://arxiv.org/abs/2006.05586v1
• Date: Wed, 10 Jun 2020 01:03:09 GMT
• Title: Dual-level Semantic Transfer Deep Hashing for Efficient Social Image Retrieval
• Authors: Lei Zhu, Hui Cui, Zhiyong Cheng, Jingjing Li, Zheng Zhang
• Abstract summary: Social network stores and disseminates a tremendous amount of user shared images. Deep hashing is an efficient indexing technique to support large-scale social image retrieval. Existing methods suffer from severe semantic shortage when optimizing a large amount of deep neural network parameters. We propose a Dual-level Semantic Transfer Deep Hashing (DSTDH) method to alleviate this problem.
• Score: 35.78137004253608
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Social network stores and disseminates a tremendous amount of user shared images. Deep hashing is an efficient indexing technique to support large-scale social image retrieval, due to its deep representation capability, fast retrieval speed and low storage cost. Particularly, unsupervised deep hashing has well scalability as it does not require any manually labelled data for training. However, owing to the lacking of label guidance, existing methods suffer from severe semantic shortage when optimizing a large amount of deep neural network parameters. Differently, in this paper, we propose a Dual-level Semantic Transfer Deep Hashing (DSTDH) method to alleviate this problem with a unified deep hash learning framework. Our model targets at learning the semantically enhanced deep hash codes by specially exploiting the user-generated tags associated with the social images. Specifically, we design a complementary dual-level semantic transfer mechanism to efficiently discover the potential semantics of tags and seamlessly transfer them into binary hash codes. On the one hand, instance-level semantics are directly preserved into hash codes from the associated tags with adverse noise removing. Besides, an image-concept hypergraph is constructed for indirectly transferring the latent high-order semantic correlations of images and tags into hash codes. Moreover, the hash codes are obtained simultaneously with the deep representation learning by the discrete hash optimization strategy. Extensive experiments on two public social image retrieval datasets validate the superior performance of our method compared with state-of-the-art hashing methods. The source codes of our method can be obtained at https://github.com/research2020-1/DSTDH

Related papers

• Weakly Supervised Deep Hyperspherical Quantization for Image Retrieval [76.4407063566172]
  We propose Weakly-Supervised Deep Hyperspherical Quantization (WSDHQ), which is the first work to learn deep quantization from weakly tagged images. Specifically, 1) we use word embeddings to represent the tags and enhance their semantic information based on a tag correlation graph. We jointly learn semantics-preserving embeddings and supervised quantizer on hypersphere by employing a well-designed fusion layer and tailor-made loss functions.
  arXiv  Detail & Related papers  (2024-04-07T15:48:33Z)
• Bit-mask Robust Contrastive Knowledge Distillation for Unsupervised Semantic Hashing [71.47723696190184]
  We propose an innovative Bit-mask Robust Contrastive knowledge Distillation (BRCD) method for semantic hashing. BRCD is specifically devised for the distillation of semantic hashing models.
  arXiv  Detail & Related papers  (2024-03-10T03:33:59Z)
• Cascading Hierarchical Networks with Multi-task Balanced Loss for Fine-grained hashing [1.6244541005112747]
  Fine-grained hashing is more challenging than traditional hashing problems. We propose a cascaded network to learn compact and highly semantic hash codes. We also propose a novel approach to coordinately balance the loss of multi-task learning.
  arXiv  Detail & Related papers  (2023-03-20T17:08:48Z)
• Asymmetric Hash Code Learning for Remote Sensing Image Retrieval [22.91678927865952]
  We propose a novel deep hashing method, named asymmetric hash code learning (AHCL), for remote sensing image retrieval. The AHCL generates the hash codes of query and database images in an asymmetric way. The experimental results on three public datasets demonstrate that the proposed method outperforms symmetric methods in terms of retrieval accuracy and efficiency.
  arXiv  Detail & Related papers  (2022-01-15T07:00:38Z)
• Self-Distilled Hashing for Deep Image Retrieval [25.645550298697938]
  In hash-based image retrieval systems, transformed input from the original usually generates different codes. We propose a novel self-distilled hashing scheme to minimize the discrepancy while exploiting the potential of augmented data. We also introduce hash proxy-based similarity learning and binary cross entropy-based quantization loss to provide fine quality hash codes.
  arXiv  Detail & Related papers  (2021-12-16T12:01:50Z)
• PHPQ: Pyramid Hybrid Pooling Quantization for Efficient Fine-Grained Image Retrieval [68.05570413133462]
  We propose a Pyramid Hybrid Pooling Quantization (PHPQ) module to capture and preserve fine-grained semantic information from multi-level features. Experiments on two widely-used public benchmarks, CUB-200-2011 and Stanford Dogs, demonstrate that PHPQ outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-09-11T07:21:02Z)
• Weakly-Supervised Online Hashing [17.987362068956028]
  We propose a new hashing method named Weakly-supervised Online Hashing (WOH) In order to learn high-quality hash codes, WOH exploits the weak supervision by considering the semantics of tags and removing the noise. We develop a discrete online optimization algorithm for WOH, which is efficient and scalable.
  arXiv  Detail & Related papers  (2020-09-16T02:50:22Z)
• Deep Reinforcement Learning with Label Embedding Reward for Supervised Image Hashing [85.84690941656528]
  We introduce a novel decision-making approach for deep supervised hashing. We learn a deep Q-network with a novel label embedding reward defined by Bose-Chaudhuri-Hocquenghem codes. Our approach outperforms state-of-the-art supervised hashing methods under various code lengths.
  arXiv  Detail & Related papers  (2020-08-10T09:17:20Z)
• Reinforcing Short-Length Hashing [61.75883795807109]
  Existing methods have poor performance in retrieval using an extremely short-length hash code. In this study, we propose a novel reinforcing short-length hashing (RSLH) In this proposed RSLH, mutual reconstruction between the hash representation and semantic labels is performed to preserve the semantic information. Experiments on three large-scale image benchmarks demonstrate the superior performance of RSLH under various short-length hashing scenarios.
  arXiv  Detail & Related papers  (2020-04-24T02:23:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.