Monte Carlo Convolution for Learning on Non-Uniformly Sampled Point Clouds

被引:14
作者
Hermosilla, Pedro [1 ]
Ritschel, Tobias [2 ]
Vazquez, Pere-Pau [3 ]
Vinacua, Alvar [3 ]
Ropinski, Timo [1 ]
机构
[1] Ulm Univ, Ulm, Germany
[2] UCL, London, England
[3] Univ Politcn Catalunya, Barcelona, Spain
来源
ACM TRANSACTIONS ON GRAPHICS | 2018年 / 37卷 / 06期
关键词
Deep learning; Convolutional neural networks; Point clouds; Monte Carlo integration;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Deep learning systems extensively use convolution operations to process input data. Though convolution is clearly defined for structured data such as 2D images or 3D volumes, this is not true for other data types such as sparse point clouds. Previous techniques have developed approximations to convolutions for restricted conditions. Unfortunately, their applicability is limited and cannot be used for general point clouds. We propose an efficient and effective method to learn convolutions for non-uniformly sampled point clouds, as they are obtained with modern acquisition techniques. Learning is enabled by four key novelties: first, representing the convolution kernel itself as a multilayer perceptron; second, phrasing convolution as a Monte Carlo integration problem, third, using this notion to combine information from multiple samplings at different levels; and fourth using Poisson disk sampling as a scalable means of hierarchical point cloud learning. The key idea across all these contributions is to guarantee adequate consideration of the underlying non-uniform sample distribution function from a Monte Carlo perspective. To make the proposed concepts applicable to real-world tasks, we furthermore propose an efficient implementation which significantly reduces the GPU memory required during the training process. By employing our method in hierarchical network architectures we can outperform most of the state-of-the-art networks on established point cloud segmentation, classification and normal estimation benchmarks. Furthermore, in contrast to most existing approaches, we also demonstrate the robustness of our method with respect to sampling variations, even when training with uniformly sampled data only. To support the direct application of these concepts, we provide a ready-to-use TensorFlow implementation of these layers at https://github.com/viscom-ulm/MCCNN.
引用
收藏
页数:12
相关论文
共 32 条
[1]  
[Anonymous], 2015, PROC CVPR IEEE, DOI 10.1109/CVPR.2015.7298801
[2]  
[Anonymous], 2017, NEIGHBORSDO HELP DEE
[3]  
[Anonymous], 2010, COMPUTER GRAPHICS FO
[4]  
Atzmon Matan, 2018, ACM T GRAPHIC, V37, P3
[5]   STOCHASTIC SAMPLING IN COMPUTER-GRAPHICS [J].
COOK, RL .
ACM TRANSACTIONS ON GRAPHICS, 1986, 5 (01) :51-72
[6]   3DMV: Joint 3D-Multi-view Prediction for 3D Semantic Scene Segmentation [J].
Dai, Angela ;
Niessner, Matthias .
COMPUTER VISION - ECCV 2018, PT X, 2018, 11214 :458-474
[7]   Shape Completion using 3D-Encoder-Predictor CNNs and Shape Synthesis [J].
Dai, Angela ;
Qi, Charles Ruizhongtai ;
Niessner, Matthias .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :6545-6554
[8]   ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenes [J].
Dai, Angela ;
Chang, Angel X. ;
Savva, Manolis ;
Halber, Maciej ;
Funkhouser, Thomas ;
Niessner, Matthias .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :2432-2443
[9]   The farthest point strategy for progressive image sampling [J].
Eldar, Y ;
Lindenbaum, M ;
Porat, M ;
Zeevi, YY .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (09) :1305-1315
[10]  
Green S., 2008, NVIDIA WHITEPAP, V2, P1