|Table of Contents|

Face detection based on improved speeded uprobust features algorithm(PDF)


Research Field:
Publishing date:


Face detection based on improved speeded uprobust features algorithm
Hong YangYu Fengqin
School of Internet of Things Engineering,Jiangnan University,Wuxi 214122,China
speeded up robust features face detection image entropy non-maximum suppression Haar wavelet response Fisher vector kernel
An improved speeded up robust features(SURF)algorithm is used in face detection aming at the shortcomings of many redundant information and low computing speed of the SURF algorithm.The image entropy of neighborhood of each feature point is calculated,and the feature points with high image entropy are selected by non-maximum suppression to decrease description area and redundant information.A fan window is used to traverse the neighborhood of each feature point,and Haar wavelet response in the fan window is calculated to form the descriptor of each feature point,and the computing speed is faster.Each descriptor is mapped into a high dimensional space by Fisher vector kernel for face detection.The simulation results in face detection data set and benchmark(FDDB)show that,compared with that of SURF algorithm,the detection rate of the improved SURF algorithm increases by 7.9%,the feature calculation time decreases by 53.1%,and the feature points decreases by 59.7%.


[1] 郭志波,严云洋,杨静宇,等.基于沃尔什特征和增强型Cascade算法的人脸检测[J].南京理工大学学报,2008,32(1):60-64.
Guo Zhibo,Yan Yunyang,Yang Jingyu,et al.Fast face detection based on Walsh feature and enhanced cascade algorithm[J].Journal of Nanjing University of Science and Technology,2008,32(1):60-64.
Zhu Wenjia,Qi Feihu.Fast face detection and facial features localization[J].Journal of Image and Graphics,2006,10(11):1454-1457.
[3]Baumann F,Ehlers A,Vogt K,et al.Cascaded random forest for fast object detection[M].Heidelberg,Berlin,Germany:Springer,2013.
Fan Yan,Yu Dongjun,Song Xiaoning,et al.Face feature extraction approach of projective transition sub-space based on basic function of mirror symmetry[J].Journal of Nanjing University of Science and Technology,2012,36(6):915-918.
Wang Xiaoyu,Zhang Yazhou,Chen Deyun.Face detection based on MB-LBP and eye tracking[J].Chinese Journal of Scientific Instrument,2014,35(12):2739-2745.
[6]Liao Shengcai,Jain A K,Li S Z.A fast and accurate unconstrained face detector[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2016,38(2):211-223.
[7]Ramanan D,Zhu Xiangxin.Face detection,pose estimation and landmark localization in the wild[C]//Computer Vision and Pattern Recognition.Providence,RI,USA:IEEE,2012:2879-2886.
[8]Nilsson M,Nordberg J,Claesson I.Face detection using local SMQT features and split up snow classifier[C]//Acoustics,Speech and Signal Processing.Honolulu,HI,USA:IEEE,2007:II-589-592.
[9]Bay H,Ess A,Tuytelaars T,et al.Speeded-up robust features(SURF)[J].Computer Vision and Image Understanding,2008,110(3):346-359.
[10]Kim D,Dahyot R.Face components detection using SURF descriptors and SVMs[C]//Machine Vision and Image Processing Conference.Portrush,Ireland,UK:IEEE,2008:51-56.
Li Hongbo,Zhao Yongyao,Wu Yu,et al.Improved SURF algorithm based on distance constraint[J].Journal of System Simulation,2014,26(12):2944-2949.
[12]Li Jianguo,Wang Tao,Zhang Yimin.Face detection using surf cascade[C]//Computer Vision Workshops(ICCV Workshops).Barcelona,Spain:IEEE,2011:2183-2190.
[13]Fergus R,Perona P,Zisserman A.Weakly supervised scale-invariant learning of models for visual recognition[J].International Journal of Computer Vision,2007,71(3):273-303.
[14]Leibe B,Leonardis A,Schiele B.Robust object detection with interleaved categorization and segmentation[J].International Journal of Computer Vision,2008,77(1-3):259-289.
[15]Sánchez J,Perronnin F,Mensink T,et al.Image classification with the Fisher vector:Theory and practice[J].International Journal of Computer Vision,2013,105(3):222-245.
[16]Jain V,Learned-Miller E.FDDB:A benchmark for face detection in unconstrained settings[EB/OL].http://vis-www.cs.umass.edu/fddb/index.html#download,2017-10-18.


Last Update: 2017-12-31