77 search results - page 3 / 16 » Determining Correspondences and Rigid Motion of 3-D Point Se... |
ICIP
2008
IEEE
13 years 11 months ago
2008
IEEE
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
PAMI
2010
12 years 11 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
ICIP
2003
IEEE
14 years 6 months ago
2003
IEEE
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...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
We consider the problem of segmenting multiple rigid motions from point correspondences in multiple affine views. We cast this problem as a subspace clustering problem in which th...
ECCV
2006
Springer
13 years 8 months ago
2006
Springer
A scene containing multiple independently moving, possibly occluding, rigid objects is considered under the weak perspective camera model. We obtain a set of feature points tracke...