TY - JOUR

T1 - On the performance of the ICP algorithm

AU - Ezra, Esther

AU - Sharir, Micha

AU - Efrat, Alon

N1 - Funding Information:
✩ Work on this paper by the first two authors has been supported by NSF Grants CCR-00-98246 and CCF-05-14079, by a grant from the US– Israeli Binational Science Foundation, work by the second author was also supported by Grant 155/05 from the Israel Science Fund, and by the Hermann Minkowski–MINERVA Center for Geometry at Tel Aviv University. Work on this paper by the last author has been partially supported by an NSF CAREER award (CCR-03-48000) and an ITR/Collaborative Research grant (03-12443). A preliminary version of this paper has been presented in Proc. 22nd Annu. ACM Sympos. Comput. Geom. 2006, and in Proc. 22nd European Workshop on Computational Geometry, 2006. * Corresponding author. E-mail addresses: estere@tau.ac.il (E. Ezra), michas@tau.ac.il (M. Sharir), alon@cs.arizona.edu (A. Efrat).
Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.

PY - 2008/10

Y1 - 2008/10

N2 - We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay as a successful heuristic for matching of point sets in d-space under translation, but so far it seems not to have been rigorously analyzed. We consider two standard measures of resemblance that the algorithm attempts to optimize: The RMS (root mean squared distance) and the (one-sided) Hausdorff distance. We show that in both cases the number of iterations performed by the algorithm is polynomial in the number of input points. In particular, this bound is quadratic in the one-dimensional problem, under the RMS measure, for which we present a lower bound construction of Ω(nlogn) iterations, where n is the overall size of the input. Under the Hausdorff measure, this bound is only O(n) for input point sets whose spread is polynomial in n, and this is tight in the worst case. We also present several structural geometric properties of the algorithm under both measures. For the RMS measure, we show that at each iteration of the algorithm the cost function monotonically and strictly decreases along the vector Δt of the relative translation. As a result, we conclude that the polygonal path π, obtained by concatenating all the relative translations that are computed during the execution of the algorithm, does not intersect itself. In particular, in the one-dimensional problem all the relative translations of the ICP algorithm are in the same (left or right) direction. For the Hausdorff measure, some of these properties continue to hold (such as monotonicity in one dimension), whereas others do not.

AB - We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay as a successful heuristic for matching of point sets in d-space under translation, but so far it seems not to have been rigorously analyzed. We consider two standard measures of resemblance that the algorithm attempts to optimize: The RMS (root mean squared distance) and the (one-sided) Hausdorff distance. We show that in both cases the number of iterations performed by the algorithm is polynomial in the number of input points. In particular, this bound is quadratic in the one-dimensional problem, under the RMS measure, for which we present a lower bound construction of Ω(nlogn) iterations, where n is the overall size of the input. Under the Hausdorff measure, this bound is only O(n) for input point sets whose spread is polynomial in n, and this is tight in the worst case. We also present several structural geometric properties of the algorithm under both measures. For the RMS measure, we show that at each iteration of the algorithm the cost function monotonically and strictly decreases along the vector Δt of the relative translation. As a result, we conclude that the polygonal path π, obtained by concatenating all the relative translations that are computed during the execution of the algorithm, does not intersect itself. In particular, in the one-dimensional problem all the relative translations of the ICP algorithm are in the same (left or right) direction. For the Hausdorff measure, some of these properties continue to hold (such as monotonicity in one dimension), whereas others do not.

KW - Hausdorff distance

KW - ICP algorithm

KW - Nearest neighbors

KW - Pattern matching

KW - RMS

KW - Voronoi diagrams

UR - http://www.scopus.com/inward/record.url?scp=84867946872&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867946872&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2007.10.007

DO - 10.1016/j.comgeo.2007.10.007

M3 - Article

AN - SCOPUS:84867946872

VL - 41

SP - 77

EP - 93

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 1-2

ER -