Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Pair-wise Registration of 3D/Color Data Sets with ICP

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)
Douadi, L. ; UMR CNRS, LIRMM, Montpellier ; Aldon, M.-J. ; Crosnier, A.

The ICP (iterative closest point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. The purpose of the work presented in this paper is to improve performance of classical ICP. We address, here, the problem of pair-wise registration of color range images. Many variants of ICP have been proposed for the registration of 3D data sets. However, there are only a few solutions dealing with color range images. In this paper, we have adapted some variants of ICP to take into account color information in the closest point research. Two approaches of color data integration have been evaluated with real 3D/color data sets

Published in:

Intelligent Robots and Systems, 2006 IEEE/RSJ International Conference on

Date of Conference:

Oct. 2006