Academic
Publications
Efficient algorithms for subwindow search in object detection and localization

Efficient algorithms for subwindow search in object detection and localization,10.1109/CVPRW.2009.5206822,Senjian An,Patrick Peursum,Wanquan Liu,Sveth

Efficient algorithms for subwindow search in object detection and localization   (Citations: 9)
BibTex | RIS | RefWorks Download
Abstract Recently, a simple yet powerful branch-and-bound method,called Efficient Subwindow,Search (ESS) was de- veloped to speed up sliding window,search in object de- tection. A major,drawback,of ESS is that its computa- tional complexity varies widely from O(n,). 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.
Conference: Computer Vision and Pattern Recognition - CVPR , pp. 264-271, 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...After the development of the branch and bound (B&B) method called Efficient Subwindow Search (ESS), several algorithms (IESS [2], AESS [2], ARCS [3]) have been proposed to improve the performance of ESS...
    • ...After the development of the branch and bound (B&B) method called Efficient Subwindow Search (ESS), several algorithms (IESS [2], AESS [2], ARCS [3]) have been proposed to improve the performance of ESS...
    • ...Related works include Efficient Subwindow Search (ESS) [9, 10], the improved ESS (IESS)[2] and the alternating optimization methods: A-ESS [2] for linear score functions and ARCS [3] for certain nonlinear score functions...
    • ...Related works include Efficient Subwindow Search (ESS) [9, 10], the improved ESS (IESS)[2] and the alternating optimization methods: A-ESS [2] for linear score functions and ARCS [3] for certain nonlinear score functions...
    • ...Alternating optimization methods are used to speed up subwindow search in [2] for linear score functions and in [3] for some special types of nonlinear score functions...
    • ...Following the idea of IESS in [2] for linear score functions, we intend to develop a sub-cubic approach by applying B&B on the row interval only...
    • ...The splitting procedure is the same as that of IESS [2] which is only applicable to linear score functions...
    • ...The branch bound is much more complex than the linear case in [2]...

    Senjian Anet al. Efficient subwindow search with submodular score functions

    • ...The popular ESS algorithm [1,16] improves the sliding window search by a brunch and bound scheme, it keeps an upper bound of a set of rectangles and ignores the invalid search for the rectangles with upper bound lower than a threshold...

    Dawei Tanget al. Localizing artistic objects in frescos through contour based features

    • ...In recently years, it has been shown be to an efficient technique for object detection in images and action detection in videos [8], [1], [22]...

    Liangliang Caoet al. Cross-dataset action detection

    • ...An et al. (2009) combine this dynamic programming technique with ESS’s branch and bound...

    Alain Lehmannet al. Fast PRISM: Branch and Bound Hough Transform for Object Class Detectio...

    • ...Branch-and-bound Such methods [5, 19, 4] find the global optimal window in sub-linear time by iterating between: 1) branching the parameter space into sub-regions and; 2) bounding the objective function over those regions...
    • ...2 It has been shown in [19] that the worst complexity can be improved for a specific objective function...

    Yichen Weiet al. Efficient histogram-based sliding window

Sort by: