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

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.

[1]  Anthony J. Yezzi,et al.  Gradient flows and geometric active contour models , 1995, Proceedings of IEEE International Conference on Computer Vision.

[2]  Xue-Cheng Tai,et al.  A variant of the level set method and applications to image segmentation , 2006, Math. Comput..

[3]  Xuelong Li,et al.  Interactive Segmentation Using Constrained Laplacian Optimization , 2014, IEEE Transactions on Circuits and Systems for Video Technology.

[4]  Camille Couprie,et al.  Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[5]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Bernhard Schölkopf,et al.  Learning from Labeled and Unlabeled Data Using Random Walks , 2004, DAGM-Symposium.

[8]  P. J. Narayanan,et al.  CUDA cuts: Fast graph cuts on the GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[9]  Zhen Ma,et al.  A review of algorithms for medical image segmentation and their applications to the female pelvic cavity , 2010, Computer methods in biomechanics and biomedical engineering.

[10]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[11]  Ali Mohammad-Djafari,et al.  Bayesian segmentation and motion estimation in video sequences using a Markov-Potts model , 2004 .

[12]  Yu Cao,et al.  Grain Segmentation of 3D Superalloy Images Using Multichannel EWCVT under Human Annotation Constraints , 2012, ECCV.

[13]  Ruigang Yang,et al.  Semi-Supervised Video Object Segmentation with Super-Trajectories , 2019, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Xuelong Li,et al.  Video Supervoxels Using Partially Absorbing Random Walks , 2016, IEEE Transactions on Circuits and Systems for Video Technology.

[15]  Ling Shao,et al.  Sub-Markov Random Walk for Image Segmentation , 2016, IEEE Transactions on Image Processing.

[16]  Chun-Wei Tan,et al.  Efficient iris segmentation using Grow-Cut algorithm for remotely acquired iris images , 2012, 2012 IEEE Fifth International Conference on Biometrics: Theory, Applications and Systems (BTAS).

[17]  Jianfei Cai,et al.  A diffusion approach to seeded image segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[18]  Ruigang Yang,et al.  Saliency-Aware Video Object Segmentation , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Leo Grady,et al.  A Lattice-Preserving Multigrid Method for Solving the Inhomogeneous Poisson Equations Used in Image Analysis , 2008, ECCV.

[20]  Leo Grady,et al.  Multilabel random walker image segmentation using prior models , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[21]  Xue-Cheng Tai,et al.  A binary level set model and some applications to Mumford-Shah image segmentation , 2006, IEEE Transactions on Image Processing.

[22]  Daniel Cremers,et al.  A Convex Approach to Minimal Partitions , 2012, SIAM J. Imaging Sci..

[23]  J. Dodziuk Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .

[24]  Hugues Talbot,et al.  Globally minimal surfaces by continuous maximal flows , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Yao Zhang,et al.  Fast tridiagonal solvers on the GPU , 2010, PPoPP '10.

[26]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Xin Wang,et al.  Efficient multigrid solver for the 3D random walker algorithm , 2009, Medical Imaging.

[28]  Xue-cheng,et al.  IMAGE SEGMENTATION BY PIECEWISE CONSTANT MUMFORD-SHAH MODEL WITHOUT ESTIMATING THE CONSTANTS ∗ , 2006 .

[29]  Jing Yuan,et al.  Convex Multi-class Image Labeling by Simplex-Constrained Total Variation , 2009, SSVM.

[30]  Bernhard Schölkopf,et al.  Learning with Local and Global Consistency , 2003, NIPS.

[31]  Anna Fabijanska,et al.  The Segmentation of 3D Images Using the Random Walking Technique on a Randomly Created Image Adjacency Graph , 2015, IEEE Transactions on Image Processing.

[32]  Daniel Cremers,et al.  A convex relaxation approach for computing minimal partitions , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[33]  Li Chen,et al.  JF-Cut: A Parallel Graph Cut Approach for Large-Scale Image and Video , 2015, IEEE Transactions on Image Processing.

[34]  Leo Grady,et al.  A geometric multigrid approach to solving the 2D inhomogeneous Laplace equation with internal Dirichlet boundary conditions , 2005, IEEE International Conference on Image Processing 2005.

[35]  Marc Pollefeys,et al.  What is optimized in convex relaxations for multilabel problems: connecting discrete and continuously inspired MAP inference. , 2014, IEEE transactions on pattern analysis and machine intelligence.

[36]  Petros Maragos,et al.  Graph-Driven Diffusion and Random Walk Schemes for Image Segmentation , 2017, IEEE Transactions on Image Processing.

[37]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[38]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[39]  Kwanghoon Sohn,et al.  A Generalized Random Walk With Restart and its Application in Depth Up-Sampling and Interactive Segmentation , 2013, IEEE Transactions on Image Processing.

[40]  Christoph Schnörr,et al.  Continuous Multiclass Labeling Approaches and Algorithms , 2011, SIAM J. Imaging Sci..

[41]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[42]  Rüdiger Westermann,et al.  Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation , 2005, MICCAI.

[43]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

[44]  Ling Shao,et al.  Video Salient Object Detection via Fully Convolutional Networks , 2017, IEEE Transactions on Image Processing.

[45]  Xiaofeng Wang,et al.  An efficient local Chan-Vese model for image segmentation , 2010, Pattern Recognit..

[46]  Zdenek Strakos,et al.  Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs , 2014, SIAM spotlights.

[47]  Xue-Cheng Tai,et al.  A Continuous Max-Flow Approach to Potts Model , 2010, ECCV.

[48]  Fei Wang,et al.  Label Propagation through Linear Neighborhoods , 2008, IEEE Trans. Knowl. Data Eng..

[49]  Gene Cheung,et al.  Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain , 2016, IEEE Transactions on Image Processing.

[50]  Xuelong Li,et al.  Lazy Random Walks for Superpixel Segmentation , 2014, IEEE Transactions on Image Processing.

[51]  Chunming Li,et al.  A Level Set Method for Image Segmentation in the Presence of Intensity Inhomogeneities With Application to MRI , 2011, IEEE Transactions on Image Processing.

[52]  Shih-Fu Chang,et al.  Learning with Partially Absorbing Random Walks , 2012, NIPS.

[53]  Michel Barlaud,et al.  Combining shape prior and statistical features for active contour segmentation , 2004, IEEE Transactions on Circuits and Systems for Video Technology.