By Topic

Registering two overlapping range images

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
$33 $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

1 Author(s)
G. Roth ; Visual Inf. Technol. Group, Nat. Res. Council of Canada, Ottawa, Ont., Canada

The paper describes a method of automatically performing the registration of two range images that have significant overlap. We first find points of interest in the intensity data that comes with each range image. Then we perform a triangulation of the 3D range points associated with these 2D interest points. All possible pairs of triangles between the two 3D triangulations are then matched. The fact that we have 3D data available makes it possible to efficiently prune matches. We do this pruning by using a simple and effective set of compatibility tests between potentially matching triangles and vertices. The best match is the one that aligns the largest number of interest points between the two range images. The algorithms are demonstrated experimentally on a number of different range image pairs

Published in:

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

Date of Conference: