Abstract
In this article we propose a method for parameter learning within the energy minimisation framework for segmentation. We do this in an incremental way where user input is required for resolving segmentation ambiguities. Whereas most other interactive learning approaches focus on learning appearance characteristics only, our approach is able to cope with learning prior terms; in particular the Potts terms in binary image segmentation. The artificial as well as real examples illustrate the applicability of the approach.
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
Schlesinger, D., Flach, B.: A probabilistic segmentation scheme. In: Rigoll, G. (ed.) DAGM 2008. LNCS, vol. 5096, pp. 183–192. Springer, Heidelberg (2008)
Woodford, O.J., Rother, C., Kolmogorov, V.: A global perspective on map inference for low-level vision. In: IEEE International Conference on Computer Vision (ICCV) (October 2009)
Peng, B., Veksler, O.: Parameter selection for graph cut based image segmentation. In: British Machine Vision Conference (BMVC) (September 2008)
Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30–55 (1989)
Kolmogorov, V., Boykov, Y., Rother, C.: Applications of parametric maxflow in computer vision. In: IEEE 11th International Conference on Computer Vision, ICCV 2007, pp. 1–8 (October 2007)
Rother, C., Kolmogorov, V., Blake, A.: “grabcut”: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. 23(3), 309–314 (2004)
Boykov, Y.Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images (2001)
Blake, A., Rother, C., Brown, M., Pérez, P., Torr, P.H.S.: Interactive image segmentation using an adaptive gmmrf model. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004, Part I. LNCS, vol. 3021, pp. 428–441. Springer, Heidelberg (2004)
Boykov, Y., Olga Veksler, R.Z.: Efficient approximate energy minimization via graph cuts. IEEE transactions on PAMI 20, 1222–1239 (2001)
Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 26(2), 147–159 (2004)
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(9), 1124–1137 (2004)
Schlesinger, M.I., Hlaváč, V.: Ten lectures on statistical and structural pattern recognition. Computational Imaging and Vision, vol. 24. Kluwer Academic Publishers, Dordrecht (2002)
Franc, V., Savchynskyy, B.: Discriminative learning of max-sum classifiers. Journal of Machine Learning Research 9, 67–104 (2008)
Nickisch, H., Kohli, P., Rother, C.: Learning an interactive segmentation system (December 2009), http://arxiv.org/abs/0912.2492
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int’l. Conf. Computer Vision, vol. 2, pp. 416–423 (July 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirmizigül, D., Schlesinger, D. (2010). Incremental Learning in the Energy Minimisation Framework for Interactive Segmentation. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds) Pattern Recognition. DAGM 2010. Lecture Notes in Computer Science, vol 6376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15986-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-15986-2_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15985-5
Online ISBN: 978-3-642-15986-2
eBook Packages: Computer ScienceComputer Science (R0)