Image segmentation with a bounding box prior

Victor Lempitsky, Pushmeet Kohli, Carsten Rother, Toby Sharp

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

307 Citations (Scopus)


User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks tend to exploit the provided bounding box merely to exclude its exterior from consideration and sometimes to initialize the energy minimization. In this paper, we discuss how the bounding box can be further used to impose a powerful topological prior, which prevents the solution from excessive shrinking and ensures that the user-provided box bounds the segmentation in a sufficiently tight way. The prior is expressed using hard constraints incorporated into the global energy minimization framework leading to an NP-hard integer program. We then investigate the possible optimization strategies including linear relaxation as well as a new graph cut algorithm called pinpointing. The latter can be used either as a rounding method for the fractional LP solution, which is provably better than thresholding-based rounding, or as a fast standalone heuristic. We evaluate the proposed algorithms on a publicly available dataset, and demonstrate the practical benefits of the new prior both qualitatively and quantitatively.

Original languageEnglish
Title of host publication2009 IEEE 12th International Conference on Computer Vision, ICCV 2009
Number of pages8
Publication statusPublished - 2009
Externally publishedYes
Event12th International Conference on Computer Vision, ICCV 2009 - Kyoto, Japan
Duration: 29 Sep 20092 Oct 2009

Publication series

NameProceedings of the IEEE International Conference on Computer Vision


Conference12th International Conference on Computer Vision, ICCV 2009


Dive into the research topics of 'Image segmentation with a bounding box prior'. Together they form a unique fingerprint.

Cite this