62 search results - page 5 / 13 » Global minimum cuts in surface embedded graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents the Visual Threat Awareness (VISTA) system for real time collision obstacle detection for an unmanned air vehicle (UAV). Computational stereo performance ha...
ACIVS
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
JCT
2002
13 years 7 months ago
2002
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...