Sciweavers

506 search results - page 12 / 102
» Robust Registration of 2D and 3D Point Sets
Sort
View
CVPR
2008
IEEE
15 years 4 months ago
3D face tracking and expression inference from a 2D sequence using manifold learning
We propose a person-dependent, manifold-based approach for modeling and tracking rigid and nonrigid 3D facial deformations from a monocular video sequence. The rigid and nonrigid ...
Wei-Kai Liao, Gérard G. Medioni
ECCV
2004
Springer
15 years 11 months ago
Hand Motion from 3D Point Trajectories and a Smooth Surface Model
A method is proposed to track the full hand motion from 3D points reconstructed using a stereoscopic set of cameras. This approach combines the advantages of methods that use 2D mo...
Guillaume Dewaele, Frederic Devernay, Radu Horaud
ICIP
2003
IEEE
15 years 11 months ago
A refined ICP algorithm for robust 3-D correspondence estimation
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
Heinrich Niemann, Jochen Schmidt, Timo Zinße...
TOG
2008
253views more  TOG 2008»
14 years 9 months ago
4-points congruent sets for robust pairwise surface registration
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
Dror Aiger, Niloy J. Mitra, Daniel Cohen-Or
SIBGRAPI
2006
IEEE
15 years 3 months ago
Determining the branchings of 3D structures from respective 2D projections
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
Jorge J. G. Leandro, Roberto M. Cesar, Luciano da ...