62 search results - page 6 / 13 » Global minimum cuts in surface embedded graphs |
PAMI
2010
13 years 2 months ago
2010
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
MICCAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
SCIA
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...