Achieving Anonymity against Major Face Recognition Algorithms
This short paper updates results presented in two previous publications, “ A Nonparametric Statistical Comparison of Principal Component and Linear Discriminant Subspaces for Face Recognition” presented at CVPR 2001 and “Parametric and Nonparametric Methods for the Statistical Evaluation of Human ID Algorithms” presented at the Workshop on the Empirical Evaluation of Computer Vision Algorithms held in conjunction with CVPR 2001. The update reflects changes in the measured performance of our PCA+LDA algorithm following refinements to the numerical precision used to determine the PCA+LDA subspace. The new results show improved performance of the PCA+LDA algorithm relative to PCA algorithm. Where as before, PCA+LDA was clearly inferior to PCA alone, PCA still appears to have a slight edge for this test, but the difference is no longer statistically significant as measured by the methodology laid out in the previous papers. This paper is not intended to be read alone, but instead after the papers cited above. Likewise, those who read the papers above should read this paper to get an improved picture of how the PCA+LDA algorithm performs.