Efficient algorithms for subwindow search in object detection and localization
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) for n × n matrices. Our experimental exp...
| Main Authors: | , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/20.500.11937/34590 |