TY - JOUR
T1 - Topology- and convexity-preserving image segmentation based on image registration
AU - Zhang, Daoping
AU - Tai, Xue cheng
AU - Lui, Lok Ming
N1 - Xue-cheng Tai is supported by projects HKBU 12300819 , NSF/RGC Grant N-HKBU214-19, ANR/RGC Joint Research Scheme (A-HKBU203-19) and RC-FNRA-IG/19-20/SCI/01. L.M. Lui is supported by HKRGC GRF (Project ID: 2130656; Reference: 14305919) and CUHK Direct Grant (Project ID: 4053292).
Publisher Copyright:
© 2021
PY - 2021/12
Y1 - 2021/12
N2 - Image segmentation aims to extract the target objects or to identify the corresponding boundaries. For corrupted images due to occlusions, obscurities or noises, to get an accurate segmentation result is very difficult. To overcome this issue, the prior information is often introduced and particularly, the convex prior attracts more and more attentions recently. In this paper, we propose a topology- and convexity-preserving registration-based segmentation model, which can be suitable for both 2D and 3D cases. By incorporating the level set representation and imposing the constraints on the suitable regions, we can explicitly force the fully convex segmentation results or the partially convex segmentation results. To solve the proposed model, we employ the alternating direction method of multipliers and numerical experiments on 2/3D synthetic and real images demonstrate that the proposed model can indeed lead to the accurately topology- and convexity-preserving segmentation.
AB - Image segmentation aims to extract the target objects or to identify the corresponding boundaries. For corrupted images due to occlusions, obscurities or noises, to get an accurate segmentation result is very difficult. To overcome this issue, the prior information is often introduced and particularly, the convex prior attracts more and more attentions recently. In this paper, we propose a topology- and convexity-preserving registration-based segmentation model, which can be suitable for both 2D and 3D cases. By incorporating the level set representation and imposing the constraints on the suitable regions, we can explicitly force the fully convex segmentation results or the partially convex segmentation results. To solve the proposed model, we employ the alternating direction method of multipliers and numerical experiments on 2/3D synthetic and real images demonstrate that the proposed model can indeed lead to the accurately topology- and convexity-preserving segmentation.
KW - Alternating direction method of multipliers
KW - Level set function
KW - Registration-based segmentation
KW - Topology- and convexity-preserving segmentation
UR - http://www.scopus.com/inward/record.url?scp=85113732881&partnerID=8YFLogxK
UR - https://www.sciencedirect.com/science/article/abs/pii/S0307904X2100384X?via%3Dihub
U2 - 10.1016/j.apm.2021.08.017
DO - 10.1016/j.apm.2021.08.017
M3 - Journal article
AN - SCOPUS:85113732881
SN - 0307-904X
VL - 100
SP - 218
EP - 239
JO - Applied Mathematical Modelling
JF - Applied Mathematical Modelling
ER -