Title
Bayesian learning of a search region for pedestrian detection
Abstract
An efficient pedestrian detection method is proposed for intelligent vehicles in this paper. The proposed method learns the region in which pedestrians are likely to be detected and narrows down the search to the likely region. The likely region is modeled as a Gaussian distribution on the y-axis and its parameters are updated by a Bayesian approach. Thus, the proposed method starts with an exhaustive full search, but gradually narrows down the search by focusing on the likely region. The learning of the likely region is formulated as a Bayesian learning problem and the likely region is analytically derived. The proposed method is combined with two popular pedestrian detection methods, Haar-like Adaboost and HOG-LSVM, and some experiments are conducted with the Caltech pedestrian dataset. The experiments show that the proposed method not only reduces computation time, but also enhances performance by rejecting false positive results.
Year
DOI
Venue
2016
10.1007/s11042-014-2329-z
Multimedia Tools and Applications
Keywords
Field
DocType
Pedestrian detection,Sliding window approach,HOG-LSVM,Haar-like Adaboost,Bayesian inference,Caltech pedestrian dataset
Pedestrian,AdaBoost,Bayesian inference,Pattern recognition,Computer science,Gaussian,Artificial intelligence,Pedestrian detection,Machine learning,Bayesian probability,Computation
Journal
Volume
Issue
ISSN
75
2
1380-7501
Citations 
PageRank 
References 
1
0.38
17
Authors
4
Name
Order
Citations
PageRank
Jeonghyun Baek1265.31
Sungjun Hong2475.58
Jisu Kim321128.11
Euntai Kim41472109.36