Region-Based Nonparametric Model for Interactive Image Segmentation

In this paper, we present a novel framework for interactive segmentation problems. It integrates a nonparametric model into the Conditional Random Field (CRF) framework, which can effectively combine high-level features with low-level features to represent image information. In the nonparametric model, multiple region layers are used to estimate data likelihood terms to overcome the bad regions generated by unsupervised methods. The likelihood values of each layer are calculated separately to reduce the computational cost. In addition, we analyze that the pixel layer has little effect on data estimation, so we remove it to further reduce the complexity of the algorithm. We employ the label consistency between pixels and their corresponding regions in smooth term estimation, which can be regard as a higher order potential for pixels. The data term and the smooth term are then performed together in Conditional Random Fields (CRFs) as a fine-tuning of the results. Experimental results show that the proposed method can segment images efficiently and accurately with fewer user inputs.

[1]  Vladlen Koltun,et al.  Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials , 2011, NIPS.

[2]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Enhua Wu,et al.  Robust interactive image segmentation via graph-based manifold ranking , 2015, Computational Visual Media.

[4]  King Ngi Ngan,et al.  Object Co-Segmentation Based on Shortest Path Algorithm and Saliency Model , 2012, IEEE Transactions on Multimedia.

[5]  Laurent D. Cohen,et al.  Combination of Piecewise-Geodesic Paths for Interactive Segmentation , 2014, International Journal of Computer Vision.

[6]  Lei Wei,et al.  Texture aware image segmentation using graph cuts and active contours , 2013, Pattern Recognit..

[7]  Xueqing Li,et al.  A Background Correction Method Based on Lazy Snapping , 2013, 2013 Seventh International Conference on Image and Graphics.

[8]  Sang Uk Lee,et al.  Nonparametric higher-order learning for interactive segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  Lena Gorelick,et al.  GrabCut in One Cut , 2013, 2013 IEEE International Conference on Computer Vision.

[10]  Vladimir Kolmogorov,et al.  Joint optimization of segmentation and appearance models , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[11]  Xiao-Yuan Jing,et al.  Interactive Multilabel Image Segmentation via Robust Multilayer Graph Constraints , 2016, IEEE Transactions on Multimedia.

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

[13]  Yiteng Pan,et al.  A novel region-based active contour model via local patch similarity measure for image segmentation , 2018, Multimedia Tools and Applications.

[14]  Guillermo Sapiro,et al.  Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting , 2009, International Journal of Computer Vision.

[15]  Tao Wang,et al.  Multi-layer graph constraints for interactive image segmentation via game theory , 2016, Pattern Recognit..

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

[17]  Xiao Chen,et al.  A matting method based on full feature coverage , 2018, Multimedia Tools and Applications.

[18]  Qiang Chen,et al.  Robust noise region-based active contour model via local similarity factor for image segmentation , 2017, Pattern Recognit..

[19]  Ertunc Erdil,et al.  Nonparametric Joint Shape and Feature Priors for Image Segmentation , 2017, IEEE Transactions on Image Processing.

[20]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[21]  Sim Heng Ong,et al.  Regional Interactive Image Segmentation Networks , 2017, 2017 IEEE International Conference on Computer Vision (ICCV).

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

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

[24]  Jeff A. Bilmes,et al.  Graph cuts with interacting edge weights: examples, approximations, and algorithms , 2014, Mathematical Programming.

[25]  Noel E. O'Connor,et al.  A comparative evaluation of interactive segmentation algorithms , 2010, Pattern Recognit..

[26]  Carsten Rother,et al.  DenseCut: Densely Connected CRFs for Realtime GrabCut , 2015, Comput. Graph. Forum.

[27]  Toby Sharp,et al.  Image segmentation with a bounding box prior , 2009, 2009 IEEE 12th International Conference on Computer Vision.

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

[29]  Yang Hu,et al.  A Fully Convolutional Two-Stream Fusion Network for Interactive Image Segmentation , 2018, Neural Networks.

[30]  Pushmeet Kohli,et al.  Non-parametric Higher-Order Random Fields for Image Segmentation , 2014, ECCV.

[31]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Pushmeet Kohli,et al.  Robust Higher Order Potentials for Enforcing Label Consistency , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.