Multi-object Graph-based Segmentation with Non-overlapping Surfaces

  title={Multi-object Graph-based Segmentation with Non-overlapping Surfaces},
  author={Patrick M. Jensen and A. Dahl and Vedrana Andersen Dahl},
  journal={2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)},
For 3D images, segmentation via fitting surface meshes to object boundaries provides an efficient way to handle large images and enforce geometric prior knowledge. Furthermore, fitting such meshes with graph cuts has proven to be a versatile and robust framework. However, when segmenting multiple distinct objects in one image, current methods do not allow the natural constraint that objects should not overlap. In this paper, we present an extension to graph cut based methods which can provide a… Expand

Figures and Tables from this paper


Optimal Multi-Object Segmentation with Novel Gradient Vector Flow Based Shape Priors
  • 4
  • PDF
Optimal Graph Search Segmentation Using Arc-Weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
  • 54
  • PDF
Coupling Deformable Models for Multi-object Segmentation
  • 22
  • PDF
Globally optimal segmentation of multi-region objects
  • 151
  • PDF
Nugget-Cut: A Segmentation Scheme for Spherically- and Elliptically-Shaped 3D Objects
  • 51
LOGISMOS—Layered Optimal Graph Image Segmentation of Multiple Objects and Surfaces: Cartilage Segmentation in the Knee Joint
  • 194
Optimal Net Surface Problems with Applications
  • 144
What energy functions can be minimized via graph cuts?
  • V. Kolmogorov, R. Zabih
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2004
  • 1,639
  • PDF
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
  • V. Kolmogorov, C. Rother
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2007
  • 415
  • Highly Influential
  • PDF