Optimal Projection Guided Transfer Hashing for Image Retrieval
Not on the map. Why?
Abstract (arXiv)
Recently, learning to hash has been widely studied for image retrieval thanks to the computation and storage efficiency of binary codes. For most existing learning to hash methods, sufficient training images are required and used to learn precise hashing codes. However, in some real-world applications, there are not always sufficient training images in the domain of interest. In addition, some existing supervised approaches need a amount of labeled data, which is an expensive process in term of time, label and human expertise. To handle such problems, inspired by transfer learning, we propose a simple yet effective unsupervised hashing method named Optimal Projection Guided Transfer Hashing (GTH) where we borrow the images of other different but related domain i.e., source domain to help learn precise hashing codes for the domain of interest i.e., target domain. Besides, we propose to seek for the maximum likelihood estimation (MLE) solution of the hashing functions of target and source domains due to the domain gap. Furthermore,an alternating optimization method is adopted to obtain the two projections of target and source domains such that the domain hashing disparity is reduced gradually. Extensive experiments on various benchmark databases verify that our method outperforms many state-of-the-art learning to hash methods. The implementation details are available at https://github.com/liuji93/GTH.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 1; 2025: 2.
8 papers.
- 2021Large-Scale Spatio-Temporal Person Re-identification: Algorithms and Benchmarkcited by 47
- 2022BP-Triplet Net for Unsupervised Domain Adaptation: A Bayesian Perspectivecited by 7
- 2024A Survey of Multimodal Composite Editing and Retrievalcited by 5
- 2022Asymmetric Transfer Hashing with Adaptive Bipartite Graph Learningcited by 0
- 2022Renewing Iterative Self-labeling Domain Adaptation with Application to the Spine Motion Predictioncited by 0
- 2023SIDE: Self-supervised Intermediate Domain Exploration for Source-free Domain Adaptationcited by 0
- 2025Cross-Domain Diffusion with Progressive Alignment for Efficient Adaptive Retrievalcited by 0
- 2025Prototype-Based Semantic Consistency Alignment for Domain Adaptive Retrievalcited by 0
- 2025Prototype-Based Semantic Consistency Alignment for Domain Adaptive Retrieval4 Dec 2025
- 2025Cross-Domain Diffusion with Progressive Alignment for Efficient Adaptive Retrieval20 May 2025
- 2024A Survey of Multimodal Composite Editing and Retrieval9 Sep 2024
- 2023SIDE: Self-supervised Intermediate Domain Exploration for Source-free Domain Adaptation13 Oct 2023
- 2022Renewing Iterative Self-labeling Domain Adaptation with Application to the Spine Motion Prediction14 Nov 2022
- 2022Asymmetric Transfer Hashing with Adaptive Bipartite Graph Learning25 Jun 2022
- 2022BP-Triplet Net for Unsupervised Domain Adaptation: A Bayesian Perspective19 Feb 2022
- 2021Large-Scale Spatio-Temporal Person Re-identification: Algorithms and Benchmark31 May 2021