This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

Feature-Centric Efficient Subwindow Search

Alain Lehmann, Bastian Leibe, and Luc Van Gool
IEEE International Conference on Computer Vision (ICCV)
October 2009


Many object detection systems rely on linear classifiers embedded in a sliding-window scheme. Such exhaustive search involves massive computation. Efficient Subwindow Search (ESS) [11] avoids this by means of branch and bound. However, ESS makes an unfavourable memory tradeoff. Memory usage scales with both image size and overall object model size. This risks becoming prohibitive in a multi-class system. In this paper, we make the connection between sliding-window and Hough-based object detection explicit. Then, we show that the feature-centric view of the latter also nicely fits with the branch and bound paradigm, while it avoids the ESS memory tradeoff. Moreover, on-line integral image calculations are not needed. Both theoretical and quantitative comparisons with the ESS bound are provided, showing that none of this comes at the expense of performance.

Download in pdf format
  author = {Alain Lehmann and Bastian Leibe and and Luc Van Gool},
  title = {Feature-Centric Efficient Subwindow Search},
  booktitle = {IEEE International Conference on Computer Vision (ICCV)},
  year = {2009},
  month = {October},
  keywords = {}