A Scalable Formulation of Probabilistic Linear Discriminant Analysis: Applied to Face Recognition
- 14 February 2013
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 35 (7), 1788-1794
- https://doi.org/10.1109/tpami.2013.38
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 state-of-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 with this problem, to 1) use an exact solution that calculates this large matrix and is obviously not scalable with the number of samples or 2) derive a variational approximation to the problem. We present a scalable derivation which is theoretically equivalent to the previous nonscalable solution and thus obviates the need for a variational approximation. Experimentally, we demonstrate the efficacy of our approach in two ways. First, on labeled faces in the wild, we illustrate the equivalence of our scalable implementation with previously published work. Second, on the large Multi-PIE database, we illustrate the gain in performance when using more training samples per identity (class), which is made possible by the proposed scalable formulation of PLDA.Keywords
This publication has 12 references indexed in Scilit:
- Probabilistic Models for Inference about IdentityIEEE Transactions on Pattern Analysis and Machine Intelligence, 2011
- Probabilistic Methods for Face Registration and RecognitionPublished by IGI Global ,2010
- Multi-PIEImage and Vision Computing, 2010
- Is that you? Metric learning approaches for face identificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Face Identification by SIFT-based Complete Graph TopologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Face Description with Local Binary Patterns: Application to Face RecognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- The BANCA Database and Evaluation ProtocolLecture Notes in Computer Science, 2003
- Multiresolution gray-scale and rotation invariant texture classification with local binary patternsIeee Transactions On Pattern Analysis and Machine Intelligence, 2002
- Eigenfaces vs. Fisherfaces: recognition using class specific linear projectionIeee Transactions On Pattern Analysis and Machine Intelligence, 1997
- Eigenfaces for RecognitionJournal of Cognitive Neuroscience, 1991