Incorporating Computation Time Measures during Heterogeneous Features Selection in a Boosted Cascade People Detector - Université Toulouse 1 Capitole Accéder directement au contenu
Article Dans Une Revue International Journal of Pattern Recognition and Artificial Intelligence Année : 2016

Incorporating Computation Time Measures during Heterogeneous Features Selection in a Boosted Cascade People Detector

Résumé

In this paper, we investigate the notion of incorporating feature computation time measures during feature selection in a boosted cascade people detector utilizing heterogeneous pool of features. We present various approaches based on pareto-front analysis, computation time weighted Adaboost, and Binary Integer Programming (BIP) with comparative evaluations. The novel feature selection method proposed based on BIP – the main contribution – mines heterogeneous features taking both detection performance and computation time explicitly into consideration. The results demonstrate that the detector using this feature selection scheme exhibits low miss rates with significant boost in frame rate. For example, it achieves a 2.6% less miss rate at 10e−4 FPPW compared to Dalal and Triggs HOG detector with a 9.22x speed improvement. The presented extensive experimental results clearly highlight the improvements the proposed framework brings to the table.
Fichier principal
Vignette du fichier
ijprai_Mekonnen_v2.pdf (6.43 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01300472 , version 1 (11-04-2016)

Identifiants

Citer

Alhayat Ali Mekonnen, Frédéric Lerasle, Ariane Herbulot, Cyril Briand. Incorporating Computation Time Measures during Heterogeneous Features Selection in a Boosted Cascade People Detector. International Journal of Pattern Recognition and Artificial Intelligence, 2016, 30 (8), pp.1655022. ⟨10.1142/S0218001416550223⟩. ⟨hal-01300472⟩
196 Consultations
134 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More