RandLA-Net: Efficient Semantic Segmentation of Large-Scale Point Clouds

Qingyong Hu, Bo Yang, Linhai Xie, Stefano Rosa, Yulan Guo +3 more
11/25/2019
cs.CVcs.LGeess.IV

Official code: QingyongHu/RandLA-Net (1,565 stars, last commit 2023-07-11).

Abstract

We study the problem of efficient semantic segmentation for large-scale 3D point clouds. By relying on expensive sampling techniques or computationally heavy pre/post-processing steps, most existing approaches are only able to be trained and operate over small-scale point clouds. In this paper, we introduce RandLA-Net, an efficient and lightweight neural architecture to directly infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Although remarkably computation and memory efficient, random sampling can discard key features by chance. To overcome this, we introduce a novel local feature aggregation module to progressively increase the receptive field for each 3D point, thereby effectively preserving geometric details. Extensive experiments show that our RandLA-Net can process 1 million points in a single pass with up to 200X faster than existing approaches. Moreover, our RandLA-Net clearly surpasses state-of-the-art approaches for semantic segmentation on two large-scale benchmarks Semantic3D and SemanticKITTI.

View on arXivView PDF

Code Implementations(1)

🔥RandLA-Net in Tensorflow (CVPR 2020, Oral & IEEE TPAMI 2021)

1,565334C++, PythonNov 25, 20193 years agoNOASSERTION
3d-visioncomputer-visions3dissemantic-segmentationsemantic3d+1 more

Similar Papers

Cite this paper

@article{hu2019randlanet,
  title  = {RandLA-Net: Efficient Semantic Segmentation of Large-Scale Point Clouds},
  author = {Qingyong Hu and Bo Yang and Linhai Xie and Stefano Rosa and Yulan Guo and Zhihua Wang and Niki Trigoni and Andrew Markham},
  year   = {2019},
  eprint = {1911.11236},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1911.11236}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1911.11236.svg)](https://codeofpaper.com/paper/1911.11236)

Discussion