A point cloud registration algorithm based on normal vector and particle swarm optimization

Based on normal vector and particle swarm optimization (NVP), a point cloud registration algorithm is proposed by searching the corresponding points. It provides a new method for point cloud registration using feature point registration. First, in order to find the nearest eight neighbor nodes, the k-d tree is employed to build the relationship between points. Then, the normal vector and the distance between the point and the center gravity of eight neighbor points can be calculated. Second, the particle swarm optimization is used to search the corresponding points. There are two conditions to terminate the search in particle swarm optimization: one is that the normal vector of node in the original point cloud is the most similar to that in the target point cloud, and the other is that the distance between the point and the center gravity of eight neighbor points of node is the most similar to that in the target point cloud. Third, after obtaining the corresponding points, they are tested by random sample consensus in order to obtain the right corresponding points. Fourth, the right corresponding points are registered by the quaternion method. The experiments demonstrate that this algorithm is effective. Even in the case of point cloud data lost, it also has high registration accuracy.

[1]  Elise Jennings,et al.  astroABC : An Approximate Bayesian Computation Sequential Monte Carlo sampler for cosmological parameter estimation , 2016, Astron. Comput..

[2]  HoppeHugues,et al.  Surface Reconstruction from Unorganized Points , 1992 .

[3]  Higinio González-Jorge,et al.  4-Plane congruent sets for automatic registration of as-is 3D point clouds with 3D BIM models , 2018 .

[4]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[5]  Ping He,et al.  A three-dimensional point cloud registration based on entropy and particle swarm optimization , 2018, Advances in Mechanical Engineering.

[6]  Leonardo Vanneschi,et al.  Genetic programming with semantic equivalence classes , 2019, Swarm Evol. Comput..

[7]  Shiro Tamaki,et al.  A High-performance Classifier from K-dimensional Tree-based Dual-kNN , 2018 .

[8]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[9]  Hiroto Suzuki,et al.  Shape error evaluation method of free-form surfaces , 1999, Comput. Aided Des..

[10]  Radu Horaud,et al.  Keypoints and Local Descriptors of Scalar Functions on 2D Manifolds , 2012, International Journal of Computer Vision.

[11]  Leonardo Vanneschi,et al.  A Distance Between Populations for n-Points Crossover in Genetic Algorithms , 2019, Swarm Evol. Comput..

[12]  Shihui Ying,et al.  A Scale Stretch Method Based on ICP for 3D Data Registration , 2009, IEEE Transactions on Automation Science and Engineering.

[13]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[14]  Yonghuai Liu,et al.  A mean field annealing approach to accurate free form shape matching , 2007, Pattern Recognit..

[15]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .

[16]  Nico Blodow,et al.  Aligning point cloud views using persistent feature histograms , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Leonardo Vanneschi,et al.  Forecasting performance of regional innovation systems using semantic-based genetic programming with local search optimizer , 2018, Comput. Oper. Res..

[18]  Heinz Hügli,et al.  A multi-resolution ICP with heuristic closest point search for fast and robust 3D registration of range images , 2003, Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings..

[19]  Robert B. Fisher,et al.  Special Issue on Registration and Fusion of Range Images , 2002, Comput. Vis. Image Underst..

[20]  Nobuyoshi Yabuki,et al.  Polygonization of point clouds of repetitive components in civil infrastructure based on geometric similarities , 2018 .

[21]  Andriy Myronenko,et al.  Point Set Registration: Coherent Point Drift , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[23]  Gary K. L. Tam,et al.  Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid , 2013, IEEE Transactions on Visualization and Computer Graphics.

[24]  Nico Blodow,et al.  Fast Point Feature Histograms (FPFH) for 3D registration , 2009, 2009 IEEE International Conference on Robotics and Automation.