Efficient Face Detection by a Cascaded Support Vector Machine Using Haar-Like Features
In this paper, we present a novel method for reducing the computational complexity of a Support Vector Machine (SVM) classifier without significant loss of accuracy. We apply this algorithm to the problem of face detection in images. To achieve high run-time efficiency, the complexity of the classifier is made dependent on the input image patch by use of a Cascaded Reduced Set Vector expansion of the SVM. The novelty of the algorithm is that the Reduced Set Vectors have a Haar-like structure enabling a very fast SVM kernel evaluation by use of the Integral Image. It is shown in the experiments that this novel algorithm provides, for a comparable accuracy, a 200 fold speed-up over the SVM and an 6 fold speed-up over the Cascaded Reduced Set Vector Machine.
KeywordsSupport Vector Machine Input Image Face Detection Image Patch Integral Image
Unable to display preview. Download preview PDF.
- 3.Romdhani, S., Torr, P., Schölkopf, B., Blake, A.: Computationally efficient face detection. In: Proceedings of the 8th International Conference on Computer Vision (July 2001)Google Scholar
- 6.Viola, P., Jones, M.: Robust real-time object detection. International Journal of Computer Vision (2002)Google Scholar