Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CAIP
1997
Springer

favoriteEmaildiscussreport

141views Image Analysis» more CAIP 1997»

Morphological Iterative Closest Point Algorithm

13 years 8 months ago

Morphological Iterative Closest Point Algorithm

Download poseidon.csd.auth.gr

Abstract—This work presents a method for the registration of threedimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the “model” shape points is ﬁrst constructed in the volume. Then this is used for the calculation of the closest point operator. This way a dramatic decrease of the computational cost is achieved.

C. P. Vavoulidis, Ioannis Pitas

Real-time Traffic

CAIP 1997 | Closest Point | Closest Point Operator | Image Analysis | Iterative Closest Point |

claim paper

Related Content

» The Trimmed Iterative Closest Point Algorithm

» Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point ...

» The Parallel Iterative Closest Point Algorithm

» A generalization of the metricbased Iterative Closest Point technique for 3D scan matching

» Robust Generalized Total Least Squares Iterative Closest Point Registration

» Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes

» Dynamic time warping for binocular hand tracking and reconstruction

» A Nearest Neighbor Method for Efficient ICP

» Cached kd tree search for ICP algorithms

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	CAIP
Authors	C. P. Vavoulidis, Ioannis Pitas

Comments (0)