ImageNet Auto-Annotation with Segmentation Propagation

被引:90
作者
Guillaumin, Matthieu [1 ]
Kuettel, Daniel [1 ]
Ferrari, Vittorio [2 ]
机构
[1] ETH, D ITET, Comp Vis Lab, CH-8092 Zurich, Switzerland
[2] Univ Edinburgh, IPAB, Sch Informat, Edinburgh EH8 9AB, Midlothian, Scotland
关键词
Figure-ground segmentation; ImageNet; Knowledge transfer; Object localization; Large-scale computer vision;
D O I
10.1007/s11263-014-0713-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
ImageNet is a large-scale hierarchical database of object classes with millions of images. We propose to automatically populate it with pixelwise object-background segmentations, by leveraging existing manual annotations in the form of class labels and bounding-boxes. The key idea is to recursively exploit images segmented so far to guide the segmentation of new images. At each stage this propagation process expands into the images which are easiest to segment at that point in time, e. g. by moving to the semantically most related classes to those segmented so far. The propagation of segmentation occurs both (a) at the image level, by transferring existing segmentations to estimate the probability of a pixel to be foreground, and (b) at the class level, by jointly segmenting images of the same class and by importing the appearance models of classes that are already segmented. Through experiments on 577 classes and 500k images we show that our technique (i) annotates a wide range of classes with accurate segmentations; (ii) effectively exploits the hierarchical structure of ImageNet; (iii) scales efficiently, especially when implemented on superpixels; (iv) outperforms a baselineGrabCut (Rother et al. 2004) initialized on the image center, as well as segmentation transfer from a fixed source pool and run independently on each target image (Kuettel and Ferrari 2012). Moreover, our method also delivers state-of-the-art results on the recent iCoseg dataset for co-segmentation.
引用
收藏
页码:328 / 348
页数:21
相关论文
共 71 条
[1]  
[Anonymous], P EUR C COMP VIS
[2]  
[Anonymous], 2010, P EUR C COMP VIS
[3]  
[Anonymous], P EUR C COMP VIS
[4]  
[Anonymous], P EUR C COMP VIS
[5]  
[Anonymous], P IEEE C COMP VIS PA
[6]  
[Anonymous], P EUR C COMP VIS
[7]  
[Anonymous], P INT C COMP VIS
[8]  
[Anonymous], 2010, P IEEE C COMP VIS PA
[9]  
[Anonymous], P IEEE C COMP VIS PA
[10]  
[Anonymous], P IEEE C COMP VIS PA