422 search results - page 3 / 85 » Structure from Motion with Missing Data is NP-Hard |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Practically all existing approaches to structure and motion computation use only positive image correspondences to verify the camera pose hypotheses. Incorrect epipolar geometries...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In this paper we propose a new method for the simultaneous segmentation and 3D reconstruction of interest point based articulated motion. We decompose a set of point tracks into r...
CVPR
1996
IEEE
14 years 9 months ago
1996
IEEE
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...