Name
Abstract | ||
|---|---|---|
The performances of biometrics may be adversely impact by different walking states, walking directions, resolutions of gait sequence images, pose variation and low resolution of face images. To address these problems, we presented a kernel coupled distance metric learning (KCDML) method after considering matching among different data collections. By using a kernel trick and a specialized locality preserving criterion, we formulated the problem of kernel coupled distance metric learning as an optimization problem whose aims are to search for the pair-wise samples staying as close as possible and to preserve the local structure intrinsic data geometry. Instead of an iterative solution, one single generalized eigen-decomposition can be leveraged to compute the two transformation matrices for two classifications of data sets. The effectiveness of the proposed method is empirically demonstrated on gait and face recognition tasks' results which outperform four linear subspace solutions' (i.e. CDML, PCA, LPP, LDA) and four nonlinear subspace solutions' (i.e. Huang's method, PCA-RBF, KPCA, KLPP). |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.neucom.2013.04.012 | Neurocomputing |
Keywords | Field | DocType |
Kernel coupled distance metric learning (KCDML),Gait recognition,Face recognition,Different walking states,Variant face pose,Variant resolution | Kernel (linear algebra),Facial recognition system,Subspace topology,Pattern recognition,Metric (mathematics),Linear subspace,Artificial intelligence,Biometrics,Kernel method,Optimization problem,Machine learning,Mathematics | Journal |
Volume | Issue | ISSN |
120 | null | 0925-2312 |
Citations | PageRank | References |
16 | 0.60 | 34 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianye Ben | 1 | 131 | 10.56 |
| Weixiao Meng | 2 | 430 | 54.79 |
| Rui Yan | 3 | 88 | 5.22 |
| Kejun Wang | 4 | 252 | 20.72 |