Name
Abstract | ||
|---|---|---|
In this paper, we propose a new neighborhood repulsed correlation metric learning (NRCML) method for kinship verification. While several metric learning algorithms have been proposed in recent years and some of them have successfully applied to kinship verification, most existing metric learning methods are developed based on the Euclidian similarity metric, which is not powerful enough to measure the similarity of face samples. To address this, we propose a NRCML method by using the correlation similarity measure to learn a discriminative distance metric, under which positive pairs are pulled as close as possible and negative pairs lying in a neighborhood are repulsed as far as possible, simultaneously. Experimental results are presented to show the effectiveness of the proposed method. |
Year | Venue | Keywords |
|---|---|---|
2015 | 2015 VISUAL COMMUNICATIONS AND IMAGE PROCESSING (VCIP) | Kinship verification, metric learning, subspace learning, correlation, face recognition |
Field | DocType | Citations |
Histogram,Similarity measure,Computer science,Metric (mathematics),Theoretical computer science,Artificial intelligence,Discriminative model,Computer vision,Pattern recognition,Kinship,Lying,Feature extraction,Correlation | Conference | 1 |
PageRank | References | Authors |
0.35 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haibin Yan | 1 | 172 | 8.55 |
| Xiuzhuang Zhou | 2 | 380 | 20.26 |
| Yongxin Ge | 3 | 20 | 8.53 |