1115 search results - page 9 / 223 » Active Graph Cuts |
173
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
187
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
In this paper, we propose a novel predictive model for
object boundary, which can integrate information from any
sources. The model is a dynamic “object” model whose
manifes...
126
click to vote
DAM
2008
15 years 3 months ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
122
Voted
DAM
2006
15 years 3 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
154
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...