Journal
IMAGE AND VISION COMPUTING
Volume 21, Issue 13-14, Pages 1145-1153Publisher
ELSEVIER
DOI: 10.1016/j.imavis.2003.09.004
Keywords
iterated closest point; range image registration; Levenberg-Marquardt
Ask authors/readers for more resources
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. (C) 2003 Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available