Share Email Print

Journal of Electronic Imaging

Split Bregman’s algorithm for three-dimensional mesh segmentation
Author(s): Nabi Habiba; Douik Ali
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Variational methods have attracted a lot of attention in the literature, especially for image and mesh segmentation. The methods aim at minimizing the energy to optimize both edge and region detections. We propose a spectral mesh decomposition algorithm to obtain disjoint but meaningful regions of an input mesh. The related optimization problem is nonconvex, and it is very difficult to find a good approximation or global optimum, which represents a challenge in computer vision. We propose an alternating split Bregman algorithm for mesh segmentation, where we extended the image-dedicated model to a three-dimensional (3-D) mesh one. By applying our scheme to 3-D mesh segmentation, we obtain fast solvers that can outperform various conventional ones, such as graph-cut and primal dual methods. A consistent evaluation of the proposed method on various public domain 3-D databases for different metrics is elaborated, and a comparison with the state-of-the-art is performed.

Paper Details

Date Published: 7 June 2016
PDF: 10 pages
J. Electron. Imag. 25(3) 033011 doi: 10.1117/1.JEI.25.3.033011
Published in: Journal of Electronic Imaging Volume 25, Issue 3
Show Author Affiliations
Nabi Habiba, Univ. de Monastir (Tunisia)
Douik Ali, Ecole Nationale d'Ingénieurs de Sousse (Tunisia)

© SPIE. Terms of Use
Back to Top