Semi-Supervised Metric Learning-Based Anchor Graph Hashing for Large-Scale Image Retrieval

被引:37
作者
Hu, Haifeng [1 ,2 ]
Wang, Kun [3 ,4 ]
Lv, Chenggang [1 ,2 ]
Wu, Jiansheng [5 ]
Yang, Zhen [1 ,2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Dept Telecommun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Natl Engn Res Ctr Commun & Networking, Nanjing 210003, Jiangsu, Peoples R China
[3] Nanjing Univ Posts & Telecommun, Jiangsu Engn Res Ctr Commun & Network Technol, Nanjing 210003, Jiangsu, Peoples R China
[4] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China
[5] Nanjing Univ Posts & Telecommun, Dept Geog & Biol Informat, Nanjing 210003, Jiangsu, Peoples R China
基金
中国博士后科学基金;
关键词
Semi-supervised learning; metric learning; similarity search; anchor graph hashing; stochastic gradient descent; NEAREST-NEIGHBOR; BINARY-CODES; SEARCH; SIMILARITY;
D O I
10.1109/TIP.2018.2860898
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Hashing-based image retrieval methods have become a cutting-edge topic in the information retrieval domain due to their high efficiency and low cost. In order to perform efficient hash learning by simultaneously preserving the semantic similarity and data structures in the feature space, this paper presents the semi-supervised metric learning-based anchor graph hashing method. Our proposed approach can be divided into three parts. First, we exploit a transformation matrix to construct the anchor-based similarity graph of the training set. Second, we propose the objective function based on the triplet relationship, in which the optimal transformation matrix can be learned by using the smoothness of labels and the margin hinge loss incurred by the triplet constraint. Moreover, the stochastic gradient descent (SGD) method leverages the gradient on each triplet to update the transformation matrix. Finally, a penalty factor is designed to accelerate the execution speed of SGD. Through comparison with the retrieval results of several state-of-the-art methods on several image benchmarks, the experiments validate the feasibility and advantages of our proposed methods.
引用
收藏
页码:739 / 754
页数:16
相关论文
共 64 条
[1]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[2]  
[Anonymous], ACM MULTIMEDIA
[3]   Neural Codes for Image Retrieval [J].
Babenko, Artem ;
Slesarev, Anton ;
Chigorin, Alexandr ;
Lempitsky, Victor .
COMPUTER VISION - ECCV 2014, PT I, 2014, 8689 :584-599
[4]  
Beygelzimer Alina, 2006, P 23 INT C MACHINE L, P97, DOI DOI 10.1145/1143844.1143857
[5]  
Bottou Leon, 2007, Advances in Neural Information Processing Systems, P161
[6]  
Broder A. Z., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P327, DOI 10.1145/276698.276781
[7]  
Chua T.-S., 2009, P ACM INT C IM VID R
[8]  
Cubillas AM, 2013, 2013 CONFERENCE ON LASERS AND ELECTRO-OPTICS EUROPE AND INTERNATIONAL QUANTUM ELECTRONICS CONFERENCE (CLEO EUROPE/IQEC)
[9]   Image retrieval: Ideas, influences, and trends of the new age [J].
Datta, Ritendra ;
Joshi, Dhiraj ;
Li, Jia ;
Wang, James Z. .
ACM COMPUTING SURVEYS, 2008, 40 (02)
[10]  
Du Zhang, 2012, Proceedings of the 2012 11th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), P18, DOI 10.1109/ICCI-CC.2012.6311180