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 条
[11]  
Chun-Wei Tan, 2012, 2012 IEEE Fifth International Conference On Biometrics: Theory, Applications And Systems (BTAS 2012), P99, DOI 10.1109/BTAS.2012.6374563
[12]   Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest [J].
Couprie, Camille ;
Grady, Leo ;
Najman, Laurent ;
Talbot, Hugues .
2009 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2009, :731-738
[14]   Sub-Markov Random Walk for Image Segmentation [J].
Dong, Xingping ;
Shen, Jianbing ;
Shao, Ling ;
Van Gool, Luc .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (02) :516-527
[15]   The Segmentation of 3D Images Using the Random Walking Technique on a Randomly Created Image Adjacency Graph [J].
Fabijanska, Anna ;
Goclawski, Jaroslaw .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2015, 24 (02) :524-537
[16]  
Ford L. R., 1956, Can. j. math, V8, P399, DOI [DOI 10.4153/CJM-1956-045-5, 10.4153/CJM-1956-045-5]
[17]   Combining shape prior and statistical features for active contour segmentation [J].
Gastaud, M ;
Barlaud, M ;
Aubert, G .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2004, 14 (05) :726-734
[18]  
Grady L, 2005, PROC CVPR IEEE, P763
[19]  
Grady L, 2005, LECT NOTES COMPUT SC, V3750, P773, DOI 10.1007/11566489_95
[20]  
Grady L., 2005, ICIP '05: Proceedings of the 2005 IEEE International Conference on Image Processing, V2, P642