Sciweavers

1115 search results - page 4 / 223
» Active Graph Cuts
Sort
View
ACCV
2009
Springer
14 years 2 months ago
Iterated Graph Cuts for Image Segmentation
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
Bo Peng, Lei Zhang, Jian Yang
EMMCVPR
2011
Springer
12 years 7 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
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...
Björn Scheuermann, Bodo Rosenhahn
ICPR
2008
IEEE
14 years 2 months ago
Medical image segmentation via min s-t cuts with sides constraints
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...
Jiun-Hung Chen, Linda G. Shapiro
ICPR
2008
IEEE
14 years 9 months ago
Saliency Cuts: An automatic approach to object segmentation
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...
Yu Fu, Jian Cheng, Zhenglong Li, Hanqing Lu
SODA
2012
ACM
262views Algorithms» more  SODA 2012»
11 years 10 months ago
A polynomial-time approximation scheme for planar multiway cut
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...