arrow
Return

Convexity Shape Prior for Level Set-Based Image Segmentation Method

delete2020-01-01
delete31
delete
OA
AI
S
Shi Yan
X
Xue‐Cheng Tai *
J
Jun Liu
H
Haiyang Huang
DOI:10.1109/TIP.2020.2998981delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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.
Keywords:
Shape
Level set
Image segmentation
Mathematical model
Computational modeling
Numerical models
Minimization
Convexity shape prior
image segmentation
level set method
Chan-Vese model
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Image Processing cover
IEEE Transactions on Image Processing
IF:
13.7
Papers:
1.0W
Citations:
8.4W

Organization

B
Beijing Normal University
Scholars:
3.3W
Papers: 2.7W
Citations: 4.2W
C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279