Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Effective algorithms for subwindow search in object detection and localization

    133817_133817.pdf (452.1Kb)
    Access Status
    Open access
    Authors
    An, Senjian
    Peursum, Patrick
    Liu, Wan-quan
    Venkatesh, Svetha
    Date
    2009
    Type
    Conference Paper
    
    Metadata
    Show full item record
    Citation
    An, Senjian and Peursum, Patrick and Liu, Wan-quan and Venkatesh, Svetha. 2009. Effective algorithms for subwindow search in object detection and localization, in Huttenlocher and Medioni and Rehg (ed), CVPR 2009, Jun 20 2009, pp. 264-271.Miami,FL,USA: IEEE Computer society.
    Source Title
    2009 IEEE Conference on computer vision and pattern recognition
    Source Conference
    CVPR 2009
    Additional URLs
    http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5206822&tag=1
    ISBN
    9781424439928
    Faculty
    School of Science and Computing
    Department of Computing
    Faculty of Science and Engineering
    Remarks

    Copyright © 2009 IEEE 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.

    URI
    http://hdl.handle.net/20.500.11937/15717
    Collection
    • Curtin Research Publications
    Abstract

    Recently, a simple yet powerful branch-and-bound method called Efficient Subwindow Search (ESS) was developed to speed up sliding window search in object detection. A major drawback of ESS is that its computational complexity varies widely from O(n2) to O(n4) form matrices. Our experimental experience shows that the ESS's performance is highly related to the optimal confidence levels which indicate the probability of the object's presence. In particular, when the object is not in the image, the optimal subwindow scores low and ESS may take a large amount of iterations to converge to the optimal solution and so perform very slow. Addressing this problem, we present two significantly faster methods based on the linear-time Kadane's Algorithm for 1D maximum subarray search. The first algorithm is a novel, computationally superior branch-and-bound method where the worst case complexity is reduced to O(n3). Experiments on the PASCAL VOC 2006 data set demonstrate that this method is significantly and consistently faster (approximately 30 times faster on average) than the original ESS. Our second algorithm is an approximate algorithm based on alternating search, whose computational complexity is typically O(n2). Experiments shows that (on average) it is 30 times faster again than our first algorithm, or 900 times faster than ESS. It is thus well suited for real time object detection.

    Related items

    Showing items related by title, author, creator and subject.

    • Efficient algorithms for subwindow search in object detection and localization
      An, S.; Peursum, P.; Liu, Wan-Quan; Venkatesh, S. (2009)
      Recently, a simple yet powerful branch-and-bound method called Efficient Subwindow Search (ESS) was developed to speed up sliding window search in object detection. A major drawback of ESS is that its computational ...
    • Optimisation of large scale network problems
      Grigoleit, Mark Ted (2008)
      The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
    • Improving the relevance of web search results by combining web snippet categorization, clustering and personalization
      Zhu, Dengya (2010)
      Web search results are far from perfect due to the polysemous and synonymous characteristics of nature languages, information overload as the results of information explosion on the Web, and the flat list, “one size fits ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.