Issue No. 07 - July (2013 vol. 35)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.38
L. El Shafey , Idiap Res. Inst., Ecole Polytech. Fed. de Lausanne, Martigny, Switzerland
C. McCool , Idiap Res. Inst., Martigny, Switzerland
R. Wallace , Idiap Res. Inst., Martigny, Switzerland
S. Marcel , Idiap Res. Inst., Martigny, Switzerland
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.
Training, Computational modeling, Complexity theory, Probabilistic logic, Approximation methods, Mathematical model, Face
L. El Shafey, C. McCool, R. Wallace and S. Marcel, "A Scalable Formulation of Probabilistic Linear Discriminant Analysis: Applied to Face Recognition," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 35, no. 7, pp. 1788-1794, 2013.