An Improved Random Walk Algorithm for Interactive Image Segmentation

Interactive image segmentation is an important issue in computer vision. Many algorithms have been proposed for this problem. Among them, random walk based algorithms have been proved to be efficient. However, a large number of seeds (i.e., pixels with user-specified labels) must be given in advance to achieve a desirable segmentation for such algorithms, which makes user interaction inconvenient. To solve this problem, we improve the random walk algorithm in two aspects: (1) label prior is taken into account when computing edge weights between adjacent pixels; (2) each unseeded pixel is assigned with the same label as the seed with maximum first arrival probability to reduce the bias effect of seed size. The improved algorithm can achieve a desirable segmentation with few seeds. Experiment results on natural images illustrate the accuracy of the proposed algorithm.

[1]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

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

[3]  Leo Grady,et al.  Fast approximate Random Walker segmentation using eigenvector precomputation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Zhaoshui He,et al.  Symmetric Nonnegative Matrix Factorization: Algorithms and Applications to Probabilistic Clustering , 2011, IEEE Transactions on Neural Networks.

[5]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[6]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[7]  Andrzej Cichocki,et al.  Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation , 2012, IEEE Transactions on Signal Processing.

[8]  William A. Barrett,et al.  Interactive Segmentation with Intelligent Scissors , 1998, Graph. Model. Image Process..

[9]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[10]  Shengli Xie,et al.  Online Blind Source Separation Using Incremental Nonnegative Matrix Factorization With Volume Constraint , 2011, IEEE Transactions on Neural Networks.

[11]  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.

[12]  Shengli Xie,et al.  Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization , 2011, IEEE Transactions on Image Processing.

[13]  Zhaoshui He,et al.  Minimum-Volume-Constrained Nonnegative Matrix Factorization: Enhanced Ability of Learning Parts , 2011, IEEE Transactions on Neural Networks.

[14]  Sang Uk Lee,et al.  Generative Image Segmentation Using Random Walks with Restart , 2008, ECCV.

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

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

[17]  D. Mery,et al.  Color measurement in L ¿ a ¿ b ¿ units from RGB digital images , 2006 .

[18]  Yong Xiang,et al.  Projection-Pursuit-Based Method for Blind Separation of Nonnegative Sources , 2013, IEEE Transactions on Neural Networks and Learning Systems.

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