Classification Modulo Invariance, With Application to Face Recognition

Andrew M Fraser, Nicolas W Hengartner, Kevin R Vixie, Brendt E Wohlberg
2003 Journal of Computational And Graphical Statistics  
We present techniques for constructing classifiers that combine statistical information from training data with tangent approximations to known transformations, and we demonstrate the techniques by applying them to a face recognition task. Our approach is to build Bayes classifiers with approximate class-conditional probability densities for measured data. The high dimension of the measurements in modern classification problems such as speech or image recognition makes inferring probability
more » ... ing probability densities from feasibly sized training data sets difficult. We address the difficulty by imposing severely simplifying assumptions and exploiting a priori information about transformations to which classification should be invariant. For the face recognition task, we used a five parameter group of such transformations consisting of rotation, shifts, and scalings. On the face recognition task, a classifier based on our techniques has an error rate that is 20% lower than that of the best algorithm in a reference software distribution. K θ4,θ4 = −2vK 2 + v 2 K 2,2 K θ4,θ5 = vK 1 − uK 2 + (uv − v 2 )K 1,2 + uvK 2,2 K θ5,θ5 = uK 1 + vK If we use a Gaussian kernel K(s, t) ≡
doi:10.1198/1061860032634 fatcat:z62ta5penze4pj77yswzusakfi