A review on map-merging methods for typical map types in multiple-ground-robot SLAM solutions

S Yu, C Fu, AK Gostar, M Hu - Sensors, 2020 - mdpi.com
When multiple robots are involved in the process of simultaneous localization and map**
(SLAM), a global map should be constructed by merging the local maps built by individual …

Registration of 3D point clouds and meshes: A survey from rigid to nonrigid

GKL Tam, ZQ Cheng, YK Lai… - IEEE transactions on …, 2012 - ieeexplore.ieee.org
Three-dimensional surface registration transforms multiple three-dimensional data sets into
the same coordinate system so as to align overlap** components of these sets. Recent …

Compatibility-guided sampling consensus for 3-d point cloud registration

S Quan, J Yang - IEEE Transactions on Geoscience and …, 2020 - ieeexplore.ieee.org
This article presents an efficient and robust estimator called compatibility-guided sampling
consensus (CG-SAC) to achieve accurate 3-D point cloud registration. For correspondence …

Robust registration of point sets using iteratively reweighted least squares

P Bergström, O Edlund - Computational optimization and applications, 2014 - Springer
Registration of point sets is done by finding a rotation and translation that produces a best fit
between a set of data points and a set of model points. We use robust M-estimation …

Hgmr: Hierarchical gaussian mixtures for adaptive 3d registration

B Eckart, K Kim, J Kautz - proceedings of the European …, 2018 - openaccess.thecvf.com
Point cloud registration sits at the core of many important and challenging 3D perception
problems including autonomous navigation, SLAM, object/scene recognition, and …

基于激光雷达的同时定位与地图构建方法综述.

危双丰, 庞帆, 刘振彬, 师现杰 - Application Research of …, 2020 - search.ebscohost.com
基于激光雷达的同时定位与地图构建方法综述 Page 1 收稿日期:20180913;修回日期:20181105
基金项目:国家自然科学基金资助项目(41601409);北京市自然科学基金资助项目 (8172016);北京 …

SDRSAC: Semidefinite-based randomized approach for robust point cloud registration without correspondences

HM Le, TT Do, T Hoang… - Proceedings of the IEEE …, 2019 - openaccess.thecvf.com
This paper presents a novel randomized algorithm for robust point cloud registration without
correspondences. Most existing registration approaches require a set of putative …

Efficient registration of multi-view point sets by K-means clustering

J Zhu, Z Jiang, GD Evangelidis, C Zhang, S Pang… - Information Sciences, 2019 - Elsevier
This paper casts multi-view registration as a clustering task that can be solved using an
approach proposed based on K-means clustering. For clustering, all centroids are uniformly …

Affine iterative closest point algorithm for point set registration

S Du, N Zheng, S Ying, J Liu - Pattern Recognition Letters, 2010 - Elsevier
The traditional iterative closest point (ICP) algorithm is accurate and fast for rigid point set
registration but it is unable to handle affine case. This paper instead introduces a novel …