Abstract
Graph-based image segmentation techniques generally represent the problem in terms of a graph. In this work, we present a novel graph, called the directional nearest neighbor graph. The construction principle of this graph is that each node corresponding to a pixel in the image is connected to a fixed number of nearest neighbors measured by color value and the connected neighbors are distributed in four directions. Compared with the classical grid graph and the nearest neighbor graph, our method can capture low-level texture information using a less-connected edge topology. To test the performance of the proposed method, a comparison with other graph-based methods is carried out on synthetic and real-world images. Results show an improved segmentation for texture objects as well as a lower computational load.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blake A, Rother C, Brown M, et al. Interactive image segmentation using an adaptive GMMRF model. In: Proceedings of the 8th European Conference on Computer Vision-Part I, Prague, 2004. 428–441
Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans Pattern Anal Mach Intell, 2004, 26: 1124–1137
Grady L. Random walks for image segmentation. IEEE Trans Pattern Anal Mach Intell, 2006, 28: 1768–1783
Bai X, Sapiro G. A geodesic framework for fast interactive image and video segmentation and matting. In: The 11th IEEE International Conference on Computer Vision, Rio de Janeiro, 2007. 1–8
Price B L, Morse B, Cohen S. Geodesic graph cut for interactive image segmentation. In: The 23rd IEEE Conference on Computer Vision and Pattern Recognition, San Francisco, 2010, 3161–3168
Zhang J, Zheng J, Cai J. A diffusion approach to seeded image segmentation. In: The 23rd IEEE Conference on Computer Vision and Pattern Recognition, San Francisco, 2010, 2125–2132
Kolmogorov V, Rother C. Comparison of energy minimization algorithms for highly connected graphs. In: Proceedings of the 9th European Conference on Computer Vision, Graz, 2006. 1–15
Grady L, Jolly M P. Weights and topology: A study of the effects of graph construction on 3D image segmentation. Med Image Comput Comput-Assist Interv, 2008, 11: 153–161
Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: The 9th IEEE International Conference on Computer Vision, Nice, 2003. 26–33
Felzenszwalb P, Huttenlocher D. Efficient graph-based image segmentation. Int J Comput Vis, 2004, 59: 167–181
Wang F, Wang J, Zhang C, et al. Semi-supervised classsification using linear neighborhood propagation. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, New York, 2006. 160–167
Greig D, Porteous B, Seheult A. Exact maximum a posterior estimation for binary images. J R Stat Soc Ser B-Stat Methodol, 1989, 51: 271–279
Li Y, Sun J, Tang C, et al. Lazy snapping. In: Proceedings of ACM SIGGRAPH, Los Angeles, 2004. 303–308
Lempitsky V, Kohli P, Rother C, et al. Image segmentation with a bounding box prior. In: The 11th IEEE International Conference on Computer Vision, Kyoto, 2009. 277–284
Vicente S, Kolmogorov V, Rother C. Graph cut based image segmentation with connectivity priors. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Anchorage, 2008. 1–8
Kolmogorov V, Boykov Y. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In: The 10th IEEE International Conference on Computer Vision, Beijing, 2005. 564–571
Sinop A K, Grady L. A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In: The 11th IEEE International Conference on Computer Vision, Rio de Janeiro, 2007. 1–8
Shi J, Malik J. Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell, 2000, 22: 888–905
Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts. IEEE Trans Pattern Anal Mach Intell, 2001, 23: 1222–1239
Kolmogorov V, Rothe C. Minimizing nonsubmodular functions with graph cuts-A review. IEEE Trans Pattern Anal Mach Intell, 2007, 29: 1274–1279
Kohli P, Ladicky L, Torr P. Robust higher order potentials for enforcing label consistency. Int J Comput Vis, 2009, 82: 302–324
Meltzer T, Yanover C, Weiss Y. Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: The 10th IEEE International Conference on Computer Vision, Beijing, 2005. 428–435
Komodakis N, Tziritas G. A new framework for approximate labeling via graph-cuts. In: The 10th IEEE International Conference on Computer Vision, Beijing, 2005. 1018–1025
Strandmark P, Kahl F. Parallel and distributed graph cuts by dual decomposition. In: The 23rd IEEE Conference on Computer Vision and Pattern Recognition, San Francisco, 2010. 2085–2092
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Z., Hu, D., Shen, H. et al. Graph-based image segmentation using directional nearest neighbor graph. Sci. China Inf. Sci. 56, 1–10 (2013). https://doi.org/10.1007/s11432-012-4706-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-012-4706-4