Face Recognition Using SURF

In recent years, several scale-invariant features have been proposed in literature, this paper analyzes the usage of Speeded Up Robust Features (SURF) as local descriptors, and as we will see, they are not only scale-invariant features, but they also offer the advantage of being computed very efficiently. Furthermore, a fundamental matrix estimation method based on the RANSAC is applied. The proposed approach allows to match faces under partial occlusions, and even if they are not perfectly aligned. Thus based on the above advantages of SURF, we propose to exploit SURF features in face recognition since current approaches are too sensitive to registration errors and usually rely on a very good initial alignment and illumination of the faces to be recognized.

[1]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  S. Tai,et al.  Facial Expression Recognition Using New Feature Extraction Algorithm , 2012 .

[4]  David J. Kriegman,et al.  Acquiring linear subspaces for face recognition under variable lighting , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Jianguo Li,et al.  Learning SURF Cascade for Fast and Accurate Object Detection , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Andy Harter,et al.  Parameterisation of a stochastic model for human face identification , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.

[7]  Robert Laganiere,et al.  OpenCV 2 Computer Vision Application Programming Cookbook , 2011 .

[8]  Rainer Stiefelhagen,et al.  Why Is Facial Occlusion a Challenging Problem? , 2009, ICB.

[9]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..