TY - JOUR
T1 - Convexity Shape Prior for Level Set-Based Image Segmentation Method
AU - Yan, Shi
AU - Tai, Xue-Cheng
AU - Liu, Jun
AU - Huang, Hai Yang
N1 - Funding Information:
The work of Shi Yan was supported in part by the China Scholarship Council and University of Bergen. The work of Xue-Cheng Tai was supported by RG(R)-RC/17-18/02-MATH, HKBU 12300819, and NSF/RGC grant N-HKBU214-19. The work of Jun Liu was supported in part by The National Key Research and Development Program of China under Grant 2017YFA0604903 and in part by the National Natural Science Foundation of China under Grant 11871035. The work of Hai-Yang Huang was supported in part by The National Key Research and Development Program of China under Grant 2017YFA0604903.
PY - 2020/6/5
Y1 - 2020/6/5
N2 - In this paper, we propose an image segmentation model that incorporates convexity shape priori using level set representations. In the past decade, several discrete and continuous methods have been developed to solve this problem. Our method comes from the observation that the signed distance function of a convex region must be a convex function. Based on this observation, we transfer the complicated geometrical convexity shape priori into some simple constraints on the signed distance function. We propose a simple algorithm to keep these constraints exactly. The proposed method could be easily applied to level set based segmentation models, such as the well-known Chan-Vese mode and the active contour models. By setting some good initial curves, the proposed method can easily segment convex objects from images with complicated background. We demonstrate the performance of the proposed methods on both synthetic images and real images, as well as the comparison to some state-of-the-art methods.
AB - In this paper, we propose an image segmentation model that incorporates convexity shape priori using level set representations. In the past decade, several discrete and continuous methods have been developed to solve this problem. Our method comes from the observation that the signed distance function of a convex region must be a convex function. Based on this observation, we transfer the complicated geometrical convexity shape priori into some simple constraints on the signed distance function. We propose a simple algorithm to keep these constraints exactly. The proposed method could be easily applied to level set based segmentation models, such as the well-known Chan-Vese mode and the active contour models. By setting some good initial curves, the proposed method can easily segment convex objects from images with complicated background. We demonstrate the performance of the proposed methods on both synthetic images and real images, as well as the comparison to some state-of-the-art methods.
KW - Chan-Vese model
KW - Convexity shape prior
KW - image segmentation
KW - level set method
UR - http://www.scopus.com/inward/record.url?scp=85089307644&partnerID=8YFLogxK
U2 - 10.1109/TIP.2020.2998981
DO - 10.1109/TIP.2020.2998981
M3 - Journal article
AN - SCOPUS:85089307644
SN - 1057-7149
VL - 29
SP - 7141
EP - 7152
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
M1 - 9109685
ER -