Abstract
An N-dimensional image is divided into “object” and “background” segments using a graph cut approach. A graph is formed by connecting all pairs of neighboring image pixels (voxels) by weighted edges. Certain pixels (voxels) have to be a priori identified as object or background seeds providing necessary clues about the image content. Our objective is to find the cheapest way to cut the edges in the graph so that the object seeds are completely separated from the background seeds. If the edge cost is a decreasing function of the local intensity gradient then the minimum cost cut should produce an object/background segmentation with compact boundaries along the high intensity gradient values in the image. An efficient, globally optimal solution is possible via standard min-cut/max-flow algorithms for graphs with two terminals. We applied this technique to interactively segment organs in various 2D and 3D medical images.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Amini, A.A., Weymouth, T.E., Jain, R.C.: Using dynamic programming for solving variational problems in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(9), 855–867 (1990)
Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998)
Cohen, L.D.: On active contour models and ballons. Computer Vision, Graphics, and Image Processing: Image Understanding 53(2), 211–218 (1991)
Cohen, L.D., Cohen, I.: Finite element methods for active contour models and ballons for 2-d and 3-d images. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(11), 1131–1147 (1993)
Cox, I.J., Rao, S.B., Zhong, Y.: Ratio regions: A technique for image segmentation. In: International Conference on Pattern Recognition, vol. II, pp. 557–564 (1996)
Dubuisson-Jolly, M.-P., Liang, C.-C., Gupta, A.: Optimal polyline tracking for artery motion compensation in coronary angiography. In: International Conference on Computer Vision, pp. 414–419 (1998)
Falcão, A.X., Udupa, J.K., Samarasekera, S., Sharma, S.: User-steered image segmentation paradigms: Live wire and live lane. Graphical Models and Image Processing 60, 233–260 (1998)
Flickner, M., Sawhney, H., Pryor, D., Lotspiech, J.: Intelligent interactive image outlining using spline snakes. In: Asilomar Conference on Signals, Systems, and Computers, vol. 1, pp. 731–735 (1994)
Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
Geiger, D., Gupta, A., Costa, L.A., Vlontzos, J.: Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(3), 294–402 (1995)
Goldberg, A., Tarjan, R.: A new approach to the maximum flow problem. Journal of the Association for Computing Machinery 35(4), 921–940 (1988)
Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B 51(2), 271–279 (1989)
Griffin, L.D., Colchester, A.C.F., Röll, S.A., Studholme, C.S.: Hierarchical segmentation satisfying constraints. In: British Machine Vision Conference, pp. 135–144 (1994)
Haralick, R.M., Shapiro, L.G.: Computer and Robot Vision. Addison-Wesley Publishing Company, Reading (1992)
Ishikawa, H., Geiger, D.: Segmentation by grouping junctions. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 125–131 (1998)
Jermyn, I.H., Ishikawa, H.: Globally optimal regions and boundaries. In: International Conference on Computer Vision, vol. II, pp. 904–910 (1999)
Kass, M., Witkin, A., Terzolpoulos, D.: Snakes: Active contour models. International Journal of Computer Vision 2, 321–331 (1988)
Mortensen, E.N., Barrett, W.A.: Interactive segmentation with intelligent scissors. Graphical Models and Image Processing 60, 349–384 (1998)
O’Donnell, T., Dubuisson-Jolly, M.-P., Gupta, A.: A cooperative framework for segmentation using 2D active contours and 3D hybrid models as applied to branching cylindrical structures. In: International Conference on Computer Vision, pp. 454–459 (1998)
Reese, L.J.: Intelligent paint: Region-based interactive image segmentation. Master’s thesis, Brigham Young University (1999)
Shi, J., Malik, J.: Normalized cuts and image segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 731–737 (1997)
Vehkomäki, T., Gerig, G., Székely, G.: A user-guided tool for efficient segmentation of medical image data. In: Troccaz, J., Mösges, R., Grimson, W.E.L. (eds.) CVRMed-MRCAS 1997, CVRMed 1997, and MRCAS 1997. LNCS, vol. 1205, pp. 685–694. Springer, Heidelberg (1997)
Williams, D.J., Shah, M.: A fast algorithm for active contours and curvature estimation. Computer Vision, Graphics, and Image Processing: Image Understanding 55(1), 14–26 (1992)
Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(11), 1101–1113 (1993)
Yuille, A., Hallinan, P.: Deformable templates. In: Blake, A., Yuille, A. (eds.) Active Vision, pp. 20–38. MIT Press, Cambridge (1992)
Zhu, S.C., Yuille, A.: Region competition: Unifying snakes, region growing, and Bayes/MDL for multiband image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(9), 884–900 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boykov, Y., Jolly, MP. (2000). Interactive Organ Segmentation Using Graph Cuts. In: Delp, S.L., DiGoia, A.M., Jaramaz, B. (eds) Medical Image Computing and Computer-Assisted Intervention – MICCAI 2000. MICCAI 2000. Lecture Notes in Computer Science, vol 1935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40899-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-40899-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41189-5
Online ISBN: 978-3-540-40899-4
eBook Packages: Springer Book Archive