An Efficient MRF Embedded Level Set Method for Image Segmentation

被引:99
|
作者
Yang, Xi [1 ]
Gao, Xinbo [1 ]
Tao, Dacheng [2 ,3 ]
Li, Xuelong [4 ]
Li, Jie [5 ]
机构
[1] Xidian Univ, Sch Elect Engn, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
[2] Univ Technol, Ctr Quantum Computat & Intelligent Syst, Ultimo, NSW 2007, Australia
[3] Univ Technol, Fac Engn & Informat Technol, Ultimo, NSW 2007, Australia
[4] Chinese Acad Sci, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Ctr Opt IMagery Anal & Learning OPTIMAL, Xian 710119, Peoples R China
[5] Xidian Univ, Sch Elect Engn, Video & Image Proc Syst Lab, Xian 710071, Peoples R China
基金
中国国家自然科学基金; 澳大利亚研究理事会;
关键词
Level set; Markov random field; algebraic multigrid; sparse field method; AURORAL OVAL SEGMENTATION; GEODESIC ACTIVE CONTOURS; GRADIENT VECTOR FLOW; ALGORITHMS; OPTIMIZATION; RETRIEVAL; EVOLUTION; DIFFUSION; SEARCH; MODELS;
D O I
10.1109/TIP.2014.2372615
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a fast and robust level set method for image segmentation. To enhance the robustness against noise, we embed a Markov random field (MRF) energy function to the conventional level set energy function. This MRF energy function builds the correlation of a pixel with its neighbors and encourages them to fall into the same region. To obtain a fast implementation of the MRF embedded level set model, we explore algebraic multigrid (AMG) and sparse field method (SFM) to increase the time step and decrease the computation domain, respectively. Both AMG and SFM can be conducted in a parallel fashion, which facilitates the processing of our method for big image databases. By comparing the proposed fast and robust level set method with the standard level set method and its popular variants on noisy synthetic images, synthetic aperture radar (SAR) images, medical images, and natural images, we comprehensively demonstrate the new method is robust against various kinds of noises. In particular, the new level set method can segment an image of size 500 x 500 within 3 s on MATLAB R2010b installed in a computer with 3.30-GHz CPU and 4-GB memory.
引用
收藏
页码:9 / 21
页数:13
相关论文
共 50 条
  • [1] Level set method with Retinex-corrected saliency embedded for image segmentation
    Liu, Dongmei
    Chang, Faliang
    Zhang, Huaxiang
    Liu, Li
    IET IMAGE PROCESSING, 2021, 15 (07) : 1530 - 1541
  • [2] Level set issues for efficient image segmentation
    Sandeep, V. M.
    Kulkarni, Subhash
    Kohir, Vinayadatt
    INTERNATIONAL JOURNAL OF IMAGE AND DATA FUSION, 2011, 2 (01) : 75 - 92
  • [3] An efficient level set method based on global statistical information for image segmentation
    Abdelkader B.
    Latifa H.
    International Journal of Computers and Applications, 2019, 44 (01): : 48 - 56
  • [4] A Deep Level Set Method for Image Segmentation
    Tang, Min
    Valipour, Sepehr
    Zhang, Zichen
    Cobzas, Dana
    Jagersand, Martin
    DEEP LEARNING IN MEDICAL IMAGE ANALYSIS AND MULTIMODAL LEARNING FOR CLINICAL DECISION SUPPORT, 2017, 10553 : 126 - 134
  • [5] Image segmentation based on level set method
    Ouyang Yimin
    Qi Xiaoping
    Zhang Qiheng
    ELECTRO-OPTICAL AND INFRARED SYSTEMS: TECHNOLOGY AND APPLICATIONS IV, 2007, 6737
  • [6] Image Segmentation Based on Level Set Method
    Xin-Jiang
    Renjie-Zhang
    Shengdong-Nie
    Xin-Jiang
    2010 INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT (CCCM2010), VOL IV, 2010, : 414 - 417
  • [7] Image Segmentation Based on Level Set Method
    Jiang, Xin
    Zhang, Renjie
    Nie, Shengdong
    2012 INTERNATIONAL CONFERENCE ON MEDICAL PHYSICS AND BIOMEDICAL ENGINEERING (ICMPBE2012), 2012, 33 : 840 - 845
  • [8] Shape Prior Embedded Level Set Model for Image Segmentation
    Liu, Wansuo
    Wang, Dengwei
    Shi, Wenjun
    JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, 2019, 2019
  • [9] A new level set method for inhomogeneous image segmentation
    Dong, Fangfang
    Chen, Zengsi
    Wang, Jinwei
    IMAGE AND VISION COMPUTING, 2013, 31 (10) : 809 - 822