E2PN: Efficient SE(3)-Equivariant Point Network
- URL: http://arxiv.org/abs/2206.05398v3
- Date: Wed, 14 Jun 2023 02:58:30 GMT
- Title: E2PN: Efficient SE(3)-Equivariant Point Network
- Authors: Minghan Zhu, Maani Ghaffari, William A. Clark, Huei Peng
- Abstract summary: This paper proposes a convolution structure for learning SE(3)-equivariant features from 3D point clouds.
It can be viewed as an equivariant version of kernel point convolutions (KPConv), a widely used convolution form to process point cloud data.
- Score: 12.520265159777255
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper proposes a convolution structure for learning SE(3)-equivariant
features from 3D point clouds. It can be viewed as an equivariant version of
kernel point convolutions (KPConv), a widely used convolution form to process
point cloud data. Compared with existing equivariant networks, our design is
simple, lightweight, fast, and easy to be integrated with existing
task-specific point cloud learning pipelines. We achieve these desirable
properties by combining group convolutions and quotient representations.
Specifically, we discretize SO(3) to finite groups for their simplicity while
using SO(2) as the stabilizer subgroup to form spherical quotient feature
fields to save computations. We also propose a permutation layer to recover
SO(3) features from spherical features to preserve the capacity to distinguish
rotations. Experiments show that our method achieves comparable or superior
performance in various tasks, including object classification, pose estimation,
and keypoint-matching, while consuming much less memory and running faster than
existing work. The proposed method can foster the development of equivariant
models for real-world applications based on point clouds.
Related papers
- BiEquiFormer: Bi-Equivariant Representations for Global Point Cloud Registration [28.75341781515012]
The goal of this paper is to address the problem of global point cloud registration (PCR) i.e., finding the optimal alignment between point clouds.
We show that state-of-the-art deep learning methods suffer from huge performance degradation when the point clouds are arbitrarily placed in space.
arXiv Detail & Related papers (2024-07-11T17:58:10Z) - SVNet: Where SO(3) Equivariance Meets Binarization on Point Cloud
Representation [65.4396959244269]
The paper tackles the challenge by designing a general framework to construct 3D learning architectures.
The proposed approach can be applied to general backbones like PointNet and DGCNN.
Experiments on ModelNet40, ShapeNet, and the real-world dataset ScanObjectNN, demonstrated that the method achieves a great trade-off between efficiency, rotation, and accuracy.
arXiv Detail & Related papers (2022-09-13T12:12:19Z) - SE(3)-Equivariant Attention Networks for Shape Reconstruction in
Function Space [50.14426188851305]
We propose the first SE(3)-equivariant coordinate-based network for learning occupancy fields from point clouds.
In contrast to previous shape reconstruction methods that align the input to a regular grid, we operate directly on the irregular, unoriented point cloud.
We show that our method outperforms previous SO(3)-equivariant methods, as well as non-equivariant methods trained on SO(3)-augmented datasets.
arXiv Detail & Related papers (2022-04-05T17:59:15Z) - Multiway Non-rigid Point Cloud Registration via Learned Functional Map
Synchronization [105.14877281665011]
We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds.
We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
arXiv Detail & Related papers (2021-11-25T02:37:59Z) - Correspondence-Free Point Cloud Registration with SO(3)-Equivariant
Implicit Shape Representations [12.343333815270402]
The proposed shape registration method achieves three major advantages through combining equivariant feature learning with implicit shape models.
Results show superior performance compared with existing correspondence-free deep registration methods.
arXiv Detail & Related papers (2021-07-21T18:18:21Z) - 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) - Equivariant Point Network for 3D Point Cloud Analysis [17.689949017410836]
We propose an effective and practical SE(3) (3D translation and rotation) equivariant network for point cloud analysis.
First, we present SE(3) separable point convolution, a novel framework that breaks down the 6D convolution into two separable convolutional operators.
Second, we introduce an attention layer to effectively harness the expressiveness of the equivariant features.
arXiv Detail & Related papers (2021-03-25T21:57:10Z) - DyCo3D: Robust Instance Segmentation of 3D Point Clouds through Dynamic
Convolution [136.7261709896713]
We propose a data-driven approach that generates the appropriate convolution kernels to apply in response to the nature of the instances.
The proposed method achieves promising results on both ScanetNetV2 and S3DIS.
It also improves inference speed by more than 25% over the current state-of-the-art.
arXiv Detail & Related papers (2020-11-26T14:56:57Z) - 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.