Using multicore processors to parallelize 3D point cloud registration with the Coarse Binary Cubes method

This paper pursues speeding up 3D point cloud matching, which is crucial for mobile robotics. In previous work, we devised the Coarse Binary Cubes (CBC) method for fast and accurate registration of 3D scenes based on an integer objective function. Instead of point distance calculations, the method optimizes the number of coincident binary cubes between a pair of range images. In this paper, we propose taking advantage of widespread multicore and multithreaded processors to further speed-up CBC by parallel evaluation of prospective solutions in a globalized Nelder-Mead search. A performance analysis on two types of multicore processors is offered for indoor and outdoor scans from a 3D laser rangefinder. The proposed solution achieves a computational time gain close to the number of physical cores.

[1]  Robert B. Fisher,et al.  Parallel Evolutionary Registration of Range Data , 2002, Comput. Vis. Image Underst..

[2]  Angela C. Sodan,et al.  Parallelism via Multithreaded and Multicore CPUs , 2010, Computer.

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

[4]  Soon-Yong Park,et al.  Real-time 3D registration using GPU , 2011, Machine Vision and Applications.

[5]  J. Dennis,et al.  Direct Search Methods on Parallel Machines , 1991 .

[6]  Andreas Nüchter.  3D Range Image Registration , 2009 .

[7]  Alfonso Garcia-Cerezo,et al.  Design and development of a fast and precise low-cost 3D laser rangefinder , 2011, 2011 IEEE International Conference on Mechatronics.

[8]  Andreas Nüchter,et al.  GPU-Accelerated Nearest Neighbor Search for 3D Registration , 2009, ICVS.

[9]  Janusz Bedkowski,et al.  On-line data registration in OUTDOOR environment , 2011, 2011 16th International Conference on Methods & Models in Automation & Robotics.

[10]  Jorge L. Martínez,et al.  3D registration of laser range scenes by coincidence of coarse binary cubes , 2011, Machine Vision and Applications.

[11]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[13]  Kjell Brunnström,et al.  Genetic algorithms for free-form surface matching , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[14]  Joachim Hertzberg,et al.  Evaluation of 3D registration reliability and speed - A comparison of ICP and NDT , 2009, 2009 IEEE International Conference on Robotics and Automation.

[15]  Tom Duckett,et al.  Scan registration for autonomous mining vehicles using 3D‐NDT , 2007, J. Field Robotics.

[16]  Matthew Wiswall,et al.  A Parallel Implementation of the Simplex Function Minimization Routine , 2007 .

[17]  Martin D. Levine,et al.  Registering Multiview Range Data to Create 3D Computer Objects , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Jorge L. Martínez,et al.  Fast range-independent spherical subsampling of 3D laser scanner points and data reduction performance evaluation for scene registration , 2010, Pattern Recognit. Lett..