Robust Registration of 2D and 3D Point Sets

This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt algorithm). The surprising conclusion of the paper is that this technique is comparable in speed to the special-purpose Iterated Closest Point algorithm, which is most commonly used for this task. Because the routine directly minimizes an energy function, it is easy to extend it to incorporate robust estimation via a Huber kernel, yielding a basin of convergence that is many times wider than existing techniques. Finally, we introduce a data structure for the minimization based on the chamfer distance transform, which yields an algorithm that is both faster and more robust than previously described methods. q 2003 Published by Elsevier B.V.

• Type: Conference
• Year: 2001
• Where: BMVC
• Authors: Andrew W. Fitzgibbon
• Keywords: BMVC 2001, Closest Point Algorithm, Computer Vision, General-purpose Non-linear Optimization, Incorporate Robust Estimation