Image segmentation by level set evolution with region consistency constraint

被引:4
|
作者
Zhong, Li [1 ,2 ]
Zhou, Yuan-feng [1 ]
Zhang, Xiao-feng [2 ]
Guo, Qiang [3 ]
Zhang, Cai-ming [1 ,2 ,3 ]
机构
[1] Shandong Univ, Sch Comp Sci & Technol, Jinan 250101, Shandong, Peoples R China
[2] Ludong Univ, Sch Informat & Elect Engn, Yantai 264025, Peoples R China
[3] Shandong Univ Finance & Econ, Sch Comp Sci & Technol, Jinan 250014, Shandong, Peoples R China
关键词
level set evolution; image segmentation; uniformity testing; multiple level contours; region consistency constraint; ACTIVE CONTOURS; ALGORITHMS; FRAMEWORK; MUMFORD; MODEL;
D O I
10.1007/s11766-017-3534-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Image segmentation is a key and fundamental problem in image processing, computer graphics, and computer vision. Level set based method for image segmentation is used widely for its topology flexibility and proper mathematical formulation. However, poor performance of existing level set models on noisy images and weak boundary limit its application in image segmentation. In this paper, we present a region consistency constraint term to measure the regional consistency on both sides of the boundary, this term defines the boundary of the image within a range, and hence increases the stability of the level set model. The term can make existing level set models significantly improve the efficiency of the algorithms on segmenting images with noise and weak boundary. Furthermore, this constraint term can make edge-based level set model overcome the defect of sensitivity to the initial contour. The experimental results show that our algorithm is efficient for image segmentation and outperform the existing state-of-art methods regarding images with noise and weak boundary.
引用
收藏
页码:422 / 442
页数:21
相关论文
共 50 条
  • [31] A Hybrid Level Set With Semantic Shape Constraint for Object Segmentation
    Wang, Bin
    Yuan, Xiuying
    Gao, Xinbo
    Li, Xuelong
    Tao, Dacheng
    IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (05) : 1558 - 1569
  • [32] Level-set evolution for medical image segmentation with alternating direction method of multipliers
    Wali, Samad
    Li, Chunming
    Imran, Mudassar
    Shakoor, Abdul
    Basit, Abdul
    SIGNAL PROCESSING, 2023, 211
  • [33] A fast level set image segmentation driven by a new region descriptor
    Birane, Abdelkader
    Hamami, Latifa
    IET IMAGE PROCESSING, 2021, 15 (03) : 615 - 623
  • [34] RESLS: Region and Edge Synergetic Level Set Framework for Image Segmentation
    Zhang, Weihang
    Wang, Xue
    You, Wei
    Chen, Junfeng
    Dai, Peng
    Zhang, Pengbo
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2020, 29 : 57 - 71
  • [35] New Variational Formulations for Level Set Evolution Without Reinitialization with Applications to Image Segmentation
    Liu, Chunxiao
    Dong, Fangfang
    Zhu, Shengfeng
    Kong, Dexing
    Liu, Kefeng
    JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2011, 41 (03) : 194 - 209
  • [36] Fast distance preserving level set evolution for medical image segmentation
    Li, Chunming
    Xu, Chenyang
    Konwar, Kishod M.
    Fox, Martin D.
    2006 9TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION, VOLS 1- 5, 2006, : 1969 - +
  • [37] A novel dual minimization based level set method for image segmentation
    Min, Hai
    Wang, Xiao-Feng
    Huang, De-Shuang
    Jia, Wei
    NEUROCOMPUTING, 2016, 214 : 910 - 926
  • [38] A Level Set Method to Image Segmentation Based on Local Direction Gradient
    Peng, Yanjun
    Ma, Yingran
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2018, 12 (04): : 1760 - 1778
  • [39] Image segmentation and inpainting using hierarchical level set and texture mapping
    Du, Xiaojun
    Cho, Dongwook
    Bui, Tien D.
    SIGNAL PROCESSING, 2011, 91 (04) : 852 - 863
  • [40] Morphological region-based initial contour algorithm for level set methods in image segmentation
    Rad, Abdolvahab Ehsani
    Rahim, Mohd Shafry Mohd
    Kolivand, Hoshang
    Amin, Ismail Bin Mat
    MULTIMEDIA TOOLS AND APPLICATIONS, 2017, 76 (02) : 2185 - 2201