This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

A Generalization of the ICP Algorithm for Articulated Bodies

S. Pellegrini, K. Schindler, and D. Nardi
British Machine Vision Conference (BMVC'08)
September 2008


The ICP algorithm has been extensively used in computer vision for registration and tracking purposes. The original formulation of this method is restricted to the use of non-articulated models. A straightforward generalisation to articulated structures is achievable through the joint minimisation of all the structure pose parameters, for example using Levenberg-Marquardt (LM) optimisation. However, in this approach the aligning transformation cannot be estimated in closed form, like in the original ICP, and the approach heavily suffers from local minima. To overcome this limitation, some authors have extended the straightforward generalisation at the cost of giving up some of the properties of ICP. In this paper, we present a generalisation of ICP to articulated structures, which preserves all the properties of the original algorithm. The key idea is to divide the articulated body into parts, which can be aligned rigidly in the way of the original ICP, with additional constraints to keep the articulated structure intact. Experiments show that our method reduces the residual registration error by a factor of ~2.

Download in pdf format
  author = {S. Pellegrini and K. Schindler and and D. Nardi},
  title = {A Generalization of the ICP Algorithm for Articulated Bodies},
  booktitle = {British Machine Vision Conference (BMVC'08)},
  year = {2008},
  month = {September},
  editor = {M. Everingham and C. Needham},
  keywords = {}