Sciweavers

115 search results - page 4 / 23
» Segmentation On Surfaces With The Closest Point Method
Sort
View
3DIM
2007
IEEE
14 years 2 months ago
Predetermination of ICP Registration Errors And Its Application to View Planning
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
Kok-Lim Low, Anselmo Lastra
PAMI
2010
222views more  PAMI 2010»
13 years 6 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
ICPR
2004
IEEE
14 years 8 months ago
A Statistical Shape Model without Using Landmarks
This paper describes the construction of a statistical shape model based on the iterative closest point algorithm. The method does not require manual nor automatic identification ...
Frans Vos, Paul W. de Bruin, J. G. M. Aubel, Geert...
CVPR
2007
IEEE
14 years 9 months ago
Optimal Step Nonrigid ICP Algorithms for Surface Registration
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...
Brian Amberg, Sami Romdhani, Thomas Vetter
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
13 years 5 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