A Continuous Random Walk Model With Explicit Coherence Regularization for Image Segmentation

被引:10
作者
Li, Mengfei [1 ,2 ]
Gao, Hong [1 ,2 ]
Zuo, Feifei [3 ]
Li, Hongwei [1 ,2 ]
机构
[1] Capital Normal Univ, Sch Math Sci, Beijing 100048, Peoples R China
[2] Capital Normal Univ, Beijing Adv Innovat Ctr Imaging Technol, Beijing 100048, Peoples R China
[3] LargeV Instrument Corp Ltd, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Random walk; image segmentation; Peaceman-Rachford scheme; LEVEL SET METHOD; ENERGY MINIMIZATION; ALGORITHMS;
D O I
10.1109/TIP.2018.2881907
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Random walk is a popular and efficient algorithm for image segmentation, especially for extracting regions of interest (ROIs). One difficulty with the random walk algorithm is the requirement for solving a huge sparse linear system when applied to large images. Another limitation is its sensitivity to seeds distribution, i.e., the segmentation result depends on the number of seeds as well as their placement, which puts a burden on users. In this paper, we first propose a continuous random walk model with explicit coherence regularization (CRWCR) for the extracted ROI, which helps to reduce the seeds sensitivity, so as to reduce the user interactions. Then, a very efficient algorithm to solve the CRWCR model will be developed, which helps to remove the difficulty of solving huge linear systems. Our algorithm consists of two stages: initialization by performing one-dimensional random walk sweeping based on user-provided seeds, followed by the alternating direction scheme, i.e., Peaceman-Rachford scheme for further correction. The first stage aims to provide a good initial guess for the ROI, and it is very fast since we just solve a limited number of one-dimensional random walk problems. Then, this initial guess is evolved to the ideal solution by applying the second stage, which should also be very efficient since it fits well for GPU computing, and 10 iterations are usually sufficient for convergence. Numerical experiments are provided to validate the proposed model as well as the efficiency of the two-stage algorithm.
引用
收藏
页码:1759 / 1772
页数:14
相关论文
共 56 条
[1]  
[Anonymous], FOUND TRENDS MACH LE
[2]  
[Anonymous], 2013, INTRO NUMERICAL ANAL
[3]   Globally minimal surfaces by continuous maximal flows [J].
Appleton, B ;
Talbot, H .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (01) :106-118
[4]   Graph-Driven Diffusion and Random Walk Schemes for Image Segmentation [J].
Bampis, Christos G. ;
Maragos, Petros ;
Bovik, Alan C. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (01) :35-50
[5]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[6]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[7]  
Boykov YY, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P105, DOI 10.1109/ICCV.2001.937505
[8]  
Brault P., 2004, P 5 WSEAS INT C APPL
[9]  
Cao Y, 2012, LECT NOTES COMPUT SC, V7574, P244, DOI 10.1007/978-3-642-33712-3_18
[10]   A Convex Approach to Minimal Partitions [J].
Chambolle, Antonin ;
Cremers, Daniel ;
Pock, Thomas .
SIAM JOURNAL ON IMAGING SCIENCES, 2012, 5 (04) :1113-1158