Sparsity Invariant CNNs

被引:586
作者
Uhrig, Jonas [1 ,2 ]
Schneider, Nick [1 ,3 ]
Schneider, Lukas [1 ,4 ]
Franke, Uwe [1 ]
Brox, Thomas [2 ]
Geiger, Andreas [4 ,5 ]
机构
[1] Daimler R&D Sindelfingen, Sindelfingen, Germany
[2] Univ Freiburg, Freiburg, Germany
[3] KIT Karlsruhe, Karlsruhe, Germany
[4] Swiss Fed Inst Technol, Zurich, Switzerland
[5] MPI Tubingen, Tubingen, Germany
来源
PROCEEDINGS 2017 INTERNATIONAL CONFERENCE ON 3D VISION (3DV) | 2017年
关键词
D O I
10.1109/3DV.2017.00012
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we consider convolutional neural networks operating on sparse inputs with an application to depth completion from sparse laser scan data. First, we show that traditional convolutional networks perform poorly when applied to sparse data even when the location of missing data is provided to the network. To overcome this problem, we propose a simple yet effective sparse convolution layer which explicitly considers the location of missing data during the convolution operation. We demonstrate the benefits of the proposed network architecture in synthetic and real experiments with respect to various baseline approaches. Compared to dense baselines, the proposed sparse convolution network generalizes well to novel datasets and is invariant to the level of sparsity in the data. For our evaluation, we derive a novel dataset from the KITTI benchmark, comprising over 94k depth annotated RGB images. Our dataset allows for training and evaluating depth completion and depth prediction techniques in challenging real-world settings and is available online at: www.cvlibs.net/datasets/kitti.
引用
收藏
页码:11 / 20
页数:10
相关论文
共 59 条
[1]  
[Anonymous], 2008, ECCV WORKSH
[2]  
[Anonymous], SANKHY INDIAN J STAT
[3]  
[Anonymous], IEEE INT C COMP VIS
[4]  
[Anonymous], THEORY PROBABILITY I
[5]  
[Anonymous], P IEEE C COMP VIS PA
[6]  
[Anonymous], P EUR C COMP VIS ECC
[7]  
[Anonymous], 160904382 ARXIV
[8]  
[Anonymous], 2016, PROC CVPR IEEE, DOI DOI 10.1109/CVPR.2016.482
[9]  
[Anonymous], 2009, P IEEE INT C COMP VI
[10]  
[Anonymous], 2016, P IEEE C COMP VIS PA