Sciweavers

422 search results - page 1 / 85
» Structure from Motion with Missing Data is NP-Hard
Sort
View
ICCV
2007
IEEE
14 years 3 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
15 years 4 months ago
Sparse Subspace Clustering
We propose a method based on sparse representation (SR) to cluster data drawn from multiple low-dimensional linear or affine subspaces embedded in a high-dimensional space. Our ...
Ehsan Elhamifar, René Vidal
ICCV
2001
IEEE
14 years 11 months ago
Classifying and Solving Minimal Structure and Motion Problems with Missing Data
In this paper we investigate the structure and motion problem for calibrated one-dimensional projections of a two-dimensional environment. In a previous paper the structure and mo...
Kalle Åström, Magnus Oskarsson, Niels C...
NIPS
2003
13 years 10 months ago
Factorization with Uncertainty and Missing Data: Exploiting Temporal Coherence
The problem of “Structure From Motion” is a central problem in vision: given the 2D locations of certain points we wish to recover the camera motion and the 3D coordinates of ...
Amit Gruber, Yair Weiss
CVPR
2004
IEEE
14 years 11 months ago
Multibody Factorization with Uncertainty and Missing Data Using the EM Algorithm
Multibody factorization algorithms [2, 1, 16] give an elegant and simple solution to the problem of structure from motion even for scenes containing multiple independent motions. ...
Amit Gruber, Yair Weiss