资源论文Multiscale Combinatorial Grouping

Multiscale Combinatorial Grouping

2019-12-12 | |  69 |   44 |   0

Abstract

We propose a unified approach for bottom-up hierarchi-cal image segmentation and object candidate generationfor recognition, called Multiscale Combinatorial Grouping(MCG). For this purpose, we first develop a fast normal-ized cuts algorithm. We then propose a high-performancehierarchical segmenter that makes effective use of multi-scale information. Finally, we propose a grouping strategythat combines our multiscale regions into highly-accurateobject 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, hi-erarchical regions and object candidates.

上一篇:Maximum Persistency in Energy Minimization

下一篇:Beta Process Multiple Kernel Learning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...