An extension of the ICP algorithm for modeling nonrigid objects with mobile robots

  • Authors:
  • Dirk Hahnel;Sebastian Thrun;Wolfram Burgard

  • Affiliations:
  • University of Freiburg, Department of Computer Science, Germany;Carnegie Mellon University, School of Computer Science, PA;University of Freiburg, Department of Computer Science, Germany

  • Venue:
  • IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The iterative closest point (ICP) algorithm [2] is a popular method for modeling 3D objects from range data. The classical ICP algorithm rests on a rigid surface assumption. Building on recent work on nonrigid object models [5; 16; 9], this paper presents an ICP algorithm capable of modeling nonrigid objects, where individual scans may be subject to local deformations. We describe an integrated mathematical framework for simultaneously registering scans and recovering the surface configuration. To tackle the resulting high-dimensional optimization problems, we introduce a hierarchical method that first matches a coarse skeleton of scan points, then adapts local scan patches. The approach is implemented for a mobile robot capable of acquiring 3D models of objects.