CVSep 23, 2019

Go Wider: An Efficient Neural Network for Point Cloud Analysis via Group Convolutions

arXiv:1909.10431v14 citations
Originality Incremental advance
AI Analysis

This work addresses computational bottlenecks in point cloud processing for applications like autonomous driving, offering an incremental improvement over existing methods.

The paper tackles the inefficiency of deep neural networks for point cloud analysis by proposing ShufflePointNet, a deep-wide network using group convolutions and channel shuffling, which achieves competitive accuracy on ModelNet40, ShapeNet part, S3DIS, and KITTI datasets while reducing computational complexity.

In order to achieve better performance for point cloud analysis, many researchers apply deeper neural networks using stacked Multi-Layer-Perceptron (MLP) convolutions over irregular point cloud. However, applying dense MLP convolutions over large amount of points (e.g. autonomous driving application) leads to inefficiency in memory and computation. To achieve high performance but less complexity, we propose a deep-wide neural network, called ShufflePointNet, to exploit fine-grained local features and reduce redundancy in parallel using group convolution and channel shuffle operation. Unlike conventional operation that directly applies MLPs on high-dimensional features of point cloud, our model goes wider by splitting features into groups in advance, and each group with certain smaller depth is only responsible for respective MLP operation, which can reduce complexity and allows to encode more useful information. Meanwhile, we connect communication between groups by shuffling groups in feature channel to capture fine-grained features. We claim that, multi-branch method for wider neural networks is also beneficial to feature extraction for point cloud. We present extensive experiments for shape classification task on ModelNet40 dataset and semantic segmentation task on large scale datasets ShapeNet part, S3DIS and KITTI. We further perform ablation study and compare our model to other state-of-the-art algorithms in terms of complexity and accuracy.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes