Sciweavers

141 search results - page 3 / 29
» The Parallel Iterative Closest Point Algorithm
Sort
View
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
14 years 1 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
3DIM
2003
IEEE
14 years 1 months ago
Geometrically Stable Sampling for the ICP Algorithm
The Iterative Closest Point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily ...
Natasha Gelfand, Szymon Rusinkiewicz, Leslie Ikemo...
JMIV
2010
95views more  JMIV 2010»
13 years 7 months ago
Registration of 2D Points Using Geometric Algebra and Tensor Voting
In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two...
Leo Reyes-Lozano, Gérard G. Medioni, Eduard...
ECCV
2004
Springer
14 years 10 months ago
A Correlation-Based Approach to Robust Point Set Registration
Correlation is a very effective way to align intensity images. We extend the correlation technique to point set registration using a method we call kernel correlation. Kernel corre...
Yanghai Tsin, Takeo Kanade
CVPR
2006
IEEE
14 years 10 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson