2219 search results - page 72 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
ACCV
2007
Springer
14 years 4 months ago
2007
Springer
In the paper, we proposed a method for moving human detection in video frames by motion contour matching. Firstly, temporal and spatial difference of frames is calculated and conto...
ICCV
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
CVPR
2004
IEEE
15 years 6 days ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...