2013
DOI: 10.1109/tpami.2013.38
|View full text |Cite
|
Sign up to set email alerts
|

A Scalable Formulation of Probabilistic Linear Discriminant Analysis: Applied to Face Recognition

Abstract: Abstract-In this paper, we present a scalable and exact solution for probabilistic linear discriminant analysis (PLDA). PLDA is a probabilistic model that has been shown to provide stateof-the-art performance for both face and speaker recognition. However, it has one major drawback: At training time estimating the latent variables requires the inversion and storage of a matrix whose size grows quadratically with the number of samples for the identity (class). To date, two approaches have been taken to deal wit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
52
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 63 publications
(52 citation statements)
references
References 13 publications
0
52
0
Order By: Relevance
“…All the FR systems studied here have been tested within the same software framework. 5 Website: www.idiap.ch/software/bob/…”
Section: A Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…All the FR systems studied here have been tested within the same software framework. 5 Website: www.idiap.ch/software/bob/…”
Section: A Methodologymentioning
confidence: 99%
“…The first generation of large scale appearance based FR systems, such as Eigenfaces [1] and Fisherfaces [2], attempted to model the face-variability in a simple linear sub-space. Subsequently, methods such as joint factor analysis (JFA), inter-session variability (ISV) modeling [3] and probabilistic linear discriminant analysis (PLDA) [4,5] were developed to better model variability in face-images. Deep-learning based methods, notably convolutional neural networks (CNN) [6,7,8,9], have become very popular in recent years, due to their near-perfect recognition accuracy on unconstrained datasets such as 'labeled faces in the wild' (LFW) [10].…”
Section: Introductionmentioning
confidence: 99%
“…Performance of i-vector averaging and multi-session scoring is also studied in , whereas (Yaman and Pelecanos, 2013) includes a comparison of score-averaging and multi-session scoring. In the context of face recognition, a scalable formulation of PLDA is described in detail in (El Shafey et al, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…In [14], the authors utilize a special matrix structure of PLDA model and manually derive equations for the required matrix inversions. In [15], the authors proposed a special change of variables that lead to a diagonalized versions of the required matrices. The most detailed derivations are given in [16].…”
Section: Em-algorithmsmentioning
confidence: 99%