Convolution on 3D point clouds is widely researched yet far from perfect in geometric deep learning. The traditional wisdom of convolution characterises feature correspondences indistinguishably among 3D points, arising an intrinsic limitation of poor distinctive feature learning. In this paper, we propose Adaptive Graph Convolution (AGConv) for wide applications of point cloud analysis. AGConv generates adaptive kernels for points according to their dynamically learned features. Compared with the solution of using fixed/isotropic kernels, AGConv improves the flexibility of point cloud convolutions, effectively and precisely capturing the diverse relations between points from different semantic parts. Unlike the popular attentional weight schemes, AGConv implements the adaptiveness inside the convolution operation instead of simply assigning different weights to the neighboring points. Extensive evaluations clearly show that our method outperforms state-of-the-arts of point cloud classification and segmentation on various benchmark datasets.Meanwhile, AGConv can flexibly serve more point cloud analysis approaches to boost their performance. To validate its flexibility and effectiveness, we explore AGConv-based paradigms of completion, denoising, upsampling, registration and circle extraction, which are comparable or even superior to their competitors. Our code is available at https://github.com/hrzhou2/AdaptConv-master.
翻译:3D点云层的变迁是广泛研究的,但在深深的几何学中还远非完美。 传统的变迁智慧在3D点之间具有无法区分的对应性,这引起了差分特征学习的内在局限性。 在本文中,我们建议对点云分析广泛应用调适式图形变迁(AGConv ) 。 AGConv 产生适合其动态学习特点的点的调适内核内核。 与使用固定/异质内核的解决方案相比, AGConv 提高了点云层变现的灵活性,有效和准确地捕捉到来自不同语义部分的点之间的不同关系。 与流行的重力计划不同, AGConv在变迁操作中采用了适应性,而不是简单地给相邻点云层分配不同的权重。 广泛的评估清楚地表明,我们的方法超越了各基准数据集的点云分级分类和分块的状态。 Meanhy, AGonv可以灵活地为提升其性能。 为了验证其灵活性和有效性,我们探索AG-Confro-b- comstanb-real registrual的模型是我们现有的精化和Climclution。