Sciweavers

141 search results - page 5 / 29
» The Parallel Iterative Closest Point Algorithm
Sort
View
3DIM
2007
IEEE
14 years 3 months ago
Outlier Robust ICP for Minimizing Fractional RMSD
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms...
Jeff M. Phillips, Ran Liu, Carlo Tomasi
IJRR
2007
80views more  IJRR 2007»
13 years 8 months ago
Fast Laser Scan Matching using Polar Coordinates
In this paper a novel Polar Scan Matching (PSM) approach is described that works in the laser scanner’s polar coordinate system, therefore taking advantage of the structure of t...
Albert Diosi, Lindsay Kleeman
IROS
2006
IEEE
163views Robotics» more  IROS 2006»
14 years 2 months ago
Pair-wise Registration of 3D/Color Data Sets with ICP
- 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. ...
Lounis Douadi, Marie-José Aldon, Andr&eacut...
VECPAR
2000
Springer
14 years 6 days ago
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
Jordi Castro, Antonio Frangioni
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
14 years 1 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli