Evidential combination of pedestrian detectors
In Proceedings British Machine Vision Conference 2014
http://dx.doi.org/10.5244/C.28.2
Abstract
The importance of pedestrian detection in many applications has led to the development of many algorithms. In this paper, we address the problem of combining the outputs of several detectors. A pre-trained pedestrian detector is seen as a black box returning a set of bounding boxes with associated scores. A calibration step is first conducted to transform those scores into a probability measure. The bounding boxes are then grouped into clusters and their scores are combined. Different combination strategies using the theory of belief functions are proposed and compared to probabilistic ones. A combination rule based on triangular norms is used to deal with dependencies among detectors. More than 30 state-of-the-art detectors were combined and tested on the Caltech Pedestrian Detection Benchmark. The best combination strategy outperforms the currently best performing detector by 9% in terms of log-average miss rate.
Session
Person Detection and Identification
Files
Extended Abstract (PDF, 1 page, 139K)Paper (PDF, 14 pages, 1.6M)
Bibtex File
Presentation
Citation
Philippe Xu, Franck Davoine, and Thierry Denoeux. Evidential combination of pedestrian detectors. Proceedings of the British Machine Vision Conference. BMVA Press, September 2014.
BibTex
@inproceedings{BMVC.28.2
title = {Evidential combination of pedestrian detectors},
author = {Xu, Philippe and Davoine, Franck and Denoeux, Thierry},
year = {2014},
booktitle = {Proceedings of the British Machine Vision Conference},
publisher = {BMVA Press},
editors = {Valstar, Michel and French, Andrew and Pridmore, Tony}
doi = { http://dx.doi.org/10.5244/C.28.2 }
}