Optimised ICP algorithm based on simulated-annealing strategy

How to process the point cloud data is a research hotspot, among which point cloud registration directly affects synthesis results. The iterative closest point (ICP) algorithm is a common method. However, it requires initial distribution of the registration point cloud and usually falls into optimal solution trap. To address the problem, an optimised ICP algorithm based on a simulated annealing strategy is proposed, which divides the registration process into filtering, coarse registration and precise registration. In filtering process, denoising and down sampling are performed to reduce the data size and improve the subsequent iteration rate; then the point cloud with a closer initial distribution is obtained by coarse registration. Finally, in the precise registration, we introduce the simulated annealing strategy, avoiding the local optimum trap. Experiments show that our method has a higher accuracy rate and contributes to the generation of more accurate and complete models in 3D data reconstruction.