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

被引:25
作者
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
相关论文
共 54 条
[1]   Two globally convergent nonmonotone trust-region methods for unconstrained optimization [J].
Ahookhosh M. ;
Ghaderi S. .
Journal of Applied Mathematics and Computing, 2016, 50 (1-2) :529-555
[2]   A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems [J].
Ahookhosh, Masoud ;
Amini, Keyvan .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (03) :411-422
[3]   4-points congruent sets for robust pairwise surface registration [J].
Aiger, Dror ;
Mitra, Niloy J. ;
Cohen-Or, Daniel .
ACM TRANSACTIONS ON GRAPHICS, 2008, 27 (03)
[4]  
[Anonymous], 2000, MOS-SIAM SER OPTIMIZ
[5]  
[Anonymous], 1986, ROBUST STAT
[6]  
[Anonymous], 1987, Unconstrained Optimization: Practical Methods of Optimization
[7]   LEAST-SQUARES FITTING OF 2 3-D POINT SETS [J].
ARUN, KS ;
HUANG, TS ;
BLOSTEIN, SD .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (05) :699-700
[8]   Robust registration of point sets using iteratively reweighted least squares [J].
Bergstrom, Per ;
Edlund, Ove .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 58 (03) :543-561
[9]   Repeated surface registration for on-line use [J].
Bergstrom, Per ;
Edlund, Ove ;
Soderkvist, Inge .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 54 (5-8) :677-689
[10]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256