Share Email Print
cover

Proceedings Paper • new

A novel proximity algorithm for an unconstrained convex segmentation model
Author(s): Weibin Li; Yanxia Du; Xian Yi; Honglin Ma; Chao Song
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 14 August 2019
PDF: 5 pages
Proc. SPIE 11179, Eleventh International Conference on Digital Image Processing (ICDIP 2019), 111794B (14 August 2019); doi: 10.1117/12.2540290
Show Author Affiliations
Weibin Li, China Aerodynamics Research and Development Ctr. (China)
Yanxia Du, China Aerodynamics Research and Development Ctr. (China)
Xian Yi, China Aerodynamics Research and Development Ctr. (China)
Honglin Ma, China Aerodynamics Research and Development Ctr. (China)
Chao Song, China Aerodynamics Research and Development Ctr. (China)


Published in SPIE Proceedings Vol. 11179:
Eleventh International Conference on Digital Image Processing (ICDIP 2019)
Jenq-Neng Hwang; Xudong Jiang, Editor(s)

© SPIE. Terms of Use
Back to Top