Sciweavers

111 search results - page 3 / 23
» The Trimmed Iterative Closest Point Algorithm
Sort
View
3DIM
2007
IEEE
13 years 11 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
13 years 9 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
13 years 10 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 3 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 7 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