Superpixel Convolutional Networks Using Bilateral Inceptions

被引:81
作者
Gadde, Raghudeep [1 ]
Jampani, Varun [2 ]
Kiefel, Martin [2 ,3 ]
Kappler, Daniel [2 ]
Gehler, Peter V. [2 ,3 ]
机构
[1] Univ Paris Est, LIGM UMR 8049, CNRS, ENPC,ESIEE,UPEM, Champs Sur Marne, France
[2] Max Planck Inst Intelligent Syst, Tubingen, Germany
[3] Bernstein Ctr Computat Neurosci, Tubingen, Germany
来源
COMPUTER VISION - ECCV 2016, PT I | 2016年 / 9905卷
关键词
D O I
10.1007/978-3-319-46448-0_36
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose a CNN architecture for semantic image segmentation. We introduce a new "bilateral inception" module that can be inserted in existing CNN architectures and performs bilateral filtering, at multiple feature-scales, between superpixels in an image. The feature spaces for bilateral filtering and other parameters of the module are learned end-to-end using standard backpropagation techniques. The bilateral inception module addresses two issues that arise with general CNN segmentation architectures. First, this module propagates information between (super) pixels while respecting image edges, thus using the structured information of the problem for improved results. Second, the layer recovers a full resolution segmentation result from the lower resolution solution of a CNN. In the experiments, we modify several existing CNN architectures by inserting our inception module between the last CNN (1 x 1 convolution) layers. Empirical results on three different datasets show reliable improvements not only in comparison to the baseline networks, but also in comparison to several dense-pixel prediction techniques such as CRFs, while being competitive in time.
引用
收藏
页码:597 / 613
页数:17
相关论文
共 46 条
[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]   Fast High-Dimensional Filtering Using the Permutohedral Lattice [J].
Adams, Andrew ;
Baek, Jongmin ;
Davis, Myers Abraham .
COMPUTER GRAPHICS FORUM, 2010, 29 (02) :753-762
[3]   Gaussian KD-Trees for Fast High-Dimensional Filtering [J].
Adams, Andrew ;
Gelfand, Natasha ;
Dolson, Jennifer ;
Levoy, Marc .
ACM TRANSACTIONS ON GRAPHICS, 2009, 28 (03)
[4]  
[Anonymous], 2015, P INT C LEARNING REP
[5]  
[Anonymous], 2015, International Conference on Learning Representations
[6]  
[Anonymous], PASCAL VOC2012 CHALL
[7]  
[Anonymous], ICML WORKSH LEARN TR
[8]  
[Anonymous], 2015, ARXIV150904232
[9]  
[Anonymous], 2015, ARXIV150302351 2015A
[10]  
[Anonymous], INT C LEARN REPR