A Novel Level Set Based Shape Prior Method for Liver Segmentation from MRI Images

Author(s):  
Kan Cheng ◽  
Lixu Gu ◽  
Jianghua Wu ◽  
Wei Li ◽  
Jianrong Xu
2017 ◽  
Vol 257 ◽  
pp. 154-163 ◽  
Author(s):  
Xiong Yang ◽  
Shu Zhan ◽  
Dongdong Xie ◽  
Hong Zhao ◽  
Toru Kurihara

2014 ◽  
Vol 41 (6Part27) ◽  
pp. 471-472 ◽  
Author(s):  
W Liu ◽  
D Ruan
Keyword(s):  

2020 ◽  
Vol 14 (1) ◽  
pp. 183-191 ◽  
Author(s):  
Yongming Han ◽  
Shuheng Zhang ◽  
Zhiqing Geng ◽  
Qin Wei ◽  
Zhi Ouyang

2019 ◽  
Vol 2019 ◽  
pp. 1-17
Author(s):  
Wansuo Liu ◽  
Dengwei Wang ◽  
Wenjun Shi

This paper presents an optimized level set evolution (LSE) without reinitialization (LSEWR) model and a shape prior embedded level set model (LSM) for robust image segmentation. Firstly, by performing probability weighting and coefficient adaptive processing on the original LSEWR model, the optimized image energy term required by the proposed model is constructed. The purpose of the probability weighting is to introduce region information into the edge stop function to enhance the model’s ability to capture weak edges. The introduction of the adaptive coefficient enables the evolution process to automatically adjust its amplitude and direction according to the current image coordinate and local region information, thus completely solving the initialization sensitivity problem of the original LSEWR model. Secondly, a shape prior term driven by kernel density estimation (KDE) is additionally introduced into the optimized LSEWR model. The role of the KDE-driven shape prior term is to overcome the problem of image segmentation in the presence of geometric transformation and pattern interference. Even if there is obvious affine transformation in the shape prior and the target to be segmented, the target contour can still be reconstructed correctly. The extensive experiments on a large variety of synthetic and real images show that the proposed algorithm achieves excellent performance. In addition, several key factors affecting the performance of the proposed algorithm are analyzed in detail.


Sign in / Sign up

Export Citation Format

Share Document