Efficient subwindow search: A branch and bound framework for object localization

C. Lampert, M. Blaschko, T. Hofmann, IEEE Transactions on Pattern Analysis and Machine Intelligence 31 (2009) 2129–2142.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Author
; ;
Abstract
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location. To estimate the object‘s location, one can take a sliding window approach, but this strongly increases the computational cost because the classifier or similarity function has to be evaluated over a large set of candidate subwindows. In this paper, we propose a simple yet powerful branch and bound scheme that allows efficient maximization of a large class of quality functions over all possible subimages. It converges to a globally optimal solution typically in linear or even sublinear time, in contrast to the quadratic scaling of exhaustive or sliding window search. We show how our method is applicable to different object detection and image retrieval scenarios. The achieved speedup allows the use of classifiers for localization that formerly were considered too slow for this task, such as SVMs with a spatial pyramid kernel or nearest-neighbor classifiers based on the chi^2 distance. We demonstrate state-of-the-art localization performance of the resulting systems on the UIUC Cars data set, the PASCAL VOC 2006 data set, and in the PASCAL VOC 2007 competition.
Publishing Year
Date Published
2009-12-01
Journal Title
IEEE Transactions on Pattern Analysis and Machine Intelligence
Acknowledgement
This work was funded in part by the EU projects CLASS, IST 027978, and PerAct, EST 504321.
Volume
31
Issue
12
Page
2129 - 2142
IST-REx-ID

Cite this

Lampert C, Blaschko M, Hofmann T. Efficient subwindow search: A branch and bound framework for object localization. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2009;31(12):2129-2142. doi:10.1109/TPAMI.2009.144
Lampert, C., Blaschko, M., & Hofmann, T. (2009). Efficient subwindow search: A branch and bound framework for object localization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12), 2129–2142. https://doi.org/10.1109/TPAMI.2009.144
Lampert, Christoph, Matthew Blaschko, and Thomas Hofmann. “Efficient Subwindow Search: A Branch and Bound Framework for Object Localization.” IEEE Transactions on Pattern Analysis and Machine Intelligence 31, no. 12 (2009): 2129–42. https://doi.org/10.1109/TPAMI.2009.144.
C. Lampert, M. Blaschko, and T. Hofmann, “Efficient subwindow search: A branch and bound framework for object localization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2129–2142, 2009.
Lampert C, Blaschko M, Hofmann T. 2009. Efficient subwindow search: A branch and bound framework for object localization. IEEE Transactions on Pattern Analysis and Machine Intelligence. 31(12), 2129–2142.
Lampert, Christoph, et al. “Efficient Subwindow Search: A Branch and Bound Framework for Object Localization.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, IEEE, 2009, pp. 2129–42, doi:10.1109/TPAMI.2009.144.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar