BiEquiFormer: Bi-Equivariant Representations for Global Point Cloud Registration
- URL: http://arxiv.org/abs/2407.08729v1
- Date: Thu, 11 Jul 2024 17:58:10 GMT
- Title: BiEquiFormer: Bi-Equivariant Representations for Global Point Cloud Registration
- Authors: Stefanos Pertigkiozoglou, Evangelos Chatzipantazis, Kostas Daniilidis,
- Abstract summary: We show that state-of-the-art deep learning methods suffer from huge performance degradation when the point clouds are arbitrarily placed in space.
We design BiEquiformer a novel and scalable textitbi-equivariant pipeline.
This allows us to extract high-quality superpoint correspondences and in turn, robust point-cloud registration.
- Score: 28.75341781515012
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The goal of this paper is to address the problem of \textit{global} point cloud registration (PCR) i.e., finding the optimal alignment between point clouds irrespective of the initial poses of the scans. This problem is notoriously challenging for classical optimization methods due to computational constraints. First, we show that state-of-the-art deep learning methods suffer from huge performance degradation when the point clouds are arbitrarily placed in space. We propose that \textit{equivariant deep learning} should be utilized for solving this task and we characterize the specific type of bi-equivariance of PCR. Then, we design BiEquiformer a novel and scalable \textit{bi-equivariant} pipeline i.e. equivariant to the independent transformations of the input point clouds. While a naive approach would process the point clouds independently we design expressive bi-equivariant layers that fuse the information from both point clouds. This allows us to extract high-quality superpoint correspondences and in turn, robust point-cloud registration. Extensive comparisons against state-of-the-art methods show that our method achieves comparable performance in the canonical setting and superior performance in the robust setting in both the 3DMatch and the challenging low-overlap 3DLoMatch dataset.
Related papers
- Point Cloud Pre-training with Diffusion Models [62.12279263217138]
We propose a novel pre-training method called Point cloud Diffusion pre-training (PointDif)
PointDif achieves substantial improvement across various real-world datasets for diverse downstream tasks such as classification, segmentation and detection.
arXiv Detail & Related papers (2023-11-25T08:10:05Z) - EPCL: Frozen CLIP Transformer is An Efficient Point Cloud Encoder [60.52613206271329]
This paper introduces textbfEfficient textbfPoint textbfCloud textbfLearning (EPCL) for training high-quality point cloud models with a frozen CLIP transformer.
Our EPCL connects the 2D and 3D modalities by semantically aligning the image features and point cloud features without paired 2D-3D data.
arXiv Detail & Related papers (2022-12-08T06:27:11Z) - 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) - Category-Level Global Camera Pose Estimation with Multi-Hypothesis Point
Cloud Correspondences [26.885846254261626]
Correspondence search is an essential step in rigid point cloud registration algorithms.
This paper proposes an optimization method that retains all possible correspondences for each keypoint when matching a partial point cloud to a complete point cloud.
We also propose a new point feature descriptor that measures the similarity between local point cloud regions.
arXiv Detail & Related papers (2022-09-28T21:12:51Z) - Dual Adaptive Transformations for Weakly Supervised Point Cloud
Segmentation [78.6612285236938]
We propose a novel DAT (textbfDual textbfAdaptive textbfTransformations) model for weakly supervised point cloud segmentation.
We evaluate our proposed DAT model with two popular backbones on the large-scale S3DIS and ScanNet-V2 datasets.
arXiv Detail & Related papers (2022-07-19T05:43:14Z) - E2PN: Efficient SE(3)-Equivariant Point Network [12.520265159777255]
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.
arXiv Detail & Related papers (2022-06-11T02:15:46Z) - 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) - A Representation Separation Perspective to Correspondences-free
Unsupervised 3D Point Cloud Registration [40.12490804387776]
3D point cloud registration in remote sensing field has been greatly advanced by deep learning based methods.
We propose a correspondences-free unsupervised point cloud registration (UPCR) method from the representation separation perspective.
Our method not only filters out the disturbance in pose-invariant representation but also is robust to partial-to-partial point clouds or noise.
arXiv Detail & Related papers (2022-03-24T17:50:19Z) - 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) - 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) - DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point
Cloud Registration [12.471564670462344]
This work addresses the problem of point cloud registration using deep neural networks.
We propose an approach to predict the alignment between two point clouds with overlapping data content, but displaced origins.
Our approach achieves state-of-the-art accuracy and the lowest run-time of the compared methods.
arXiv Detail & Related papers (2020-07-22T08:20:57Z)
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.