Abstract
Traditional image retrieval methods suffer from a significant performance degradation when the model is trained on the target dataset and run on another dataset. To address this issue, Domain Adaptive Retrieval (DAR) has emerged as a promising solution, specifically designed to overcome domain shifts in retrieval tasks. However, existing unsupervised DAR methods still face two primary limitations: (1) they under-explore the intrinsic structure among domains, resulting in limited generalization capabilities; and (2) the models are often too complex to be applied to large-scale datasets. To tackle these limitations, we propose a novel unsupervised DAR method named Anchor-based Domain Adaptive Hashing (ADAH). ADAH aims to exploit the commonalities among domains with the assumption that a consensus latent space exists for the source and target domains. To achieve this, an anchor-based similarity reconstruction scheme is proposed, which learns a set of domain-shared anchors and domain-specific anchor graphs, and then reconstructs the similarity matrix with these anchor graphs, thereby effectively exploiting inter- and intra-domain similarity structures. Subsequently, by treating the anchor graphs as feature embeddings, we solve the Distance-Distance Difference Minimization (DDDM) problem between them and their corresponding hash codes. This preserves the similarity structure of the similarity matrix in the hash code. Finally, a two-stage strategy is employed to derive the hash function, ensuring its effectiveness and scalability. Experimental results on four datasets demonstrate the effectiveness of the proposed method.










Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data availability
The MNIST-USPS, VLCS, and Cross-dataset Testbed datasets used during the current study can be accessed via https://github.com/jindongwang/transferlearning/tree/master/data. The Office-Home dataset used during the current study is publicly available at https://www.hemanthdv.org/officeHomeDataset.html.
References
Cao Z, Long M, Huang C, Wang J (2018) Transfer adversarial hashing for hamming space retrieval. In: AAAI conference on artificial intelligence. In: AAAI, pp 6698–6705
Chen B-W, Huang J-Y, Wu Y-H (2024) Robust data-driven automation based on relaxed supervised hashing with self-optimized labels. IEEE Trans Autom Sci Eng 21(1):512–527
Chen Y, Fang X, Liu Y, Zheng W, Kang P, Han N, Xie S (2024) Two-step strategy for domain adaptation retrieval. IEEE Trans Knowl Data Eng 36(2):897–912
Chen Y, Lai Z, Ding Y, Lin K, Wong W (2019) Deep supervised hashing with anchor graph. In: 2019 IEEE/CVF International Conference on Computer Vision (ICCV), pp 9795–9803
Daumé III H (2007) Frustratingly easy domain adaptation. In: ACL 2007, Proceedings of the 45th annual meeting of the association for computational linguistics, June 23–30, 2007, Prague, Czech Republic. The Association for Computational Linguistics
Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Snoeyink J, Boissonnat J-D (eds) Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8–11, 2004. ACM, pp 253–262
Ding W, Liu C, Huang J, Cheng C, Ju H (2023) ViTH-RFG: vision transformer hashing with residual fuzzy generation for targeted attack in medical image retrieval. IEEE Trans Fuzzy Syst 1–15
Dong X, Liu L, Zhu L, Cheng Z, Zhang H (2021) Unsupervised deep k-means hashing for efficient image retrieval and clustering. IEEE Trans Circuits Syst Video Technol 31(8):3266–3277
Fang X, Liu Z, Han N, Jiang L, Teng S (2021) Discrete matrix factorization hashing for cross-modal retrieval. Int J Mach Learn Cybern 12(10):3023–3036
Gong Y, Lazebnik S, Gordo A, Perronnin F (2013) Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans Pattern Anal Mach Intell 35(12):2916–2929
Huang F, Zhang L, Gao X (2022) Domain adaptation preconceived hashing for unconstrained visual retrieval. IEEE Trans Neural Netw Learn Syst 33(10):5641–5655
Huang F, Zhang L, Yang Y, Zhou X (2020) Probability weighted compact feature for domain adaptive retrieval. In: 2020 IEEE/CVF conference on computer vision and pattern recognition (CVPR), pp 9579–9588
Huang Q, Feng J, Fang Q, Ng W (2017) Two efficient hashing schemes for high-dimensional furthest neighbor search. IEEE Trans Knowl Data Eng 29(12):2772–2785
Hull JJ (1994) A database for handwritten text recognition research. IEEE Trans Pattern Anal Mach Intell 16:550–554
Jiang L, Fang X, Sun W, Han N, Teng S (2023) Low-rank constraint based dual projections learning for dimensionality reduction. Signal Process 204:108817
Jiang Q-Y, Li W-J (2015) Scalable graph hashing with feature transformation. In: Proceedings of the twenty-fourth international joint conference on artificial intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25–31, 2015. AAAI Press, pp 2248–2254
Jin Z, Li C, Lin Y, Cai D (2014) Density sensitive hashing. IEEE Trans Cybern 44(8):1362–1371
Lai Z, Chen Y, Wu J, Wong WK, Shen F (2018) Jointly sparse hashing for image retrieval. IEEE Trans Image Process 27(12):6147–6158
LeCun Y, Bottou L, Bengio Y, Haffner P (1998) Gradient-based learning applied to document recognition. Proc IEEE 86(11):2278–2324
Liu B, Cao Y, Long M, Wang J, Wang J (2018) Deep triplet quantization. In: 2018 ACM multimedia conference on multimedia conference, MM 2018, Seoul, Republic of Korea, October 22–26, 2018. ACM, pp 755–763
Liu W, He J, Chang S-F (2010) Large graph construction for scalable semi-supervised learning. In: Proceedings of the 27th international conference on machine learning (ICML-10), June 21–24, 2010, Haifa, Israel. Omnipress, pp 679–686
Liu W, Mu C, Kumar S, Chang S-F (2014) Discrete graph hashing. In: Advances in neural information processing systems 27: annual conference on neural information processing systems 2014, December 8–13 2014, Montreal, Quebec, Canada, pp 3419–3427
Liu W, Wang J, Ji R, Jiang Y-G, Chang S-F (2012) Supervised hashing with kernels. In: 2012 IEEE conference on computer vision and pattern recognition, pp 2074–2081
Liu W, Wang J, Kumar S, Chang S-F (2011) Hashing with graphs. In: Getoor L, Scheffer T (eds) Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, June 28–July 2, 2011. Omnipress, pp 1–8
Liu Y, Ji S, Fu Q, Chiu DKW, Gong M (2022) An efficient dual semantic preserving hashing for cross-modal retrieval. Neurocomputing 492:264–277
Liu Z, Shi K, Niu D, Huo H, Zhang K (2023) Dynamic classifier approximation for unsupervised domain adaptation. Signal Process 206:108915
Long M, Wang J, Ding G, Sun J, Yu PS (2013) Transfer feature learning with joint distribution adaptation. In: IEEE International conference on computer vision, ICCV 2013, Sydney, Australia, December 1–8, 2013. IEEE Computer Society, pp 2200–2207
Lu H, Zhang M, Xu X, Li Y, Shen HT (2021) Deep fuzzy hashing network for efficient image retrieval. IEEE Trans Fuzzy Syst 29(1):166–176
Lu J, Zhou J, Chen Y, Pedrycz W, Hung KW (2024) Asymmetric transfer hashing with adaptive bipartite graph learning. IEEE Trans Cybern 54(1):533–545
Luo X, Ma Z, Cheng W, Deng M (2022) Improve deep unsupervised hashing via structural and intrinsic similarity learning. IEEE Signal Process Lett 29:602–606
Luo X, Wang H, Wu D, Chen C, Deng M, Huang J, Hua X-S (2023) A survey on deep hashing methods. ACM Trans Knowl Discov Data 17(1):15:1-15:50
Shao J, Zhao Z, Su F (2019) Two-stage deep learning for supervised cross-modal retrieval. Multimed Tools Appl 78(12):16615–16631
Shen F, Shen C, Liu W, Shen HT (2015) Supervised discrete hashing. In: 2015 IEEE conference on computer vision and pattern recognition (CVPR), pp 37–45
Torralba A, Efros AA (2011) Unbiased look at dataset bias. In: CVPR 2011, pp 1521–1528
Tu R-C, Mao X-L, Guo J-N, Wei W, Huang H (2021) Partial-softmax loss based deep hashing. In: Proceedings of the Web Conference 2021, WWW ’21, New York, NY, USA. Association for Computing Machinery, pp 2869–2878
van der Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579–2605
Venkateswara H, Eusebio J, Chakraborty S, Panchanathan S (2017) Deep hashing network for unsupervised domain adaptation. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21–26, 2017. IEEE Computer Society, pp 5385–5394
Venkateswara H, Eusebio J, Chakraborty S, Panchanathan S (2017) Deep hashing network for unsupervised domain adaptation. In: IEEE Conference on Computer Vision and Pattern Recognition. IEEE; IEEE Computer Society; CVF, pp 5385–5394
Wang J, Wang J, Yu N, Li S (2013) Order preserving hashing for approximate nearest neighbor search. In: ACM Multimedia Conference, MM ’13, Barcelona, Spain, October 21–25, 2013. ACM, pp 133–142
Wang J, Zhang T, Sebe N, Shen HT (2018) A survey on learning to hash. IEEE Trans Pattern Anal Mach Intell 40(4):769–790
Wang J, Zeng Z, Chen B, Dai T, Xia S-T (2022) Contrastive quantization with code memory for unsupervised image retrieval. In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22–March 1, 2022. AAAI Press, pp 2468–2476
Wang M, Deng W (2018) Deep visual domain adaptation: a survey. Neurocomputing 312:135–153
Wang S, Liu X, Zhu X, Zhang P, Zhang Y, Gao F, Zhu E (2022) Fast parameter-free multi-view subspace clustering with consensus anchor guidance. IEEE Trans Image Process 31:556–568
Wang Y, Luo X, Nie L, Song J, Zhang W, Xu XS (2021) Batch: a scalable asymmetric discrete cross-modal hashing. IEEE Trans Knowled Data Eng 33(11):3507–3519
Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: Advances in neural information processing systems 21, proceedings of the twenty-second annual conference on neural information processing systems, Vancouver, British Columbia, Canada, December 8-11, 2008. Curran Associates, pp 1753–1760
Xia H, Jing T, Chen C, Ding Z (2021) Semi-supervised domain adaptive retrieval via discriminative hashing learning. Association for Computing Machinery, New York, pp 3853–3861
Zhang L, Fu J, Wang S, Zhang D, Dong Z, Chen CLP (2020) Guide subspace learning for unsupervised domain adaptation. IEEE Trans Neural Netw Learn Syst 31(9):3374–3388
Zhang L, Liu J, Yang Y, Huang F, Nie F, Zhang D (2020) Optimal projection guided transfer hashing for image retrieval. IEEE Trans Circuits Syst Video Technol 30(10):3788–3802
Zhang X, Sun F, Liu G, Ma Y (2014) Fast low-rank subspace segmentation. IEEE Trans Knowl Data Eng 26(5):1293–1297
Zhou JT, Zhao H, Peng X, Fang M, Qin Z, Goh RSM (2018) Transfer hashing: from shallow to deep. IEEE Trans Neural Netw Learn Syst 29(12):6191–6201
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 62176065 and 62202107, in part by the Guangdong Provincial Natural Science Foundation under Grant No. 2022A1515011277, and in part by the School level scientific research project of Guangdong Polytechnic Normal University under Grant No. 2021SDKYA013.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chen, Y., Fang, X., Liu, Y. et al. Anchor-based Domain Adaptive Hashing for unsupervised image retrieval. Int. J. Mach. Learn. & Cyber. 15, 6011–6026 (2024). https://doi.org/10.1007/s13042-024-02298-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-024-02298-x