4.6 Article

Hausdorff point convolution with geometric priors

期刊

SCIENCE CHINA-INFORMATION SCIENCES
卷 64, 期 11, 页码 -

出版社

SCIENCE PRESS
DOI: 10.1007/s11432-021-3311-2

关键词

point convolution; Hausdorff distance; geometric prior; deep neural network

资金

  1. National Natural Science Foundation of China [U2001206, 61902254]
  2. Guangdong Talent Program [2019JC05X328]
  3. Guangdong Science and Technology Program [2020A0505100064, 2015A030312015]
  4. DEGP Key Project [2018KZDXM058, 2020SFKC059]
  5. Shenzhen Science and Technology Program [RCJC20200714114435012]
  6. Guangdong Laboratory of Artificial Intelligence and Digital Economy
  7. National Engineering Laboratory for Big Data System Computing Technology

向作者/读者索取更多资源

This study introduces a shape-aware point convolution method for irregular point clouds to accurately learn the geometric shapes and extract deep features. The results show that HPC-DNN outperforms traditional point convolution methods in semantic segmentation tasks, achieving performance improvements.
Developing point convolution for irregular point clouds to extract deep features remains challenging. Current methods evaluate the response by computing point set distances which account only for the spatial alignment between two point sets, but not quite for their underlying shapes. Without a shape-aware response, it is hard to characterize the 3D geometry of a point cloud efficiently with a compact set of kernels. In this paper, we advocate the use of modified Hausdorff distance as a shape-aware distance measure for calculating point convolutional responses. The technique we present, coined Hausdorff point convolution (HPC), is shape-aware. We show that HPC constitutes a powerful point feature learning with a rather compact set of only four types of geometric priors as kernels. We further develop an HPC-based deep neural network (HPC-DNN). Task-specific learning can be achieved by tuning the network weights for combining the shortest distances between the input and the kernel point sets. We also realize hierarchical feature learning by designing a multi-kernel HPC for multi-scale feature encoding. Extensive experiments demonstrate that HPC-DNN outperforms strong point convolution baselines (e.g., KPConv), achieving 2.8% mIoU performance boost on S3DIS and 1.5% on SemanticKITTI for semantic segmentation task.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据