Convex Multi-Region Segmentation on Manifolds

Abstract : 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 labelling 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download


https://hal.inria.fr/inria-00435133
Contributor : Emmanuel Prados <>
Submitted on : Monday, November 23, 2009 - 4:07:36 PM
Last modification on : Wednesday, April 11, 2018 - 1:58:44 AM
Long-term archiving on : Tuesday, October 16, 2012 - 2:41:22 PM

Files

Delaunoy-etal-iccv2009.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Amael Delaunoy, Ketut Fundana, Emmanuel Prados, Anders Heyden. Convex Multi-Region Segmentation on Manifolds. ICCV 2009 - 12th IEEE International Conference on Computer Vision, Sep 2009, Kyoto, Japan. pp.662-669, ⟨10.1109/ICCV.2009.5459174⟩. ⟨inria-00435133⟩

Share

Metrics

Record views

653

Files downloads

1100