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.

Keywords

Computer sciencePascal (unit)SegmentationArtificial intelligenceImage segmentationPattern recognition (psychology)Object (grammar)

Affiliated Institutions

Related Publications

Normalized cuts and image segmentation

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach...

2000 IEEE Transactions on Pattern Analysis... 15440 citations

Publication Info

Year
2014
Type
article
Citations
1202
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

1202
OpenAlex

Cite This

Pablo Arbeláez, Jordi Pont-Tuset, Jon Barron et al. (2014). Multiscale Combinatorial Grouping. . https://doi.org/10.1109/cvpr.2014.49

Identifiers

DOI
10.1109/cvpr.2014.49