Graph cut-based segmentation

Jens Petersen, Ipek Oguz, Marleen de Bruijne

Abstract

This chapter describes how to use graph cut methods for medical image segmentation. Graph cut methods are designed to solve problems that can be modeled using Markov random fields. A brief introduction to graph theory, flow networks, and Markov Random Fields are therefore given. The chapter shows how a range of segmentation tasks can be formulated as such energy minimization problems and demonstrates how they can be solved with graph cuts. Specific examples of how to segment coronary arteries in computed tomography angiography images and the multilayered surfaces of airways in computed tomography images are given.

Original languageEnglish
Title of host publicationMedical Image Analysis
EditorsAlejandro F. Frangi, Jerry L. Prince, Milan Sonka
Number of pages27
PublisherElsevier
Publication date1 Jan 2024
Pages247-273
ISBN (Print)9780128136584
ISBN (Electronic)9780128136577
DOIs
Publication statusPublished - 1 Jan 2024

Keywords

  • Graph cut
  • Segmentation
  • Vessels

Fingerprint

Dive into the research topics of 'Graph cut-based segmentation'. Together they form a unique fingerprint.

Cite this