Face Detection a Survey - ICGST：人脸检测- icgst.pptVIP

* * * * * * * * * In general simple classifiers, while they are more efficient, they are also weaker. We could define a computational risk hierarchy (in analogy with structural risk minimization)… A nested set of classifier classes The training process is reminiscent of boosting… - previous classifiers reweight the examples used to train subsequent classifiers The goal of the training process is different - instead of minimizing errors minimize false positives * Eigenfaces PCA extracts the eigenvectors of A Gives a set of vectors v1, v2, v3, ... Each vector is a direction in face space what do these look like? Projecting onto the eigenfaces The eigenfaces v1, ..., vK span the space of faces A face is converted to eigenface coordinates by Recognition with eigenfaces Algorithm Process the image database (set of images with labels) Run PCA—compute eigenfaces Calculate the K coefficients for each image Given a new image (to be recognized) x, calculate K coefficients Detect if x is a face If it is a face, who is it? Find closest labeled face in database nearest-neighbor in K-dimensional space Choosing the dimension K How many eigenfaces to use? Look at the decay of the eigenvalues the eigenvalue tells you the amount of variance “in the direction” of that eigenface ignore eigenfaces with low variance K NM i = eigenvalues View-Based and Modular Eigenspaces for Face Recognition Part-based eigenfeatures Learn a separateeigenspace for eachface feature Boosts performanceof regulareigenfaces Bayesian Face Recognition Bayesian Face Recognition Bayesian Face Recognition Bayesian Face Recognition Morphable Face Models Morphable Face Model Use subspace to model elastic 2D or 3D shape variation (vertex positions), in addition to appearance variation Shape S Appearance T Morphable Face Model 3D models from Blanz and Vetter ‘99 Face Recognition Resources Face Recognition Home Page: http://www.cs.rug.nl/~peterkr/FACE/face.html P