7 June 2016 Split Bregman’s algorithm for three-dimensional mesh segmentation
Nabi Habiba, Douik Ali
Author Affiliations +
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.
© 2016 SPIE and IS&T 1017-9909/2016/$25.00 © 2016 SPIE and IS&T
Nabi Habiba and Douik Ali "Split Bregman’s algorithm for three-dimensional mesh segmentation," Journal of Electronic Imaging 25(3), 033011 (7 June 2016). https://doi.org/10.1117/1.JEI.25.3.033011
Published: 7 June 2016
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

3D modeling

3D image processing

Alternate lighting of surfaces

Image processing algorithms and systems

Performance modeling

Databases

Back to Top