Design of coupled strong classifiers in AdaBoost framework and its application to pedestrian detection

被引:19
作者
Kong, Kang-Kook [1 ]
Hong, Ki-Sang [1 ]
机构
[1] POSTECH, Image Informat Proc Lab, Pohang 790784, South Korea
基金
新加坡国家研究基金会;
关键词
AdaBoost; Coupled strong classifier; Complementarity; Pedestrian detection;
D O I
10.1016/j.patrec.2015.07.043
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the AdaBoost framework, a strong classifier consists of weak classifiers connected sequentially. Usually the detection performance of the strong classifier can be improved increasing the number of weak classifiers used, but the improvement is asymptotic. To achieve further improvement we propose coupled strong classifiers (CSCs) which consist of multiple strong classifiers connected in parallel. Complementarity between the classifiers is considered for reducing intra- and inter-classifier correlations of exponential loss of weak classifiers in the training phase, and dynamic programming is used during the testing phase to compute efficiently the final object score for the coupled classifiers. In addition to CSC concept, we also propose using Aggregated Channel Comparison Features (ACCFs) that take the difference of feature values of Aggregated Channel Features (ACFs), enabling significant performance improvement. To show the effectiveness of our CSC concept, we apply our algorithm to pedestrian detection. Experiments are conducted using four well-known benchmark datasets based on ACFs, ACCFs, and Locally Decorrelated Channel Features (LDCFs). The experimental results show that our CSCs give better performance than the conventional single strong classifier for all cases of ACFs, ACCFs, and LDCFs. Especially our CSCs combined with ACCFs improve the detection performance significantly over ACE detector, and its performance is comparable to those of the state-of-the-art algorithms while using the simple ACE-based features. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:63 / 69
页数:7
相关论文
共 32 条
[1]  
[Anonymous], 2014, P 27 INT C NEURAL IN
[2]  
[Anonymous], FAST FEATURE PYRAMID
[3]  
[Anonymous], P WORKSH FAC REAL LI
[4]  
[Anonymous], 2006, Pattern recognition and machine learning
[5]  
[Anonymous], CALTECH PEDESTRIAN D
[6]   Ten Years of Pedestrian Detection, What Have We Learned? [J].
Benenson, Rodrigo ;
Omran, Mohamed ;
Hosang, Jan ;
Schiele, Bernt .
COMPUTER VISION - ECCV 2014 WORKSHOPS, PT II, 2015, 8926 :613-627
[7]   Seeking the strongest rigid detector [J].
Benenson, Rodrigo ;
Mathias, Markus ;
Tuytelaars, Tinne ;
Van Gool, Luc .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, :3666-3673
[8]  
Benenson R, 2012, PROC CVPR IEEE, P2903, DOI 10.1109/CVPR.2012.6248017
[9]   BRIEF: Binary Robust Independent Elementary Features [J].
Calonder, Michael ;
Lepetit, Vincent ;
Strecha, Christoph ;
Fua, Pascal .
COMPUTER VISION-ECCV 2010, PT IV, 2010, 6314 :778-792
[10]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893