Abstract
Recently, optimization with graph cuts became very attractive but generally remains limited to small-scale problems due to the large memory requirement of graphs, even when restricted to binary variables. Unlike previous heuristics which generally fail to fully capture details, [8] proposes another band-based method for reducing these graphs in image segmentation. This method provides small graphs while preserving thin structures but do not offer low memory usage when the amount of regularization is large. This is typically the case when images are corrupted by an impulsive noise. In this paper, we overcome this situation by embedding a new parameter in this method to both further reducing graphs and filtering the segmentation. This parameter avoids any post-processing steps, appears to be generally less sensitive to noise variations and offers a good robustness against noise. We also provide an empirical way to automatically tune this parameter and illustrate its behavior for segmenting grayscale and color images.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bouman, C.A.: Cluster: An unsupervised algorithm for modeling Gaussian mixtures (April 1997), http://www.ece.purdue.edu/string~bouman
Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: ICCV, vol. 1, pp. 105–112 (2001)
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on PAMI 26(9), 1124–1137 (2004)
Delong, A., Boykov, Y.: A scalable graph-cut algorithm for N-D grids. In: CVPR, pp. 1–8 (2008)
Kohli, P., Lempitsky, V., Rother, C.: Uncertainty Driven Multi-scale Optimization. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds.) DAGM 2010. LNCS, vol. 6376, pp. 242–251. Springer, Heidelberg (2010)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Transactions on PAMI 26(2), 147–159 (2004)
Lempitsky, V., Boykov, Y.: Global optimization for shape fitting. In: CVPR, pp. 1–8 (2007)
Lermé, N., Malgouyres, F., Létocart, L.: Reducing graphs in graph cut segmentation. In: ICIP, pp. 3045–3048 (2010)
Li, Y., Sun, J., Tang, C.K., Shum, H.Y.: Lazy Snapping. ACM Transactions on Graphics 23(3), 303–308 (2004)
Lombaert, H., Sun, Y.Y., Grady, L., Xu, C.Y.: A multilevel banded graph cuts method for fast image segmentation. In: ICCV, vol. 1, pp. 259–265 (2005)
Rother, C., Kolmogorov, V., Blake, A.: “GrabCut”: Interactive foreground extraction using iterated graph cuts. In: SIGGRAPH, pp. 309–314 (2004)
Sinop, A.K., Grady, L.: Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids. In: Larsen, R., Nielsen, M., Sporring, J. (eds.) MICCAI 2006. LNCS, vol. 4191, pp. 896–903. Springer, Heidelberg (2006)
Strandmark, P., Kahl, F.: Parallel and distributed graph cuts by dual decomposition. In: CVPR, pp. 2085–2092 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lermé, N., Malgouyres, F. (2012). Simultaneous Segmentation and Filtering via Reduced Graph Cuts. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P., Zemčík, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2012. Lecture Notes in Computer Science, vol 7517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33140-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-33140-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33139-8
Online ISBN: 978-3-642-33140-4
eBook Packages: Computer ScienceComputer Science (R0)