Intelligent Connected Vehicle

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

Expand
  • (1. Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China;2. Key Laboratory of System Control and Information Processing of Ministry of Education, Shanghai 200240, China; 3. Noblelift Intelligent Equipment Co., Ltd., Huzhou 313100, Zhejiang, China)

Received date: 2021-02-20

  Online published: 2021-10-28

Abstract

In point cloud registration applications, noise and poor initial conditions lead to many false matches. False matches signi?cantly degrade registration accuracy and speed. A penalty function is adopted in many robust point-to-point registration methods to suppress the in?uence 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 e?ciency. The proposed method was validated on simulated noise corruption data, and the results reveal that it obtains higher e?ciency 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 e?ciency.

Cite this article

ZHANG Jianlin (张建林), ZHOU Xuejun (周学军), YANG Ming (杨 明) . Iterative-Reweighting-Based Robust Iterative-Closest-Point Method[J]. Journal of Shanghai Jiaotong University(Science), 2021 , 26(5) : 739 -746 . DOI: 10.1007/s12204-021-2364-7

References

[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. [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. [3] DEMPSTER A P, LAIRD N M, RUBIN D B. Maxi-mum likelihood from incomplete data via the EM al-gorithm [J]. JournaloftheRoyalStatistical Society: Series B (Methodological), 1977, 39(1): 1-22. [4] ARUN K S, HUANG T S, BLOSTEIN S D. Least-squares ?tting of two 3-D point sets [J]. IEEE Trans-actions on Pattern Analysis and Machine Intelligence, 1987, 9(5): 698-700. [5] AGAMENNONI G, FONTANA S, SIEGWART R Y, et al. Point clouds registration with probabilistic data association [C]//2016 IEEE/RSJ International Con-ference on Intelligent Robots and Systems (IROS ). Daejeon: IEEE, 2016: 4092-4098. [6] FITZGIBBON A W. Robust registration of 2D and 3D point sets [J]. Image and Vision Computing, 2003, 21(13/14): 1145-1153. [7] LEE Y J, SONG J B. Three-dimensional iterative clos-est point-based outdoor SLAM using terrain classi?ca-tion [J]. Intelligent Service Robotics, 2011, 4(2): 147-158. [8] HOLZ D, BEHNKE S. Sancta simplicitas - on the ef-?ciency and achievable results of SLAM using ICP-based incremental registration [C]//2010 IEEE Inter-national Conference on Robotics and Automation.An-chorage, AK: IEEE, 2010: 1380-1387. [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. [10] RUSU R B, BLODOW N, MARTON Z C, et al. Align-ing point cloud views using persistent feature his-tograms [C]//2008 IEEE/RSJ International Confer-ence on Intelligent Robots and Systems.Nice: IEEE, 2008: 3384-3391. [11] RUSU R B, BLODOW N, BEETZ M. Fast point fea-ture histograms (FPFH) for 3D registration [C]//2009 IEEE International Conference on Robotics and Au-tomation. Kobe: IEEE, 2009: 3212-3217. [12] PAN Y, YANG B S, LIANG F X, et al. Iterative global similarity points: A robust coarse-to-?ne inte-gration solution for pairwise 3D point cloud registra-tion [C]//2018 International Conference on 3D Vision (3DV ). Verona: IEEE, 2018: 180-189. [13] WU J, LIU M, ZHOU Z B, et al. Fast symbolic 3-D reg-istration solution [J]. IEEE Transactions on Automa-tion Science and Engineering, 2020, 17(2): 761-770. [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. [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. [16] BOYD S, VANDENBERGHE L. Convex optimization [M]. Cambridge: Cambridge University Press, 2004. [17] SBERT M, POCH J. A necessary and su?cient condi-tion for the inequality of generalized weighted means [J]. Journal of Inequalities and Applications, 2016, 2016(1): 1-22.
Outlines

/