Skip to main content

Iterative-Reweighting-Based Robust Iterative-Closest-Point Method


In point cloud registration applications, noise and poor initial conditions lead to many false matches. False matches significantly degrade registration accuracy and speed. A penalty function is adopted in many robust point-to-point registration methods to suppress the influence of false matches. However, after applying a penalty function, problems cannot be solved in their analytical forms based on the introduction of nonlinearity. Therefore, most existing methods adopt the descending method. In this paper, a novel iterative-reweighting-based method is proposed to overcome the limitations of existing methods. The proposed method iteratively solves the eigenvectors of a four-dimensional matrix, whereas the calculation of the descending method relies on solving an eight-dimensional matrix. Therefore, the proposed method can achieve increased computational efficiency. The proposed method was validated on simulated noise corruption data, and the results reveal that it obtains higher efficiency and precision than existing methods, particularly under very noisy conditions. Experimental results for the KITTI dataset demonstrate that the proposed method can be used in real-time localization processes with high accuracy and good efficiency.

This is a preview of subscription content, access via your institution.


  1. [1]

    ELHOUSNI M, HUANG X M. A survey on 3D LiDAR localization for autonomous vehicles [C]//2020 IEEE Intelligent Vehicles Symposium (IV). Las Vegas, NV: IEEE, 2020: 1879–1884.

    Google Scholar 

  2. [2]

    BESL P J, MCKAY N D. A method for registration of 3-D shapes [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1992, 14(2): 239–256.

    Article  Google Scholar 

  3. [3]

    DEMPSTER A P, LAIRD N M, RUBIN D B. Maximum likelihood from incomplete data via the EM algorithm [J]. Journal of the Royal Statistical Society: Series B (Methodological), 1977, 39(1): 1–22.

    MathSciNet  MATH  Google Scholar 

  4. [4]

    ARUN K S, HUANG T S, BLOSTEIN S D. Least-squares fitting of two 3-D point sets [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987, 9(5): 698–700.

    Article  Google Scholar 

  5. [5]

    AGAMENNONI G, FONTANA S, SIEGWART R Y, et al. Point clouds registration with probabilistic data association [C]//2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). Daejeon: IEEE, 2016: 4092–4098.

    Google Scholar 

  6. [6]

    FITZGIBBON A W. Robust registration of 2D and 3D point sets [J]. Image and Vision Computing, 2003, 21(13/14): 1145–1153.

    Article  Google Scholar 

  7. [7]

    LEE Y J, SONG J B. Three-dimensional iterative closest point-based outdoor SLAM using terrain classification [J]. Intelligent Service Robotics, 2011, 4(2): 147–158.

    Article  Google Scholar 

  8. [8]

    HOLZ D, BEHNKE S. Sancta simplicitas — on the efficiency and achievable results of SLAM using ICP-based incremental registration [C]//2010 IEEE International Conference on Robotics and Automation. Anchorage, AK: IEEE, 2010: 1380–1387.

    Google Scholar 

  9. [9]

    CHO H, KIM E K, KIM S. Indoor SLAM application using geometric and ICP matching methods based on line features [J]. Robotics and Autonomous Systems, 2018, 100: 206–224.

    Article  Google Scholar 

  10. [10]

    RUSU R B, BLODOW N, MARTON Z C, et al. Aligning point cloud views using persistent feature histograms [C]//2008 IEEE/RSJ International Conference on Intelligent Robots and Systems. Nice: IEEE, 2008: 3384–3391.

    Google Scholar 

  11. [11]

    RUSU R B, BLODOW N, BEETZ M. Fast point feature histograms (FPFH) for 3D registration [C]//2009 IEEE International Conference on Robotics and Automation. Kobe: IEEE, 2009: 3212–3217.

    Google Scholar 

  12. [12]

    PAN Y, YANG B S, LIANG F X, et al. Iterative global similarity points: A robust coarse-to-fine integration solution for pairwise 3D point cloud registration [C]//2018 International Conference on 3D Vision (3DV). Verona: IEEE, 2018: 180–189.

    Google Scholar 

  13. [13]

    WU J, LIU M, ZHOU Z B, et al. Fast symbolic 3-D registration solution [J]. IEEE Transactions on Automation Science and Engineering, 2020, 17(2): 761–770.

    Article  Google Scholar 

  14. [14]

    WU J. Rigid 3-D registration: A simple method free of SVD and eigendecomposition [J]. IEEE Transactions on Instrumentation and Measurement, 2020, 69(10): 8288–8303.

    Google Scholar 

  15. [15]

    GEIGER A, LENZ P, STILLER C, et al. Vision meets robotics: The KITTI dataset [J]. The International Journal of Robotics Research, 2013, 32(11): 1231–1237.

    Article  Google Scholar 

  16. [16]

    BOYD S, VANDENBERGHE L. Convex optimization [M]. Cambridge: Cambridge University Press, 2004.

    Book  Google Scholar 

  17. [17]

    SBERT M, POCH J. A necessary and sufficient condition for the inequality of generalized weighted means [J]. Journal of Inequalities and Applications, 2016, 2016(1): 1–22.

    MathSciNet  Article  Google Scholar 

Download references

Author information



Corresponding author

Correspondence to Ming Yang.

Additional information

Foundation item

the National Natural Science Foundation of China (No. U1764264)

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zhang, J., Zhou, X. & Yang, M. Iterative-Reweighting-Based Robust Iterative-Closest-Point Method. J. Shanghai Jiaotong Univ. (Sci.) 26, 739–746 (2021).

Download citation

Key words

  • point cloud registration
  • iterative reweighting
  • iterative closest-point (ICP)
  • robust localization

CLC number

  • TP 242.6

Document code

  • A