Abstract
State-of-the-art approaches in interactive image segmentation often fail for objects exhibiting complex color variability, similar colors or difficult lighting conditions. The reason is that they treat the given user information as independent and identically distributed in the input space yielding a single color distribution per region. Due to their strong overlap segmentation often fails. By statistically taking into account the local distribution of the scribbles we obtain spatially varying color distributions, which are locally separable and allow for weaker regularization assumptions. Starting from a Bayesian formulation for image segmentation, we derive a variational framework for multi-region segmentation, which incorporates spatially adaptive probability density functions. Minimization is done by three different optimization methods from the MRF and PDE community. We discuss advantages and drawbacks of respective algorithms and compare them experimentally in terms of segmentation accuracy, quantitative performance on the Graz benchmark and speed.
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
Akaike, H.: An approximation to the density function. Ann. Inst. Statist. Math. 6, 127–132 (1954)
Alahari, K., Kohli, P., Torr, P.: Dynamic hybrid algorithms for map inference in discrete mrfs. Trans. Pattern Anal. Mach. Intell. 32(10), 1846–1857 (2010)
Bai, X., Sapiro, G.: A geodesic framework for fast interactive image and video segmentation and matting. In: Proc. of ICCV (2007)
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in computer vision. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 359–374. Springer, Heidelberg (2001)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on Patt. Anal. and Mach. Intell. 23(11), 1222–1239 (2001)
Chambolle, A., Cremers, D., Pock, T.: A convex approach for computing minimal partitions. Technical report TR-2008-05, University of Bonn (2008)
Goldschlager, L., Shaw, R., Staples, J.: The maximum flow problem is log space complete for p. Theoretical Computer Science 21, 105–111 (1982)
Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc., Ser. B 51(2), 271–279 (1989)
Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., Cremers, D.: An experimental comparison of discrete and continuous shape optimization methods. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol. 5302, pp. 332–345. Springer, Heidelberg (2008)
Komodakis, N., Tziritas, G.: A new framework for approximate labeling via graph cuts. In: Proc. of ICCV, pp. 1018–1025 (2005)
Lellmann, J., Breitenreicher, D., Schnörr, C.: Fast and exact primal-dual iterations for variational problems in computer vision. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6312, pp. 494–505. Springer, Heidelberg (2010)
Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnörr, C.: Convex multiclass image labeling by simplex-constrained total variation. In: Technical Report, HCI, IWR, University of Heidelberg (2008)
Nieuwenhuis, C., Berkels, B., Rumpf, M., Cremers, D.: Interactive motion segmentation. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds.) Pattern Recognition. LNCS, vol. 6376, pp. 483–492. Springer, Heidelberg (2010)
Pock, T., Chambolle, A., Cremers, D., Bischof, H.: A convex relaxation approach for computing minimal partitions. In: Proc. of CVPR (2009)
Potts, R.B.: Some generalized order-disorder transformations. Proc. Camb. Phil. Soc. 48, 106–109 (1952)
Rosenblatt, F.: Remarks on some nonparametric estimates of a density function. Annals of Mathematical Statistics 27, 832–837 (1956)
Rother, C., Kolmogorov, V., Blake, A.: Grab-cut: interactive foreground segmentation using iterated graph cuts. ACM Transactions on Graphics 23(3), 309–314 (2004)
Santner, J.: Interactive Multi-label segmentation. PhD thesis, University of Graz (2010)
Santner, J., Pock, T., Bischof, H.: Interactive multi-label segmentation. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part I. LNCS, vol. 6492, pp. 397–410. Springer, Heidelberg (2011)
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 16–29. Springer, Heidelberg (2006)
Unger, M., Pock, T., Trobin, W., Cremers, D., Bischof, H.: Tvseg - interactive total variation based image segmentation. In: Proc. of BMVC (2008)
Zach, C., Gallup, D., Frahm, J.-M., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: Vision, Modeling and Visualization Workshop, VMV (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nieuwenhuis, C., Töppe, E., Cremers, D. (2011). Space-Varying Color Distributions for Interactive Multiregion Segmentation: Discrete versus Continuous Approaches. In: Boykov, Y., Kahl, F., Lempitsky, V., Schmidt, F.R. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2011. Lecture Notes in Computer Science, vol 6819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23094-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-23094-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23093-6
Online ISBN: 978-3-642-23094-3
eBook Packages: Computer ScienceComputer Science (R0)