310 search results - page 48 / 62 » Cutting two graphs simultaneously |
100
click to vote
ICIG
2009
IEEE
14 years 7 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Image segmentation techniques typically require proper weighting of competing data fidelity and regularization terms. Conventionally, the associated parameters are set t...
GRAPHICSINTERFACE
2008
14 years 11 months ago
2008
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
ECCC
2010
14 years 7 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Reseachers have verified that clothing provides information about the identity of the individual. To extract features from the clothing, the clothing region first must be localize...