The New Combined Closed-Solution for 3D Reconstruction of Environment Based on Iterative Closest Point Algorithm

Abstract

This The scientific problem at solving which the present project is directed consists in the development of accurate methods for reconstruction of a three-dimensional map of the accessible of environment with requied accuracy of reconstruction. The problem of consistent aligning of 3D point data is known registration task. The most popular registration algorithm is the Iterative Closest Point algorithm. Three basic problems are characteristic for the ICP algorithm: first, the convergence of the algorithm depends strongly on the choice of the initial approximation; second, the algorithm does not take into account the local shape of the surface around each point; and, third, the search for the nearest points is of high computational complexity. In this paper a new close solutions to 3D total variation regularization will be obtained and effective algorithms for restoring 3D data will be designed. The proposed approach improves the accuracy and convergence of reconstruction methods for complex and large-scale scenes. The performance and computational complexity of the proposed RGB-D Mapping algorithm in real indoor environments is discussed. Keywords—simultaneous localization and mapping; a threedimensional map; iterative closest point algorithm; orthogonal transformations; variational problem of the point-to-point