RIGOR:  Recycling Inference in Graph Cuts for generating Object Regions
Popular figure-ground segmentation algorithms generate a pool of boundary-aligned segment proposals that can be used in subsequent object recognition engines. These algorithms can recover most image objects with high accuracy, but are usually computationally intensive since many graph cuts are computed with different enumerations of segment seeds. In this paper we propose an algorithm, RIGOR, for efficiently generating a pool of overlapping segment proposals in images. By precomputing a graph which can be used for parametric min-cuts over different seeds, we speed up the generation of the segment pool. In addition, we have made design choices that avoid extensive computations without losing performance. In particular, we demonstrate that the segmentation performance of our algorithm is slightly better than the state-of-the-art on the PASCAL VOC dataset, while being an order of magnitude faster.

Ahmad Humayun, Fuxin Li, and James M. Rehg. RIGOR: Recycling Inference in Graph Cuts for generating Object Regions. IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2014.

PDF  |  Presentation  |  Poster  |  BibTeX

Code Ver 1.01
Download  |  Instructions

This work was supported in part by NSF grants IIS 1016772 and IIS 1320348.
The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without explicit permission of the copyright holder.