Share Email Print
cover

Proceedings Paper

Iterative closest point algorithm with anisotropic weighting and its application to fine surface registration
Author(s): L. Maier-Hein; T. R. dos Santos; A. M. Franz; H.-P. Meinzer; J. M. Fitzpatrick
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The Iterative Closest Point (ICP) algorithm is a widely used method for geometric alignment of 3D models. Given two roughly aligned shapes represented by two point sets, the algorithm iteratively establishes point correspondences given the current alignment of the data and computes a rigid transformation accordingly. It can be shown that the method converges to an at least local minimimum with respect to a mean-square distance metric. From a statistical point of view, the algorithm implicitly assumes that the points are observed with isotropic Gaussian noise. In this paper, we (1) present the first variant of the ICP that accounts for anisotropic localization uncertainty in both shapes as well as in both steps of the algorithm and (2) show how to apply the method for robust fine registration of surface meshes. According to an evaluation on medical imaging data, the proposed method is better suited for fine surface registration than the original ICP, reducing the target registration error (TRE) for a set of targets located inside or near the mesh by 80% on average.

Paper Details

Date Published: 11 March 2011
PDF: 9 pages
Proc. SPIE 7962, Medical Imaging 2011: Image Processing, 79620W (11 March 2011); doi: 10.1117/12.873060
Show Author Affiliations
L. Maier-Hein, German Cancer Research Ctr. (Germany)
T. R. dos Santos, German Cancer Research Ctr. (Germany)
A. M. Franz, German Cancer Research Ctr. (Germany)
H.-P. Meinzer, German Cancer Research Ctr. (Germany)
J. M. Fitzpatrick, Vanderbilt Univ. (United States)


Published in SPIE Proceedings Vol. 7962:
Medical Imaging 2011: Image Processing
Benoit M. Dawant; David R. Haynor, Editor(s)

© SPIE. Terms of Use
Back to Top