Paper
14 August 2019 A novel proximity algorithm for an unconstrained convex segmentation model
Weibin Li, Yanxia Du, Xian Yi, Honglin Ma, Chao Song
Author Affiliations +
Proceedings Volume 11179, Eleventh International Conference on Digital Image Processing (ICDIP 2019); 111794B (2019) https://doi.org/10.1117/12.2540290
Event: Eleventh International Conference on Digital Image Processing (ICDIP 2019), 2019, Guangzhou, China
Abstract
A new proximity algorithm for an active contour model is proposed in this paper. In order to derive a mathematical form of the energy, the level set method is employed. In the new energy, a penalty term is introduced to make sure that the level set function can be restricted in the interval [-1, 1]. By introducing this term, the energy still keeps convex and is easy to construct its minimization algorithms. Based on the proximity operator and the corresponding theories, we deduce a proximity algorithm to minimize the energy. Experimental results demonstrate that the proposed model is powerful in its segmentation ability and accuracy. And comparisons with other popular algorithms show that the proposed algorithm is more efficient.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Weibin Li, Yanxia Du, Xian Yi, Honglin Ma, and Chao Song "A novel proximity algorithm for an unconstrained convex segmentation model", Proc. SPIE 11179, Eleventh International Conference on Digital Image Processing (ICDIP 2019), 111794B (14 August 2019); https://doi.org/10.1117/12.2540290
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing algorithms and systems

Algorithm development

Aerodynamics

Algorithms

Databases

Chaos

RELATED CONTENT


Back to Top