Random Forests of Local Experts for Pedestrian Detection

Javier Marin, David Vazquez, Antonio M. Lopez, Jaume Amores, Bastian Leibe; The IEEE International Conference on Computer Vision (ICCV), 2013, pp. 2592-2599

Abstract


Pedestrian detection is one of the most challenging tasks in computer vision, and has received a lot of attention in the last years. Recently, some authors have shown the advantages of using combinations of part/patch-based detectors in order to cope with the large variability of poses and the existence of partial occlusions. In this paper, we propose a pedestrian detection method that efficiently combines multiple local experts by means of a Random Forest ensemble. The proposed method works with rich block-based representations such as HOG and LBP, in such a way that the same features are reused by the multiple local experts, so that no extra computational cost is needed with respect to a holistic method. Furthermore, we demonstrate how to integrate the proposed approach with a cascaded architecture in order to achieve not only high accuracy but also an acceptable efficiency. In particular, the resulting detector operates at five frames per second using a laptop machine. We tested the proposed method with well-known challenging datasets such as Caltech, ETH, Daimler, and INRIA. The method proposed in this work consistently ranks among the top performers in all the datasets, being either the best method or having a small difference with the best one.

Related Material


[pdf]
[bibtex]
@InProceedings{Marin_2013_ICCV,
author = {Marin, Javier and Vazquez, David and Lopez, Antonio M. and Amores, Jaume and Leibe, Bastian},
title = {Random Forests of Local Experts for Pedestrian Detection},
booktitle = {The IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}
}