Survey on Hash Learning for Large-scale Image Retrieval

被引:0
作者
Zhang, Xue-Ning [1 ]
Liu, Xing-Bo [2 ]
Song, Jing-Kuan [3 ]
Nie, Xiu-Shan [2 ]
Wang, Shao-Hua [2 ]
Yin, Yi-Long [1 ]
机构
[1] School of Software, Shandong University, Jinan
[2] School of Computer Science and Technology, Shandong Jianzhu University, Jinan
[3] School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu
来源
Ruan Jian Xue Bao/Journal of Software | 2025年 / 36卷 / 01期
关键词
approximate nearest neighbor search; hash learning; image retrieval; large-scale data; similarity preserving;
D O I
10.13328/j.cnki.jos.007141
中图分类号
学科分类号
摘要
As image data grows explosively on the Internet and image application fields widen, the demand for large-scale image retrieval is increasing greatly. Hash learning provides significant storage and retrieval efficiency for large-scale image retrieval and has attracted intensive research interest in recent years. Existing surveys on hash learning are confronted with the problems of weak timeliness and unclear technical routes. Specifically, they mainly conclude the hashing methods proposed five to ten years ago, and few of them conclude the relationship between the components of hashing methods. In view of this, this study makes a comprehensive survey on hash learning for large-scale image retrieval by reviewing the hash learning literature published in the past twenty years. First, the technical route of hash learning and the key components of hashing methods are summarized, including loss function, optimization strategy, and out-of-sample extension. Second, hashing methods for image retrieval are classified into two categories: unsupervised hashing methods and supervised ones. For each category of hashing methods, the research status and evolvement process are analyzed. Third, several image benchmarks and evaluation metrics are introduced, and the performance of some representative hashing methods is analyzed through comparative experiments. Finally, the future research directions of hash learning are summarized considering its limitations and new challenges. © 2025 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:79 / 106
页数:27
相关论文
共 188 条
[31]  
Hu MQ, Yang Y, Shen FM, Xie N, Shen HT., Hashing with angular reconstructive embeddings, IEEE Trans. on Image Processing, 27, 2, pp. 545-555, (2018)
[32]  
Duan LY, Wu YW, Huang YC, Wang Z, Yuan JS, Gao W., Minimizing reconstruction bias hashing via joint projection learning and quantization, IEEE Trans. on Image Processing, 27, 6, pp. 3127-3141, (2018)
[33]  
He KM, Wen F, Sun J., K-means hashing: An affinity-preserving quantization method for learning binary compact codes, Proc. of the 2013 IEEE Conf. on Computer Vision and Pattern Recognition, pp. 2938-2945, (2013)
[34]  
Norouzi M, Fleet DJ., Cartesian k-means, Proc. of the 2013 IEEE Conf. on Computer Vision and Pattern Recognition, pp. 3017-3024, (2013)
[35]  
Ryali CK, Hopfield JJ, Grinberg L, Krotov D., Bio-inspired hashing for unsupervised similarity search, Proc. of the 37th Int’l Conf. on Machine Learning. PMLR, pp. 8295-8306, (2020)
[36]  
Ding GG, Guo YC, Zhou JL., Collective matrix factorization hashing for multimodal data, Proc. of the 2014 IEEE Conf. on Computer Vision and Pattern Recognition, pp. 2083-2090, (2014)
[37]  
Mukherjee L, Ravi SN, Ithapu VK, Holmes T, Singh V., An NMF perspective on binary hashing, Proc. of the 2015 IEEE Int’l Conf. on Computer Vision, pp. 4184-4192, (2015)
[38]  
He SY, Wang BK, Wang Z, Yang Y, Shen FM, Huang Z, Shen HT., Bidirectional discrete matrix factorization hashing for image search, IEEE Trans. on Cybernetics, 50, 9, pp. 4157-4168, (2020)
[39]  
Hu D, Nie FP, Li XL., Discrete spectral hashing for efficient similarity retrieval, IEEE Trans. on Image Processing, 28, 3, pp. 1080-1091, (2019)
[40]  
Shen FM, Shen CH, Shi QF, van den Hengel A, Tang ZM., Inductive hashing on manifolds, Proc. of the 2013 IEEE Conf. on Computer Vision and Pattern Recognition, pp. 1562-1569, (2013)