A binary level set model and some applications to Mumford-Shah image segmentation
In this paper, we propose a PDE-based level set method. Traditionally, interfaces are represented by the zero level set of continuous level set functions. Instead, we let the interfaces be represented by discontinuities of piecewise constant level set functions. Each level set function can at conver...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91725 http://hdl.handle.net/10220/4597 http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:EVII&id=doi:10.1109/TIP.2005.863956&genre=&isbn=&issn=10577149&date=2006&volume=15&issue=5&spage=1171&epage=1181&aulast=Lie&aufirst=%20Johan&auinit=&title=IEEE%20Transactions%20on%20Image%20Processing&atitle=A%20binary%20level%20set%20model%20and%20some%20applications%20to%20Mumford%2DShah%20image%20segmentation |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Summary: | In this paper, we propose a PDE-based level set method. Traditionally, interfaces are represented by the zero level set of continuous level set functions. Instead, we let the interfaces be represented by discontinuities of piecewise constant level set functions. Each level set function can at convergence only take two values, i.e., it can only be 1 or -1; thus, our method is related to phase-field methods. Some of the properties of standard level set methods are preserved in the proposed method, while others are not. Using this new method for interface problems, we need to minimize a smooth convex functional under a quadratic constraint. The level set functions are discontinuous at convergence, but the minimization functional is smooth. We show numerical results using the method for segmentation of digital images. |
---|