The Middle Child Problem: Revisiting Parametric Min-cut and Seeds for Object Proposals

被引:14
作者
Humayun, Ahmad [1 ]
Li, Fuxin [1 ,2 ,3 ]
Rehg, James M. [1 ]
机构
[1] Georgia Inst Technol, Atlanta, GA 30332 USA
[2] Oregon State Univ, Corvallis, OR 97331 USA
[3] Georgia Tech, Atlanta, GA USA
来源
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV) | 2015年
关键词
D O I
10.1109/ICCV.2015.187
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Object proposals have recently fueled the progress in detection performance. These proposals aim to provide category-agnostic localizations for all objects in an image. One way to generate proposals is to perform parametric min-cuts over seed locations. This paper demonstrates that standard parametric-cut models are ineffective in obtaining medium-sized objects, which we refer to as the middle child problem. We propose a new energy minimization framework incorporating geodesic distances between segments which solves this problem. In addition, we introduce a new superpixel merging algorithm which can generate a small set of seeds that reliably cover a large number of objects of all sizes. We call our method POISE- "Proposals for Objects from Improved Seeds and Energies." POISE enables parametric min-cuts to reach their full potential. On PASCAL VOC it generates similar to 2,640 segments with an average overlap of 0.81, whereas the closest competing methods require more than 4,200 proposals to reach the same accuracy [24, 30]. We show detailed quantitative comparisons against 5 state-of-the-art methods on PASCAL VOC and Microsoft COCO segmentation challenges.
引用
收藏
页码:1600 / 1608
页数:9
相关论文
共 36 条
[1]   SLIC Superpixels Compared to State-of-the-Art Superpixel Methods [J].
Achanta, Radhakrishna ;
Shaji, Appu ;
Smith, Kevin ;
Lucchi, Aurelien ;
Fua, Pascal ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2274-2281
[2]   Measuring the Objectness of Image Windows [J].
Alexe, Bogdan ;
Deselaers, Thomas ;
Ferrari, Vittorio .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2189-2202
[3]  
[Anonymous], 2015, NIPS
[4]  
[Anonymous], 2015, CoRR
[5]  
[Anonymous], 2014, COMPUTER SCIEN CE
[6]  
[Anonymous], LECT NOTES COMPUTER
[7]  
[Anonymous], 2015, P IEEE INT C COMPUTE
[8]  
[Anonymous], 2015, CVPR
[9]  
[Anonymous], PATTERN ANAL MACHINE
[10]  
Batra D, 2012, LECT NOTES COMPUT SC, V7576, P1, DOI 10.1007/978-3-642-33715-4_1