Sciweavers

323 search results - page 17 / 65
» Interactive Organ Segmentation Using Graph Cuts
Sort
View
MEMICS
2010
13 years 2 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
ICIAR
2010
Springer
13 years 6 months ago
Adaptive Regularization Parameter for Graph Cut Segmentation
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
Sema Candemir, Yusuf Sinan Akgul
ICIP
2007
IEEE
14 years 1 months ago
Graph Cut Segmentation with Nonlinear Shape Priors
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
James G. Malcolm, Yogesh Rathi, Allen Tannenbaum
TIP
2011
164views more  TIP 2011»
13 years 2 months ago
Multiregion Image Segmentation by Parametric Kernel Graph Cuts
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 14 days ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...