Abstract
2D and 3D images can be mapped on a graph where scene elements are nodes and neighborhood is expressed by edges connecting the nodes. Assigning weights to edges that represent local properties of a good segmentation allows finding a segmentation using optimization methods on graphs.
Two such techniques that have been used for segmentation are minimum cost graph cuts and minimum cost paths. Methodology, parameterization, advantages, and problems for algorithms that are based on either of the two techniques are discussed in this chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
If the boundary is not closed, at least one non-saturated edge between source and sink would exist. Flow could be increased until this edge is saturated as well.
- 2.
It is possible that edges between two neighboring pixels are removed by this procedure which may make a pixel unreachable from S and T. This corresponds to segmentation boundaries that are broader than a pixel in methods such as the watershed transform. If this is undesirable, similar strategies as in WST have to be followed for assigning these pixels either to foreground or background.
References
Boykov Y, Jolly MP (2001) Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: 8th intl conf computer vision (ICCV’01), vol 1, pp 105–112
Boykov Y, Veksler O, Zabih R (2001) Fast approximate energy minimization via graph cuts. IEEE Trans Pattern Anal Mach Intell 23(11):1222–1239
Boykov Y, Kolmogorov V (2004) An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans Pattern Anal Mach Intell 26(9):1124–1137
Duchenne O, Audibert JY, Keriven R, Ponce J, Segonne F (2008) Segmentation by transduction. In: IEEE conf computer vision and pattern recognition, CVPR2008, pp 1–8
Falcao AX, Stolfi J, de Alencar Lotufo R (2004) The image foresting transform: theory, algorithms, and applications. IEEE Trans Pattern Anal Mach Intell 26(1):19–29
Funka-Lea G, Boykov Y, Florin C, Jolly MP, Moreau-Gobard R, Ramaraj R, Rinck D (2006) Automatic heart isolation for CT coronary visualization using graph-cuts. In: 3rd IEEE intl symp biomedical imaging: nano to macro, pp 614–617
Grady L, Funka-Lea G (2004) Multi-label image segmentation for medical applications based on graph-theoretic electrical potentials. In: Computer vision and mathematical methods in medical and biomedical image analysis. LNCS, vol 3117, pp 230–245
Grady L, Schiwietz T, Aharon S, Westermann R (2005) Random walks for interactive organ segmentation in two and three dimensions: implementation and validation. In: Medical image computing and computer-assisted intervention—MICCAI 2005. LNCS, vol 3750, pp 773–780
Grady L (2006) Random walks for image segmentation. IEEE Trans Pattern Anal Mach Intell 28(11):1768–1783
Herman GT, Carvalho BM (2001) Multiseeded segmentation using fuzzy connectedness. IEEE Trans Pattern Anal Mach Intell 23(5):460–474
Kolmogorov V, Zabih R (2004) What energy functions can be minimized via graph cuts? IEEE Trans Pattern Anal Mach Intell 26(2):147–159
Ng A, Jordan M, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Proc 14th ann conf advances in neural information processing systems, pp 849–856
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905
Tolliver DA, Miller GL (2006) Graph partitioning by spectral rounding: applications in image segmentation and clustering. Proc - IEEE Comput Soc Conf Comput Vis Pattern Recognit 1:1053–1060
Udupa JK, Samarasekera S (1996) Fuzzy connectedness and object definition: theory, algorithms, and applications in image segmentation. Graph Models Image Process 58(3):246–261
Udupa JK, Saha PK (2003) Fuzzy connectedness and image segmentation. Proc IEEE 91(10):1649–1669
Veksler O (2008) Star shape prior for graph-cut image segmentation. In: Computer vision—ECCV 2008. LNCS, vol 5304, pp 454–467
Vicente S, Kolmogorov V, Rother C (2008) Graph cut based image segmentation with connectivity priors. In: IEEE conf comp vision and pattern recognition, CVPR 2008: 1–8.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Toennies, K.D. (2012). Segmentation as a Graph Problem. In: Guide to Medical Image Analysis. Advances in Computer Vision and Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-4471-2751-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2751-2_8
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2750-5
Online ISBN: 978-1-4471-2751-2
eBook Packages: Computer ScienceComputer Science (R0)