Graph cut optimization for the piecewise constant level set method applied to multiphase image segmentation

52Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The piecewise constant level set method (PCLSM) has recently emerged as a variant of the level set method for variational interphase problems. Traditionally, the Euler-Lagrange equations are solved by some iterative numerical method for PDEs. Normally the speed is slow. In this work, we focus on the piecewise constant level set method (PCLSM) applied to the multiphase Mumford-Shah model for image segmentation. Instead of solving the Euler-Lagrange equations of the resulting minimization problem, we propose an efficient combinatorial optimization technique, based on graph cuts. Because of a simplification of the length term in the energy induced by the PCLSM, the minimization problem is not NP hard. Numerical experiments on image segmentation demonstrate that the new approach is very superior in terms of efficiency, while maintaining the same quality. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bae, E., & Tai, X. C. (2009). Graph cut optimization for the piecewise constant level set method applied to multiphase image segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5567 LNCS, pp. 1–13). https://doi.org/10.1007/978-3-642-02256-2_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free