This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
Qi Song, Xiaodong Wu, Yunlong Liu, Mark Smith, Joh...
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...