返回
Weakly Supervised Compositional Metric Learning for Face Verification
DOI:10.1109/TIM.2021.3115212.png)
摘要
En 中文
The aim of metric learning is to learn a mapping relationship, which reduces the intraclass distance and increases the interclass distance. As there are a large number of parameters that need to be optimized in traditional metric learning algorithms, they may suffer from high computational complexity and overfitting problems in the case of insufficient training data. To alleviate this, we propose a weakly supervised compositional metric learning (WSCML) method, which utilizes a set of predetermined local discriminant metrics to learn the optimal weight combination of the component metrics. Under the large margin framework, our WSCML can effectively improve the verification accuracy by constraining the Mahalanobis distance of positive sample pairs to be less than a small threshold and that of negative sample pairs to be greater than a large threshold. In addition, we employ three regularization terms to optimize the proposed WSCML, respectively, to control the sparsity of the solution while maintaining its feasibility. Experimental results on KinFaceW-I, fine-grained face verification (FGFV), and Labled Faces in the Wild (LFW) datasets show the effectiveness of the proposed method.
Keyword:
Face verification
kinship verification
local metric
Mahalanobis distance
metric learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.9W
被引数:
5.8W
机构
引用论文
Crystalline‐State Reaction with Allosteric Effect in Spin‐Crossover, Interpenetrated Networks with Magnetic and Optical Bistability具有磁和光学双稳态的自旋交叉,互穿网络中具有变构效应的晶态反应

