14 search results - page 1 / 3 » A Maximum-Flow Formulation of the N-Camera Stereo Correspond... |
ICCV
1998
IEEE
13 years 9 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 ...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
CVPR
2011
IEEE
13 years 28 days ago
2011
IEEE
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
In this paper we analyze the problem of motion estimation from a sequence of stereo images. We formulate both the differential and discrete approaches of two methods. The differen...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
Conventional stereo matching algorithms assume color constancy on the corresponding opaque pixels in the stereo images. However, when the foreground objects with fractional bounda...