Efficient algorithms for subwindow search in object detection and localization
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.