At present, the traditional ICP (Iterative Closest Point) algorithm used by TOF (Time-Of-Flight) cameras has the problem of high time-consuming in nearest point search process, resulting in low data update rate. Therefore, based on the characteristics of the data structure of the ICP algorithm, a multi-stage pipeline acceleration system is proposed, and the point cloud registration algorithm used in this system is studied. Firstly, design multiple units to store point cloud data and serve as the main search module. Secondly, make each group of units perform parallel operations, input the stored point clouds into their respective calculation modules, select a model point, traverse all query points, and perform subtraction. Then replace the model point and repeat the process until all model points are calculated. Finally, the query point corresponding to the minimum value in each model point difference data is selected and the model point is output as a point pair to the CPU to complete the final algorithm iteration. The experimental results show that at 30000 points, a single closest point search takes 25.65ms; at 20000 points, a single closest point search takes 11.65ms; at 10000 points, a single closest point search takes 2.88ms. It basically meets the requirements of TOF camera on-orbit measurement for the stability and reliability of point cloud registration and high data update rate.
Read full abstract