Abstract
The traditional ICP algorithm has a large amount of computation in the process of searching for corresponding points[1].This is the bottleneck of the traditional ICP algorithm[2],and the standard ICP is looking for the corresponding point[3].The point where the Euclidean distance is closest is the corresponding point[4].Unreasonable,there will be a certain number of wrong points[5].In order to improve the accuracy and speed of 3D point cloud data registration,this paper combines the coarse registration of the center of the box and the circular domain search method of the rasterized small cube to further improve and optimize the traditional ICP algorithm[6].
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
