GAFAR: Graph-Attention Feature-Augmentation for Registration A Fast and Light-weight Point Set Registration Algorithm
Not on the map. Why?
Abstract (arXiv)
Rigid registration of point clouds is a fundamental problem in computer vision with many applications from 3D scene reconstruction to geometry capture and robotics. If a suitable initial registration is available, conventional methods like ICP and its many variants can provide adequate solutions. In absence of a suitable initialization and in the presence of a high outlier rate or in the case of small overlap though the task of rigid registration still presents great challenges. The advent of deep learning in computer vision has brought new drive to research on this topic, since it provides the possibility to learn expressive feature-representations and provide one-shot estimates instead of depending on time-consuming iterations of conventional robust methods. Yet, the rotation and permutation invariant nature of point clouds poses its own challenges to deep learning, resulting in loss of performance and low generalization capability due to sensitivity to outliers and characteristics of 3D scans not present during network training. In this work, we present a novel fast and light-weight network architecture using the attention mechanism to augment point descriptors at inference time to optimally suit the registration task of the specific point clouds it is presented with. Employing a fully-connected graph both within and between point clouds lets the network reason about the importance and reliability of points for registration, making our approach robust to outliers, low overlap and unseen data. We test the performance of our registration algorithm on different registration and generalization tasks and provide information on runtime and resource consumption. The code and trained weights are available at https://github.com/mordecaimalignatius/GAFAR/.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 44 references that are in the map. First posted on arXiv 5 Jul 2023.
Builds on
21 of 44 references.
References · 21
- 2017Attention Is All You Needcited by 59,932
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
- 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
- 2018Computational Optimal Transportcited by 765
- 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 318
- 2020PREDATOR: Registration of 3D Point Clouds with Low Overlapcited by 287
- 2019PointNetLK: Robust & Efficient Point Cloud Registration using PointNetcited by 231
- 2020Deep Global Registrationcited by 228
- 2022Geometric Transformer for Fast and Robust Point Cloud Registrationcited by 200
9 more
- 2020RPM-Net: Robust Point Matching using Learned Featurescited by 181
- 2018PPFNet: Global Context Aware Local Features for Robust 3D Point Matchingcited by 180
- 2018The Perfect Match: 3D Point Cloud Matching with Smoothed Densitiescited by 169
- 2016Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registrationcited by 159
- 2021Robust Point Cloud Registration Framework Based on Deep Graph Matchingcited by 96
- 2020DeepGMR: Learning Latent Gaussian Mixture Models for Registrationcited by 91
- 2018IMLS-SLAM: scan-to-model matching based on 3D datacited by 40
- 2017Going Further with Point Pair Featurescited by 28
- 2020Graphite: GRAPH-Induced feaTure Extraction for Point Cloud Registrationcited by 12
Built on by
Not cited yet.