A Parallelized Iterative Closest Point Algorithm for 3D View Fusion

  • S. Ivvan Valdez
  • Felipe Trujillo-Romero
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 948)


The Iterative Closest Point Algorithm (ICP) is a widely used method in computer science and robotics, used for minimizing a distance metric between two set of points. Common applications of the ICP are object localization and position estimation. In this work, we introduce a parallel version of the ICP which significantly reduces the computational time, by performing fewer operations while maintaining a simple and highly parallelizable algorithm. Our proposal is based on the naive computation of closest pairs of points in two different sets, instead of comparing all possible pairs we approximate the closest pairs of points by means of searching in a plausible subset. The experiments are performed on a sample from the Stanford 3D Scanning Repository, used for the 3D cloud of points registration. For these case studies, the error, as well as the solution, are exactly the same than using the exact algorithm.


Iterative Closest Point Shared memory Approximated ICP 3D cloud registration 


  1. 1.
    Besl, P.J., McKay, N.D.: A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14(2), 239–256 (1992)CrossRefGoogle Scholar
  2. 2.
    Chen, Y., Medioni, G.: Object modelling by registration of multiple range images. Image Vis. Comput. 10(3), 145–155 (1992). Range Image UnderstandingCrossRefGoogle Scholar
  3. 3.
    Pomerleau, F., Colas, F., Siegwart, R., Magnenat, S.: Comparing ICP variants on real-world data sets. Auton. Robots 34(3), 133–148 (2013)CrossRefGoogle Scholar
  4. 4.
    Stanford-Computer-Graphics-Laboratory: Stanford 3D model repository (1994). Accessed 30 Nov 2017
  5. 5.
    Sun, J., Zhang, J., Zhang, G.: An automatic 3D point cloud registration method based on regional curvature maps. Image Vis. Comput. 56, 49–58 (2016)CrossRefGoogle Scholar
  6. 6.
    Mohammad Zade, H., Hatzinakos, D.: Iterative closest normal point for 3D face recognition. IEEE Trans. Pattern Anal. Mach. Intell. 35(2), 381–397 (2013)CrossRefGoogle Scholar
  7. 7.
    Donoso, F., Austin, K., McAree, P.: Three new iterative closest point variant methods that improve scan matching for surface mining terrain. Robot. Auton. Syst. 95, 117–128 (2017)CrossRefGoogle Scholar
  8. 8.
    Bouaziz, S., Tagliasacchi, A., Pauly, M.: Sparse iterative closest point. Comput. Graph. Forum 32(5), 113–123 (2013)CrossRefGoogle Scholar
  9. 9.
    Du, S., Cui, W., Zhang, X., Wu, L., Xiong, L.: Precise isotropic scaling iterative closest point algorithm based on corner points for shape registration. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1811–1815, October 2017Google Scholar
  10. 10.
    Mavridis, P., Andreadis, A., Papaioannou, G.: Efficient sparse ICP. Computer Aided Geometric Design 35–36 (2015) 16–26 Geometric Modeling and Processing 2015Google Scholar
  11. 11.
    Langis, C., Greenspan, M., Godin, G.: The parallel iterative closest point algorithm. In: Proceedings Third International Conference on 3-D Digital Imaging and Modeling, pp. 195–202 (2001)Google Scholar
  12. 12.
    Qiu, D., May, S., Nüchter, A.: GPU-accelerated nearest neighbor search for 3D registration. In: Fritz, M., Schiele, B., Piater, J.H. (eds.) ICVS 2009. LNCS, vol. 5815, pp. 194–203. Springer, Heidelberg (2009). Scholar
  13. 13.
    Manojkumar, P., Reddy, G.R.M.: Parallel implementation of 3D modelling of indoor environment using microsoft kinect sensor. In: 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICC-CNT), pp. 1–6, July 2013Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Universidad de Guanajuato, DICISSalamanca, GuanajuatoMexico

Personalised recommendations