666 search results - page 3 / 134 » Unbalanced Graph Cuts |
EMMCVPR
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
CVPR
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
Interactive graph cuts are widely used in object segmentation but with some disadvantages: 1) Manual interactions may cause inaccurate or even incorrect segmentation results and i...