Sciweavers

141 search results - page 6 / 29
» The Parallel Iterative Closest Point Algorithm
Sort
View
ICPR
2004
IEEE
14 years 9 months ago
A Statistical Shape Model without Using Landmarks
This paper describes the construction of a statistical shape model based on the iterative closest point algorithm. The method does not require manual nor automatic identification ...
Frans Vos, Paul W. de Bruin, J. G. M. Aubel, Geert...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 6 months ago
Unsupervised discovery of repetitive objects
We present a novel approach for unsupervised discovery of repetitive objects from 3D point clouds. Our method assumes that objects are geometrically consistent, and uses multiple o...
Jiwon Shin, Rudolph Triebel, Roland Siegwart
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 3 months ago
Evaluation of 3D registration reliability and speed - A comparison of ICP and NDT
Abstract— To advance robotic science it is important to perform experiments that can be replicated by other researchers to compare different methods. However, these comparisons t...
Martin Magnusson 0002, Andreas Nüchter, Chris...
ICVS
2009
Springer
14 years 3 months ago
GPU-Accelerated Nearest Neighbor Search for 3D Registration
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
Deyuan Qiu, Stefan May, Andreas Nüchter
3DIM
2001
IEEE
14 years 9 days ago
Efficient Variants of the ICP Algorithm
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
Szymon Rusinkiewicz, Marc Levoy