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

DOI10.1007/s11075-016-0170-3zbMath1361.65038OpenAlexW2461794017MaRDI QIDQ513664

Ove Edlund, Per Bergström

Publication date: 7 March 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0170-3

zbMATH Keywords

robustsurfaceconvergencenumerical resultsrotationtranslationtrust region methodM-estimationiterative closest point algorithmspoint-to-plane distance minimizationpoint-to-point distance minimizationrigid body transformation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Uses Software

• robustbase

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust registration of point sets using iteratively reweighted least squares
• A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
• Refinements to nearest-neighbor searching in k-dimensional trees
• An adaptive trust region method based on simple conic models
• Perturbation analysis of the orthogonal Procrustes problem
• Efficient sparse ICP
• Recent advances in trust region algorithms
• A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
• Geometry and convergence analysis of algorithms for registration of 3D shapes
• Two globally convergent nonmonotone trust-region methods for unconstrained optimization
• Computing Optimal Locally Constrained Steps
• Analysis of Measurements Based on the Singular Value Decomposition
• Newton’s Method with a Model Trust Region Modification
• Trust Region Methods
• Robust Statistics
• A Filter-Trust-Region Method for Unconstrained Optimization
• Robust Statistics