Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach

被引:24
|
作者
Bergstrom, Per [1 ]
Edlund, Ove [1 ]
机构
[1] Lulea Univ Technol, Dept Engn Sci & Math, Div Math Sci, SE-97187 Lulea, Sweden
关键词
ICP; M-estimation; Registration; Robust; Surface; Trust region; 3-DIMENSIONAL SHAPE MEASUREMENT; OF-THE-ART;
D O I
10.1007/s11075-016-0170-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The problem of finding a rigid body transformation, which aligns a set of data points with a given surface, using a robust M-estimation technique is considered. A refined iterative closest point (ICP) algorithm is described where a minimization problem of point-to-plane distances with a proposed constraint is solved in each iteration to find an updating transformation. The constraint is derived from a sum of weighted squared point-to-point distances and forms a natural trust region, which ensures convergence. Only a minor number of additional computations are required to use it. Two alternative trust regions are introduced and analyzed. Finally, numerical results for some test problems are presented. It is obvious from these results that there is a significant advantage, with respect to convergence rate of accuracy, to use the proposed trust region approach in comparison with using point-to-point distance minimization as well as using point-to-plane distance minimization and a Newton- type update without any step size control.
引用
收藏
页码:755 / 779
页数:25
相关论文
共 50 条
  • [41] Probability iterative closest point algorithm for m-D point set registration with noise
    Du, Shaoyi
    Liu, Juan
    Zhang, Chunjia
    Zhu, Jihua
    Li, Ke
    NEUROCOMPUTING, 2015, 157 : 187 - 198
  • [42] The trimmed iterative closest point algorithm
    Chetverikov, D
    Svirko, D
    Stepanov, D
    Krsek, P
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL III, PROCEEDINGS, 2002, : 545 - 548
  • [43] Morphological iterative closest point algorithm
    Kapoutsis, CA
    Vavoulidis, CP
    Pitas, I
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 1999, 8 (11) : 1644 - 1646
  • [44] The parallel iterative closest point algorithm
    Langis, C
    Greenspan, M
    Godin, G
    THIRD INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING, PROCEEDINGS, 2001, : 195 - 202
  • [45] A Survey of Iterative Closest Point Algorithm
    Wang, Fang
    Zhao, Zijian
    2017 CHINESE AUTOMATION CONGRESS (CAC), 2017, : 4395 - 4399
  • [46] CIRCULAR TRAJECTORY CORRESPONDENCES FOR ITERATIVE CLOSEST POINT REGISTRATION
    Suominen, Olli
    Gotchev, Atanas
    2013 3DTV-CONFERENCE: THE TRUE VISION-CAPTURE, TRANSMISSION AND DISPALY OF 3D VIDEO (3DTV-CON), 2013,
  • [47] Adaptive weighted robust iterative closest point
    Guo, Yu
    Zhao, Luting
    Shi, Yan
    Zhang, Xuetao
    Du, Shaoyi
    Wang, Fei
    NEUROCOMPUTING, 2022, 508 : 225 - 241
  • [48] Soft shape context for iterative closest point registration
    Liu, D
    Chen, T
    ICIP: 2004 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1- 5, 2004, : 1081 - 1084
  • [49] Iterative Closest Point Algorithm with Anisotropic Weighting and its Application to Fine Surface Registration
    Maier-Hein, L.
    dos Santos, T. R.
    Franz, A. M.
    Meinzer, H. -P.
    Fitzpatrick, J. M.
    MEDICAL IMAGING 2011: IMAGE PROCESSING, 2011, 7962
  • [50] The dual-bootstrap iterative closest point algorithm with application to retinal image registration
    Stewart, CV
    Tsai, CL
    Roysam, B
    IEEE TRANSACTIONS ON MEDICAL IMAGING, 2003, 22 (11) : 1379 - 1394