2219 search results - page 133 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
132
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
118
click to vote
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Detecting moving objects against dynamic backgrounds remains a challenge in computer vision and robotics. This paper presents a surprisingly simple algorithm to detect ob...
136
Voted
CVPR
2008
IEEE
16 years 4 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-...
124
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We study the challenging problem of maneuvering object tracking with unknown dynamics, i.e., forces or torque. We investigate the underlying causes of object kinematics, and propo...
129
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...