Convex Multi-Region Segmentation on Manifolds

In this paper, we address the problem of segmenting data defined on a manifold into a set of regions with uniform properties. In particular, we propose a numerical method when the manifold is represented by a triangular mesh. Based on recent image segmentation models, our method minimizes a convex energy and then enjoys significant favorable properties: it is robust to initialization and avoid the problem of the existence of local minima present in many variational models. The contributions of this paper are threefold: firstly we adapt the convex image labeling model to manifolds; in particular the total variation formulation. Secondly we show how to implement the proposed method on triangular meshes, and finally we show how to use and combine the method in other computer vision problems, such as 3D reconstruction. We demonstrate the efficiency of our method by testing it on various data.

• Type: Conference
• Year: 2009
• Where: ICCV
• Authors: Amaël Delaunoy, Ketut Fundana, Emmanuel Prados, Anders Heyden
• Keywords: Computer Vision, Convex Multi-Region Segmentation, ICCV 2009, Segmentation On Manifolds