Evolutionary Multitasking with Solution Space Cutting for Point Cloud Registration
Not on the map. Why?
Abstract (arXiv)
Point cloud registration (PCR) is a popular research topic in computer vision. Recently, the registration method in an evolutionary way has received continuous attention because of its robustness to the initial pose and flexibility in objective function design. However, most evolving registration methods cannot tackle the local optimum well and they have rarely investigated the success ratio, which implies the probability of not falling into local optima and is closely related to the practicality of the algorithm. Evolutionary multi-task optimization (EMTO) is a widely used paradigm, which can boost exploration capability through knowledge transfer among related tasks. Inspired by this concept, this study proposes a novel evolving registration algorithm via EMTO, where the multi-task configuration is based on the idea of solution space cutting. Concretely, one task searching in cut space assists another task with complex function landscape in escaping from local optima and enhancing successful registration ratio. To reduce unnecessary computational cost, a sparse-to-dense strategy is proposed. In addition, a novel fitness function robust to various overlap rates as well as a problem-specific metric of computational cost is introduced. Compared with 8 evolving approaches, 4 traditional approaches and 3 deep learning approaches on the object-scale and scene-scale registration datasets, experimental results demonstrate that the proposed method has superior performances in terms of precision and tackling local optima.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 61 references that are in the map. First posted on arXiv 12 Dec 2022.
Builds on
18 of 61 references.
References · 18
- 20163DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructionscited by 333
- 2020Deep Local Shapes: Learning Local SDF Priors for Detailed 3D Reconstructioncited by 321
- 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 318
- 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
- 2019PointNetLK: Robust & Efficient Point Cloud Registration using PointNetcited by 231
- 2022Geometric Transformer for Fast and Robust Point Cloud Registrationcited by 200
- 2019Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mappingcited by 181
- 2020RPM-Net: Robust Point Matching using Learned Featurescited by 181
- 2018PPFNet: Global Context Aware Local Features for Robust 3D Point Matchingcited by 180
- 2021PointDSC: Robust Point Cloud Registration using Deep Spatial Consistencycited by 142
- 2020Feature-metric Registration: A Fast Semi-supervised Approach for Robust Point Cloud Registration without Correspondencescited by 108
- 2021A comprehensive survey on point cloud registrationcited by 84
6 more
- 2020DI-Fusion: Online Implicit 3D Reconstruction with Deep Priorscited by 70
- 2017Guaranteed Outlier Removal for Point Cloud Registration with Correspondencescited by 62
- 2022SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registrationcited by 62
- 2020The Lottery Ticket Hypothesis for Object Recognitioncited by 34
- 2020Learning and Sharing: A Multitask Genetic Programming Approach to Image Feature Learningcited by 7
- 2022Multi-view Point Cloud Registration based on Evolutionary Multitasking with Bi-Channel Knowledge Sharing Mechanismcited by 4
Built on by
Not cited yet.