In this paper, an efficient algorithm for facial feature detection is presented. Complex regions in a face image, such as the eye, exhibit unpredictable local intensity and hence high entropy. We use this characteristic to obtain eye candidates, and then these candidates are sent to a SVM classifier to get real eyes. According to the geometry relationship of human face, mouth search region is specified by the coordinates of the left eye and the right eye. And then precise mouth detection is done. Experimental results demonstrate the effectiveness of the proposed method. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Wang, Q., Zhao, C., & Yang, J. (2008). Efficient facial feature detection using entropy and svm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5358 LNCS, pp. 763–771). https://doi.org/10.1007/978-3-540-89639-5_73
Mendeley helps you to discover research relevant for your work.