Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point Cloud

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Applying deep neural networks to 3D point cloud processing has demonstrated a rapid pace of advancement in those domains where 3D geometry information can greatly boost task performance, such as AR/VR, robotics, and autonomous driving. However, as the size of both the neural network model and 3D point cloud continues to scale, reducing the entailed computation and memory access overhead is a primary challenge to meet strict latency and energy constraints of practical applications. This paper proposes a new weight pruning technique for 3D point cloud based on spatial point distribution. We identify that particular groups of neighborhood voxels in 3D point cloud contribute more frequently to actual output features than others. Based on this observation, we propose to selectively prune less contributing groups of neighborhood voxels first to reduce the computation overhead while minimizing the impact on model accuracy. We apply our proposal to three representative sparse 3D convolution libraries. Our proposal reduces the inference latency by 1.60× on average and energy consumption by 1.74× on NVIDIA GV100 GPU with no loss in accuracy metric.

Cite

CITATION STYLE

APA

Lee, Y., Lee, D., Hong, J. U., Lee, J. W., & Yoon, H. (2023). Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point Cloud. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023 (Vol. 37, pp. 1240–1249). AAAI Press. https://doi.org/10.1609/aaai.v37i1.25207

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free