An important issue in simultaneous localisation and mapping is how to match and merge individual local maps into one global map. This is addressed within the field of robotics and is crucial for multi-robot SLAM. There are a number of different ways to solve this task depending on the representation of the map. To take advantage of matching and merging methods that allow for deformations of the local maps it is important to find feature matches that capture such deformations. In this paper we present minimal solvers for point cloud matching using statistical deformations. The solvers use either three or four point matches. These solve for either rigid or similarity transformation as well as shape deformation in the direction of the most important modes of variation. Given an initial set of tentative matches based on, for example, feature descriptors or machine learning we use these solvers in a RANSAC loop to remove outliers among the tentative matches. We evaluate the methods on both synthetic and real data and compare them to RANSAC methods based on Procrustes and demonstrate that the proposed methods improve on the current state-of-the-art.
Titel på värdpublikation2022 26th International Conference on Pattern Recognition (ICPR)
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (tryckt)978-1-6654-9063-4
StatusPublished - 2022
Evenemang26th International Conference on Pattern Recognition, ICPR 2022 - Montreal, Kanada
Varaktighet: 2022 aug. 212022 aug. 25


Konferens26th International Conference on Pattern Recognition, ICPR 2022

Ämnesklassifikation (UKÄ)

  • Datorseende och robotik (autonoma system)


Utforska forskningsämnen för ”Minimal Solvers for Point Cloud Matching with Statistical Deformations”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här