By Topic

Robust geometric registration of 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)
Yonghuai Liu ; Dept. of Comput. Sci., Univ. of Wales, Aberystwyth, UK

In this paper, we propose a novel algorithm to evaluate the possible point matches established by the traditional ICP algorithm in the process of registering two overlapping range images represented as two sets of unorganised points. While the existing methods mainly use feature matching to establish or evaluate possible correspondences between the images to be registered, our novel approach applies motion consistency constraints to evaluate the possible correspondences. In order to accelerate the search for the closest points from the transformed first image points to the second image points, the optimised K-D tree data structure is employed. A comparative study based on real images has shown that the proposed algorithm is accurate, robust and efficient for the automatic registration of overlapping range images.

Published in:

Industrial Electronics Society, 2003. IECON '03. The 29th Annual Conference of the IEEE  (Volume:3 )

Date of Conference:

2-6 Nov. 2003