AGConv: Adaptive Graph Convolution on 3D Point Clouds

• URL: http://arxiv.org/abs/2206.04665v1
• Date: Thu, 9 Jun 2022 17:58:36 GMT
• Title: AGConv: Adaptive Graph Convolution on 3D Point Clouds
• Authors: Mingqiang Wei, Zeyong Wei, Haoran Zhou, Fei Hu, Huajian Si, Zhilei Chen, Zhe Zhu, Jingbo Qiu, Xuefeng Yan, Yanwen Guo, Jun Wang, Jing Qin
• Abstract summary: 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. Our method outperforms state-of-the-arts of point cloud classification and segmentation on various benchmark datasets.
• Score: 31.763280997642486
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• PosDiffNet: Positional Neural Diffusion for Point Cloud Registration in a Large Field of View with Perturbations [27.45001809414096]
  PosDiffNet is a model for point cloud registration in 3D computer vision. We leverage a graph neural partial differential equation (PDE) based on Beltrami flow to obtain high-dimensional features. We employ the multi-level correspondence derived from the high feature similarity scores to facilitate alignment between point clouds. We evaluate PosDiffNet on several 3D point cloud datasets, verifying that it achieves state-of-the-art (SOTA) performance for point cloud registration in large fields of view with perturbations.
  arXiv  Detail & Related papers  (2024-01-06T08:58:15Z)
• GQE-Net: A Graph-based Quality Enhancement Network for Point Cloud Color Attribute [51.4803148196217]
  We propose a graph-based quality enhancement network (GQE-Net) to reduce color distortion in point clouds. GQE-Net uses geometry information as an auxiliary input and graph convolution blocks to extract local features efficiently. Experimental results show that our method achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2023-03-24T02:33:45Z)
• Data Augmentation-free Unsupervised Learning for 3D Point Cloud Understanding [61.30276576646909]
  We propose an augmentation-free unsupervised approach for point clouds to learn transferable point-level features via soft clustering, named SoftClu. We exploit the affiliation of points to their clusters as a proxy to enable self-training through a pseudo-label prediction task.
  arXiv  Detail & Related papers  (2022-10-06T10:18:16Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• Differentiable Convolution Search for Point Cloud Processing [114.66038862207118]
  We propose a novel differential convolution search paradigm on point clouds. It can work in a purely data-driven manner and thus is capable of auto-creating a group of suitable convolutions for geometric shape modeling. We also propose a joint optimization framework for simultaneous search of internal convolution and external architecture, and introduce epsilon-greedy algorithm to alleviate the effect of discretization error.
  arXiv  Detail & Related papers  (2021-08-29T14:42:03Z)
• Adaptive Graph Convolution for Point Cloud Analysis [25.175406613705274]
  We propose Adaptive Graph Convolution (AdaptConv) which generates adaptive kernels for points according to their dynamically learned features. Our method outperforms state-of-the-art point cloud classification and segmentation approaches on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-08-18T08:38:52Z)
• Dynamic Convolution for 3D Point Cloud Instance Segmentation [146.7971476424351]
  We propose an approach to instance segmentation from 3D point clouds based on dynamic convolution. We gather homogeneous points that have identical semantic categories and close votes for the geometric centroids. The proposed approach is proposal-free, and instead exploits a convolution process that adapts to the spatial and semantic characteristics of each instance.
  arXiv  Detail & Related papers  (2021-07-18T09:05:16Z)
• The Devils in the Point Clouds: Studying the Robustness of Point Cloud Convolutions [15.997907568429177]
  This paper investigates different variants of PointConv, a convolution network on point clouds, to examine their robustness to input scale and rotation changes. We derive a novel viewpoint-invariant descriptor by utilizing 3D geometric properties as the input to PointConv. Experiments are conducted on the 2D MNIST & CIFAR-10 datasets as well as the 3D Semantic KITTI & ScanNet dataset.
  arXiv  Detail & Related papers  (2021-01-19T19:32:38Z)
• MG-SAGC: A multiscale graph and its self-adaptive graph convolution network for 3D point clouds [6.504546503077047]
  We propose a multiscale graph generation method for point clouds. This approach transforms point clouds into a structured multiscale graph form that supports multiscale analysis of point clouds in the scale space. Because traditional convolutional neural networks are not applicable to graph data with irregular neighborhoods, this paper presents an sef-adaptive convolution kernel that uses the Chebyshev graph to fit an irregular convolution filter.
  arXiv  Detail & Related papers  (2020-12-23T01:58:41Z)
• DV-ConvNet: Fully Convolutional Deep Learning on Point Clouds with Dynamic Voxelization and 3D Group Convolution [0.7340017786387767]
  3D point cloud interpretation is a challenging task due to the randomness and sparsity of the component points. In this work, we draw attention back to the standard 3D convolutions towards an efficient 3D point cloud interpretation. Our network is able to run and converge at a considerably fast speed, while yields on-par or even better performance compared with the state-of-the-art methods on several benchmark datasets.
  arXiv  Detail & Related papers  (2020-09-07T07:45:05Z)
• Permutation Matters: Anisotropic Convolutional Layer for Learning on Point Clouds [145.79324955896845]
  We propose a permutable anisotropic convolutional operation (PAI-Conv) that calculates soft-permutation matrices for each point. Experiments on point clouds demonstrate that PAI-Conv produces competitive results in classification and semantic segmentation tasks.
  arXiv  Detail & Related papers  (2020-05-27T02:42:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.