Pairwise Identity Verification via Linear Concentrative Metric Learning - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Cybernetics Year : 2018

Pairwise Identity Verification via Linear Concentrative Metric Learning

Abstract

This paper presents a study of metric learning systems on pairwise identity verification, including pairwise face verification and pairwise speaker verification, respectively. These problems are challenging because the individuals in training and testing are mutually exclusive, and also due to the probable setting of limited training data. For such pairwise verification problems, we present a general framework of metric learning systems and employ the stochastic gradient descent algorithm as the optimization solution. We have studied both similarity metric learning and distance metric learning systems, of either a linear or shallow nonlinear model under both restricted and unrestricted training settings. Extensive experiments demonstrate that with limited training pairs, learning a linear system on similar pairs only is preferable due to its simplicity and superiority, i.e. it generally achieves competitive performance on both the LFW face dataset and the NIST speaker dataset. It is also found that a pre-trained deep nonlinear model helps to improve the face verification results significantly.
Fichier principal
Vignette du fichier
zheng2016_tcyb.pdf (1.12 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01435368 , version 1 (13-01-2017)

Identifiers

Cite

Lilei Zheng, Stefan Duffner, Khalid Idrissi, Christophe Garcia, Atilla Baskurt. Pairwise Identity Verification via Linear Concentrative Metric Learning. IEEE Transactions on Cybernetics, 2018, pp.1 - 12. ⟨10.1109/TCYB.2016.2634011⟩. ⟨hal-01435368⟩
262 View
462 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More