17 search results - page 1 / 4 » Pair-wise Registration of 3D Color Data Sets with ICP |
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
- 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. ...
ICIP
2003
IEEE
14 years 7 months ago
2003
IEEE
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...
3DIM
1997
IEEE
13 years 9 months ago
1997
IEEE
In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple tex...
VMV
2003
13 years 6 months ago
2003
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...