By Topic

Fast and robust registration of 3D surfaces using low curvature patches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nguyen, V.-D. ; GE R&D, Schenectady, NY, USA ; Nzomigni, V. ; Stewart, C.V.

The paper describes a novel range data registration algorithm, specifically designed for accuracy, speed, and robustness. Like many recent registration techniques, our Robust-Closest-Patch algorithm (RCP) iteratively matches model patches to data surfaces based on the current pose and then re-estimates pose based on these matches. RCP has several novel features: 1) online registration is driven by low curvature patches computed from the model offline; 2) an approximate normal distance between a patch and a surface is used, avoiding the need to estimate local surface normal and curvature from noisy data; 3) pose is solved exactly by a linear system in six parameters, using a symmetric formulation of the rotation constraint; 4) robustness is ensured using an M-estimator that estimates both the rigid pose parameters and the error standard deviation. Results are shown using models and range data from turbine blade inspection

Published in:

3-D Digital Imaging and Modeling, 1999. Proceedings. Second International Conference on

Date of Conference:

1999