SubmodBoxes: Near-Optimal Search for a Set of Diverse Object Proposals

This paper formulates the search for a set of bounding boxes (as needed in object proposal generation) as a monotone submodular maximization problem over the space of all possible bounding boxes in an image.