期刊
IEEE TRANSACTIONS ON IMAGE PROCESSING
卷 28, 期 2, 页码 739-754出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2018.2860898
关键词
Semi-supervised learning; metric learning; similarity search; anchor graph hashing; stochastic gradient descent
资金
- Natural Science Foundation of China [61571233, 61872195, 61203289, 61572262]
- Key University Science Research Project of Jiangsu Province [14KJA510003, 17KJA510003]
- China Postdoctoral Science Foundation [2017M610252]
- China Postdoctoral Science Special Foundation [2017T100297]
- Open Research Fund of the Jiangsu Engineering Research Center of Communication and Network Technology, NJUPT
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据