韩敏

个人信息Personal Information

教授

博士生导师

硕士生导师

性别:女

毕业院校:日本九州大学

学位:博士

所在单位:控制科学与工程学院

办公地点:创新园大厦B601

联系方式:minhan@dlut.edu.cn

电子邮箱:minhan@dlut.edu.cn

扫描关注

论文成果

当前位置: 中文主页 >> 科学研究 >> 论文成果

Learning contextual dissimilarity on tensor product graph for visual re-ranking

点击次数:

论文类型:期刊论文

发表时间:2018-11-01

发表刊物:IMAGE AND VISION COMPUTING

收录刊物:SCIE

卷号:79

页面范围:1-10

ISSN号:0262-8856

关键字:Diffusion process; Contextual dissimilarity; Tensor product graph; Mean first-passage time; Hybrid fitting constraint

摘要:As the object retrieval problem cannot be well solved by pairwise distances, many algorithms have been developed for visual re-ranking as the post-processing step. As discussed in recent studies, the contextual similarity/dissimilarity based on diffusion process can be obtained by solving an optimization problem that contains a smoothness constraint and a fitting constraint. In this paper, we introduce the mean first-passage time (MFPT) as the contextual dissimilarity. By analysis of the principle behind MFPT, one can find that the corresponding cost function is generated with a hybrid fitting constraint, and the predefined values of contextual dissimilarities are limited within proper ranges. With the hybrid fitting constraint and the smoothness constraint based on a tensor product graph, we construct the objective function associated with a novel contextual dissimilarity. On that basis, we obtain the contextual dissimilarities as an iterative solution by solving the optimization problem, and the manifold structure can be effectively captured by using the proposed method. Our method is evaluated on retrieval tasks for different databases, and the re-ranking result with the proposed contextual dissimilarity outperforms other state-of-the-art algorithms. (C) 2018 Published by Elsevier B.V.