Return
Kernel discriminant transformation for image set-based face recognition
DOI:10.1016/j.patcog.2011.02.011.png)
Abstract
En 中文
This study presents a novel kernel discriminant transformation (KDT) algorithm for face recognition based on image sets. As each image set is represented by a kernel subspace, we formulate a KDT matrix that maximizes the similarities of within-kernel subspaces, and simultaneously minimizes those of between-kernel subspaces. Although the KDT matrix cannot be computed explicitly in a high-dimensional feature space, we propose an iterative kernel discriminant transformation algorithm to solve the matrix in an implicit way. Another perspective of similarity measure, namely canonical difference, is also addressed for matching each pair of the kernel subspaces, and employed to simplify the formulation. The proposed face recognition system is demonstrated to outperform existing still-image-based as well as image set-based face recognition methods using the Yale Face database B, Labeled Faces in the Wild and a self-compiled database. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Subspace method
Canonical correlation
Kernel discriminant analysis
Face recognition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
NMR quantification of diffusional exchange in cell suspensions with relaxation rate differences between intra and extracellular compartments
PLOS ONE
IF0
Nuclear magnetic resonance investigation of the helix to random coil transformation in poly‐α‐amino acids. I. Poly‐L‐alanine
Biopolymers
IF0
Subspace distance analysis with application to adaptive Bayesian algorithm for face recognition
PATTERN RECOGNITION
IF7.6

