252 search results - page 6 / 51 » Motion graphs |
DAGM
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
ALGORITHMICA
2010
13 years 8 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
RAS
2008
13 years 8 months ago
2008