Numer. Math. Theor. Meth. Appl., 2 (2009), pp. 403-420.
Published online: 2009-02
Cited by
- BibTex
- RIS
- TXT
Segmentation of three-dimensional (3D) complicated structures is of great importance for many real applications. In this work we combine graph cut minimization method with a variant of the level set idea for 3D segmentation based on the Mumford-Shah model. Compared with the traditional approach for solving the Euler-Lagrange equation we do not need to solve any partial differential equations. Instead, the minimum cut on a special designed graph need to be computed. The method is tested on data with complicated structures. It is rather stable with respect to initial value and the algorithm is nearly parameter free. Experiments show that it can solve large problems much faster than traditional approaches.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2009.m9003s}, url = {http://global-sci.org/intro/article_detail/nmtma/6031.html} }Segmentation of three-dimensional (3D) complicated structures is of great importance for many real applications. In this work we combine graph cut minimization method with a variant of the level set idea for 3D segmentation based on the Mumford-Shah model. Compared with the traditional approach for solving the Euler-Lagrange equation we do not need to solve any partial differential equations. Instead, the minimum cut on a special designed graph need to be computed. The method is tested on data with complicated structures. It is rather stable with respect to initial value and the algorithm is nearly parameter free. Experiments show that it can solve large problems much faster than traditional approaches.