- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this work we discuss variants of a PDE based level set method. Traditionally interfaces are represented by the zero level set of continuous level set functions. We instead use piecewise constant level set functions, and let interfaces be represented by discontinuities. Some of the properties of the standard level set function are preserved in the proposed method. Using the methods for interface problems, we need to minimize a smooth convex functional under a constraint. The level set functions are discontinuous at convergence, but the minimization functional is smooth and locally convex. We show numerical results using the methods for segmentation of digital images.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/939.html} }In this work we discuss variants of a PDE based level set method. Traditionally interfaces are represented by the zero level set of continuous level set functions. We instead use piecewise constant level set functions, and let interfaces be represented by discontinuities. Some of the properties of the standard level set function are preserved in the proposed method. Using the methods for interface problems, we need to minimize a smooth convex functional under a constraint. The level set functions are discontinuous at convergence, but the minimization functional is smooth and locally convex. We show numerical results using the methods for segmentation of digital images.