Procedings of the British Machine Vision Conference 2001 2001
DOI: 10.5244/c.15.63
|View full text |Cite
|
Sign up to set email alerts
|

Recognising Trajectories of Facial Identities Using Kernel Discriminant Analysis

Abstract: We present a comprehensive approach to address three challenging problems in face recognition: modelling faces across multi-views, extracting the non-linear discriminating features, and recognising moving faces dynamically in image sequences. A multi-view dynamic face model is designed to extract the shape-and-pose-free facial texture patterns. Kernel Discriminant Analysis, which employs the kernel technique to perform Linear Discriminant Analysis in a high-dimensional feature space, is developed to extract th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2002
2002
2017
2017

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(17 citation statements)
references
References 17 publications
(7 reference statements)
0
17
0
Order By: Relevance
“…Better results obtained by kernel subspace methods have been reported over conventional subspace methods in various vision applications (e.g. [10][11][12]). One of the most relevant work to ours is in [12] where the authors explore the application of KDA to frontal face detection and promising experimental results are reported.…”
Section: Introductionmentioning
confidence: 99%
“…Better results obtained by kernel subspace methods have been reported over conventional subspace methods in various vision applications (e.g. [10][11][12]). One of the most relevant work to ours is in [12] where the authors explore the application of KDA to frontal face detection and promising experimental results are reported.…”
Section: Introductionmentioning
confidence: 99%
“…Li et al [74,73,72,75] proposed to model facial dynamics by constructing facial identity structures across views and over time, referred to identity surfaces (shown in Fig. 3), in the Kernel Discriminant Analysis feature space.…”
Section: Temporal Model Based Approachesmentioning
confidence: 99%
“…Method Key-frame based Approaches [90], [40], [47], [114], [100], [17], [115], [31], [78], [85], [98], [101], [118] Temporal Model based Approaches [74], [73], [72], [75], [18], [24], [67], [69], [68], [122], [120], [123], [121], [64], [65], [66], [79], [55], [2], [43], [50], [49] Image-Set Matching based Approaches Statistical model-based [93], [4], [96], [7], [10], [6], [9] Mutual subspace-based [110], [90], [35], [82], [108], [56], [57], [5]<...>…”
Section: Categorymentioning
confidence: 99%
“…2 outline this algorithm. To get a comprehensive view of the underlying data structure, we study four popular subspaces so that the best subspace descriptors can be found: Principle Component Analysis (PCA) [18]; Kernel Principle Component Analysis (KPCA) [19]; Multiple class Discriminant Analysis (MDA) [18] and Kernel Discriminant Analysis (KDA) [20,21]. Results show that analysis in the kernel space can provide a better performance.…”
Section: Algorithm Frameworkmentioning
confidence: 99%
“…This inspires the use of kernel machine, which explores the non-linearity of the data space. The extended nonlinear alternative, KPCA [19,23] and KDA [20], are used.…”
Section: Subspace Projectionmentioning
confidence: 99%