Multiscale Combinatorial Grouping

Pablo Arbeláez, Jordi Pont-Tuset, Jon Barron, Ferran Marqués, Jitendra Malik

2014 · 1.2K citations · 26 references

DOIFull text

Open access

Concepts

TL;DR

The authors introduce Multiscale Combinatorial Grouping (MCG), a unified method for bottom‑up hierarchical image segmentation and object candidate generation. MCG employs a fast normalized‑cuts algorithm, a high‑performance hierarchical segmenter that leverages multiscale information, and a combinatorial grouping strategy that efficiently merges multiscale regions into accurate object candidates. Experiments on BSDS500 and PASCAL 2012 demonstrate that MCG achieves state‑of‑the‑art performance in contours, hierarchical regions, and object candidate quality.

Abstract

We propose a unified approach for bottom-up hierarchical image segmentation and object candidate generation for recognition, called Multiscale Combinatorial Grouping (MCG). For this purpose, we first develop a fast normalized cuts algorithm. We then propose a high-performance hierarchical segmenter that makes effective use of multiscale information. Finally, we propose a grouping strategy that combines our multiscale regions into highly-accurate object candidates by exploring efficiently their combinatorial space. We conduct extensive experiments on both the BSDS500 and on the PASCAL 2012 segmentation datasets, showing that MCG produces state-of-the-art contours, hierarchical regions and object candidates.

References

26