arrow
Return

Cascade Learning by Optimally Partitioning

delete2017-12-01
delete30
delete
OA
AI
Y
Yanwei Pang *
J
Jiale Cao
X
Xuelong Li
DOI:10.1109/TCYB.2016.2601438delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Cascaded AdaBoost classifier is a well-known efficient object detection algorithm. The cascade structure has many parameters to be determined. Most of existing cascade learning algorithms are designed by assigning detection rate and false positive rate to each stage either dynamically or statically. Their objective functions are not directly related to minimum computation cost. These algorithms are not guaranteed to have optimal solution in the sense of minimizing computation cost. On the assumption that a strong classifier is given, in this paper, we propose an optimal cascade learning algorithm (iCascade) which iteratively partitions the strong classifiers into two parts until predefined number of stages are generated. iCascade searches the optimal partition point r(i) of each stage by directly minimizing the computation cost of the cascade. Theorems are provided to guarantee the existence of the unique optimal solution. Theorems are also given for the proposed efficient algorithm of searching optimal parameters ri. Once a new stage is added, the parameter ri for each stage decreases gradually as iteration proceeds, which we call decreasing phenomenon. Moreover, with the goal of minimizing computation cost, we develop an effective algorithm for setting the optimal threshold of each stage. In addition, we prove in theory why more new weak classifiers in the current stage are required compared to that of the previous stage. Experimental results on face detection and pedestrian detection demonstrate the effectiveness and efficiency of the proposed algorithm.
Keywords:
AdaBoost
cascade learning
classifier design
object detection
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Cybernetics cover
IEEE Transactions on Cybernetics
IF:
10.5
Papers:
1.1W
Citations:
5.0W

Organization

T
tianjin university
Scholars:
8.0W
Papers: 5.8W
Citations: 88
C
chinese academy of sciences
Scholars:
56.7W
Papers: 45.0W
Citations: 704
Cited Papers

Cited Papers

Allosteric Modulation of Muscarinic Acetylcholine Receptors
err2010-08-30
err0
errOAAI
errJan Jakubík; Esam E. El-Fakahany
errShare
errSave
Distributed Object Detection With Linear SVMs
err2014-11-01
err59
PREAI
errPang, Yanwei; Zhang, Kun; Yuan, Yuan; Wang, Kongqiao
errShare
errSave
Magnetic lower esophageal sphincter augmentation device removal
err2014-08-14
err0
PREAI
errCristina R. Harnsberger; Ryan C. Broderick; Hans F. Fuchs; Martin Berducci; Catherine Beck; Alberto Gallo; Garth R. Jacobsen; Bryan J. Sandler; Santiago Horgan
errShare
errSave
Single-Exciton Amplified Spontaneous Emission in Thin Films of CsPbX3 (X = Br, I) Perovskite Nanocrystals
err2019-09-23
err0
errOAAI
errJuan Navarro-Arenas; Isaac Suárez; Vladimir S. Chirvony; Andrés F. Gualdrón-Reyes; Iván Mora-Seró; Juan Martínez-Pastor
errShare
errSave
RandomBoost: Simplified Multiclass Boosting Through Randomization
err2014-04-01
err7
errOAAI
errPaisitkriangkrai, Sakrapee; Shen, Chunhua; Shi, Qinfeng; van den Hengel, Anton
errShare
errSave
Training Effective Node Classifiers for Cascade Classification
err2013-01-24
err24
PREAI
errShen, Chunhua; Wang, Peng; Paisitkriangkrai, Sakrapee; van den Hengel, Anton
errShare
errSave
researcher View more