Sciweavers

7 search results - page 1 / 2
» Geometrically Stable Sampling for the ICP Algorithm
Sort
View
81
Voted
3DIM
2003
IEEE
15 years 2 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...
3DIM
2001
IEEE
15 years 1 months 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
ICPR
2006
IEEE
15 years 3 months ago
A Pixel-wise Object Tracking Algorithm with Target and Background Sample
In this paper, we present a clustering-based tracking algorithm for non-rigid object. Non-rigid object tracking is a challenging task because the target often appears as a concave...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
14 years 7 months ago
RANSAC matching: Simultaneous registration and segmentation
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample conse...
Shao-Wen Yang, Chieh-Chih Wang, Chun-Hua Chang
TSP
2008
117views more  TSP 2008»
14 years 9 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do