...
首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >Metric learning-based kernel transformer with triplets and label constraints for feature fusion
【24h】

Metric learning-based kernel transformer with triplets and label constraints for feature fusion

机译:基于度量学习的内核变压器,具有三胞胎和标签约束的特征融合

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Feature fusion is an important skill to improve the performance in computer vision, the difficult problem of feature fusion is how to learn the complementary properties of different features. We recognize that feature fusion can benefit from kernel metric learning. Thus, a metric learning-based kernel transformer method for feature fusion is proposed in this paper. First, we propose a kernel transformer to convert data from data space to kernel space, which makes feature fusion and metric learning can be performed in the transformed kernel space. Second, in order to realize supervised learning, both triplets and label constraints are embedded into our model. Third, in order to solve the unknown kernel matrices, LogDet divergence is also introduced into our model. Finally, a complete optimization objective function is formed. Based on an alternating direction method of multipliers (ADMM) solver and the Karush-Kuhn-Tucker (KKT) theorem, the proposed optimization problem is solved with the rigorous theoretical analysis. Experimental results on image retrieval demonstrate the effectiveness of the proposed methods. (C) 2019 Elsevier Ltd. All rights reserved.
机译:特征融合是提高计算机视觉性能的重要技能,特征融合的难题是如何学习不同特征的互补特性。我们认识到,功能融合可以从内核度量学习中受益。因此,本文提出了一种用于特征融合的基于度学基于学习的核变压器方法。首先,我们提出了一个内核变换器,将数据从数据空间转换为内核空间,这使得可以在变换的内核空间中执行特征融合和度量学习。其次,为了实现监督学习,三胞胎和标签约束都嵌入到我们的模型中。第三,为了解决未知的内核矩阵,还将LogDet发散引入我们的模型。最后,形成完整的优化目标函数。基于乘法器(ADMM)求解器和Karush-Kuhn-Tucker(KKT)定理的交替方向方法,通过严格的理论分析解决了所提出的优化问题。图像检索的实验结果证明了所提出的方法的有效性。 (c)2019年elestvier有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号