PCCA: A new approach for distance learning from sparse pairwise constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

PCCA: A new approach for distance learning from sparse pairwise constraints

Résumé

This paper introduces Pairwise Constrained Component Analysis (PCCA), a new algorithm for learning distance metrics from sparse pairwise similarity/dissimilarity constraints in high dimensional input space, problem for which most existing distance metric learning approaches are not adapted. PCCA learns a projection into a low-dimensional space where the distance between pairs of data points respects the desired constraints, exhibiting good generalization properties in presence of high dimensional data. The paper also shows how to efficiently kernelize the approach. PCCA is experimentally validated on two challenging vision tasks, face verification and person re-identification, for which we obtain state-of-the-art results.
Fichier principal
Vignette du fichier
12_cvpr_ldca.pdf (1.11 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00806007 , version 1 (29-03-2013)

Identifiants

Citer

Alexis Mignon, Frédéric Jurie. PCCA: A new approach for distance learning from sparse pairwise constraints. IEEE conf. on Computer Vision and Pattern Recognition, 2012, France. pp.2666-2672, ⟨10.1109/CVPR.2012.6247987⟩. ⟨hal-00806007⟩
413 Consultations
1943 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More