Robust interactive image segmentation via graph-based manifold ranking
- 756 Downloads
Interactive image segmentation aims at classifying the image pixels into foreground and background classes given some foreground and background markers. In this paper, we propose a novel framework for interactive image segmentation that builds upon graph-based manifold ranking model, a graph-based semi-supervised learning technique which can learn very smooth functions with respect to the intrinsic structure revealed by the input data. The final segmentation results are improved by overcoming two core problems of graph construction in traditional models: graph structure and graph edge weights. The user provided scribbles are treated as the must-link and must-not-link constraints. Then we model the graph as an approximatively k-regular sparse graph by integrating these constraints and our extended neighboring spatial relationships into graph structure modeling. The content and labels driven locally adaptive kernel parameter is proposed to tackle the insufficiency of previous models which usually employ a unified kernel parameter. After the graph construction, a novel three-stage strategy is proposed to get the final segmentation results. Due to the sparsity and extended neighboring relationships of our constructed graph and usage of superpixels, our model can provide nearly real-time, user scribble insensitive segmentations which are two core demands in interactive image segmentation. Last but not least, our framework is very easy to be extended to multi-label segmentation, and for some less complicated scenarios, it can even get the segmented object through single line interaction. Experimental results and comparisons with other state-of-the-art methods demonstrate that our framework can efficiently and accurately extract foreground objects from background.
Keywordsinteractive image segmentation graph structure graph edge weights manifold ranking relevance inference
- Boykov Y. Y.; Jolly M.-P. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In: Proceedings of the Eighth IEEE International Conference on Computer Vision, Vol. 1, 105–112, 2001.Google Scholar
- Mortensen E. N.; Barrett W. A. Intelligent scissors for image composition. In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, 191–198, 1995.Google Scholar
- Kim T. H.; Lee K. M.; Lee S. U. Generative image segmentation using random walks with restart. In: Lecture Notes in Computer Science, Vol. 5304. Berlin Heidelberg: Springer, 264–275, 2008.Google Scholar
- Greig D. M.; Porteous B. T.; Seheult A. H. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society. Series B (Methodological) Vol. 51, No. 2, 271–279, 1989.Google Scholar
- Zhou, D.; Bousquet, O.; Lal T. N.; Weston, J.; Schölkopf, B. Learning with local and global consistency. In: Proceedings of Advances in Neural Information Processing Systems, 321–328, 2003.Google Scholar
- Zhou, D.; Weston, J.; Gretton, A.; Bousquest, O.; Schölkopf, B. Ranking on data manifolds. In: Proceedings of Advances in Neural Information Processing Systems, 2004. Available at http://papersnipscc/paper/2447-ranking-ondata-manifoldspdf.Google Scholar
- Liu J. Y.; Sun, J.; Shum H. Y. Paint selection. In: Proceedings of ACM SIGGRAPH 2009 papers, Article No. 69, 2009.Google Scholar
- Sinop A. K.; Grady L. A seeded image segmentation framework unifying graph cuts and randomwalker which yields a new algorithm. In: Proceedings of IEEE 11th International Conference on Computer Vision, 1–8, 2007.Google Scholar
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.