We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Making a Shallow Network Deep: Conversion of a Boosting Classifier into a Decision Tree by Boolean Optimisation.
- Authors
Kim, Tae-Kyun; Budvytis, Ignas; Cipolla, Roberto
- Abstract
This paper presents a novel way to speed up the evaluation time of a boosting classifier. We make a shallow (flat) network deep (hierarchical) by growing a tree from decision regions of a given boosting classifier. The tree provides many short paths for speeding up while preserving the reasonably smooth decision regions of the boosting classifier for good generalisation. For converting a boosting classifier into a decision tree, we formulate a Boolean optimisation problem, which has been previously studied for circuit design but limited to a small number of binary variables. In this work, a novel optimisation method is proposed for, firstly, several tens of variables i.e. weak-learners of a boosting classifier, and then any larger number of weak-learners by using a two-stage cascade. Experiments on the synthetic and face image data sets show that the obtained tree achieves a significant speed up both over a standard boosting classifier and the Fast-exit-a previously described method for speeding-up boosting classification, at the same accuracy. The proposed method as a general meta-algorithm is also useful for a boosting cascade, where it speeds up individual stage classifiers by different gains. The proposed method is further demonstrated for fast-moving object tracking and segmentation problems.
- Subjects
BOOSTING algorithms; DECISION trees; BOOLEAN functions; IMAGE segmentation; PIXELS
- Publication
International Journal of Computer Vision, 2012, Vol 100, Issue 2, p203
- ISSN
0920-5691
- Publication type
Article
- DOI
10.1007/s11263-011-0461-z