Location of Repository

An Efficient Divide-and-Conquer Cascade for Nonlinear Object Detection

By Christoph H. Lampert

Abstract

We introduce a method to accelerate the evaluation of object detection cascades with the help of a divide-andconquer procedure in the space of candidate regions. Compared to the exhaustive procedure that thus far is the stateof-the-art for cascade evaluation, the proposed method requires fewer evaluations of the classifier functions, thereby speeding up the search. Furthermore, we show how the recently developed efficient subwindow search (ESS) procedure [11] can be integrated into the last stage of our method. This allows us to use our method to act not only as a faster procedure for cascade evaluation, but also as a tool to perform efficient branch-and-bound object detection with nonlinear quality functions, in particular kernelized support vector machines. Experiments on the PASCAL VOC 2006 dataset show an acceleration of more than 50% by our method compared to standard cascade evaluation. 1

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.173.173
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.kyb.tuebingen.mpg.d... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.