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

Morphological techniques in the iterative closest point algorithm

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)
Kapoutsis, C.A. ; Dept. of Inf., Thessaloniki Univ., Greece ; Vavoulidis, C.P. ; Pitas, I.

This paper describes a method for the accurate and computationally efficient registration of 3-D shapes. The method is based on the iterative closest point (ICP) algorithm and improves it by dramatically decreasing the computational cost of the algorithm's most inefficient step, namely the implementation of the closest point operator. The decrease is achieved with the help of a 3-D volume containing the points to be registered. Prior to the implementation of the ICP algorithm, the Voronoi diagram of the “model” points is constructed in the volume, by means of the morphological Voronoi tesselation method with respect to the Euclidean distance metric. The use of the tesselated volume renders the calculation of the closest point operator extremely fast and speeds up the ICP algorithm tremendously

Published in:

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on  (Volume:1 )

Date of Conference:

4-7 Oct 1998