Efficient subwindow search with submodular score functions
Subwindow search aims to find the optimal subimage which maximizes the score function of an object to be detected. After the development of the branch and bound (B&B) method called Efficient Subwindow Search (ESS), several algorithms (IESS, AESS, ARCS) have been proposed to improve the performan...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE
2011
|
| Online Access: | http://hdl.handle.net/20.500.11937/10983 |