Agus, MarcoGobbetti, EnricoVillanueva, Alberto JaspeMura, ClaudioPajarola, RenatoJan Bender and Arjan Kuijper and Tatiana von Landesberger and Holger Theisel and Philipp Urban2014-12-162014-12-162014978-3-905674-74-3https://doi.org/10.2312/vmv.20141282We introduce a stochastic algorithm for pairwise affine registration of partially overlapping 3D point clouds with unknown point correspondences. The algorithm recovers the globally optimal scale, rotation, and translation alignment parameters and is applicable in a variety of difficult settings, including very sparse, noisy, and outlierridden datasets that do not permit the computation of local descriptors. The technique is based on a stochastic approach for the global optimization of an alignment error function robust to noise and resistant to outliers. At each optimization step, it alternates between stochastically visiting a generalized BSP-tree representation of the current solution landscape to select a promising transformation, finding point-to-point correspondences using a GPU-accelerated technique, and incorporating new error values in the BSP tree. In contrast to previous work, instead of simply constructing the tree by guided random sampling, we exploit the problem structure through a low-cost local minimization process based on analytically solving absolute orientation problems using the current correspondences. We demonstrate the quality and performance of our method on a variety of large point sets with different scales, resolutions, and noise characteristics.I.3.5 [Computer Graphics]Computational Geometry and Object ModelingGeometric algorithmslanguagesand systems