Unsupervised Image Co-segmentation Based on Cooperative Game

  • Bo-Chen Lin
  • Ding-Jie Chen
  • Long-Wen Chang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9005)


In computer vision, co-segmentation is defined as the task of jointly segmenting the common objects in a given set of images. Most proposed co-segmentation algorithms have the assumptions that the common objects are singletons or with the similar size. In addition, they might assume that the background features are simple or discriminative. This paper presents a cooperative co-segmentation without these assumptions. In the proposed cooperative co-segmentation algorithm, each image is treated as a player. By using the cooperative game, heat diffusion, and image saliency, we design a constrained utility function for each player. This constrained utility function push all players, with the instinct to maximize their self-utility, to cooperatively define the common-object labels. We then use cooperative cut to segment the common objects according to the common-object labels. Experimental results demonstrate that the proposed method outperforms the state-of-the-art co-segmentation methods in the segmentation accuracy of the common objects in the images.


  1. 1.
    Rother, C., Minka, T.P., Blake, A., Kolmogorov, V.: Cosegmentation of image pairs by histogram matching - incorporating a global constraint into MRFs. In: CVPR, vol. 1, pp. 993–1000 (2006)Google Scholar
  2. 2.
    Batra, D., Kowdle, A., Parikh, D., Luo, J., Chen, T.: iCoseg: interactive co-segmentation with intelligent scribble guidance. In: CVPR, pp. 3169–3176 (2010)Google Scholar
  3. 3.
    Batra, D., Kowdle, A., Parikh, D., Luo, J., Chen, T.: Interactively co-segmentating topically related images with intelligent scribble guidance. Int. J. Comput. Vis. 93, 273–292 (2011)CrossRefGoogle Scholar
  4. 4.
    Chu, W.-S., Chen, C.-P., Chen, C.-S.: MOMI-cosegmentation: simultaneous segmentation of multiple objects among multiple images. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part I. LNCS, vol. 6492, pp. 355–368. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  5. 5.
    Hochbaum, D.S., Singh, V.: An efficient algorithm for co-segmentation. In: ICCV, pp. 269–276 (2009)Google Scholar
  6. 6.
    Joulin, A., Bach, F.R., Ponce, J.: Discriminative clustering for image co-segmentation. In: CVPR, pp. 1943–1950 (2010)Google Scholar
  7. 7.
    Mukherjee, L., Singh, V., Dyer, C.R.: Half-integrality based algorithms for cosegmentation of images. In: CVPR, pp. 2028–2035 (2009)Google Scholar
  8. 8.
    Vicente, S., Kolmogorov, V., Rother, C.: Cosegmentation revisited: models and optimization. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part II. LNCS, vol. 6312, pp. 465–479. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  9. 9.
    Kim, G., Xing, E.P., Li, F.F., Kanade, T.: Distributed cosegmentation via submodular optimization on anisotropic diffusion. In: ICCV, pp. 169–176 (2011)Google Scholar
  10. 10.
    Zhang, J., Zheng, J., Cai, J.: A diffusion approach to seeded image segmentation. In: CVPR, pp. 2125–2132 (2010)Google Scholar
  11. 11.
    Bruhn, A., Weickert, J., Schnörr, C.: Lucas/kanade meets horn/schunck: combining local and global optic flow methods. Int. J. Comput. Vis. 61, 211–231 (2005)CrossRefGoogle Scholar
  12. 12.
    Harel, J., Koch, C., Perona, P.: Graph-based visual saliency. In: NIPS, pp. 545–552 (2006)Google Scholar
  13. 13.
    Osborne, M.: An Introduction to Game Theory. Oxford University Press, Oxford (2004) Google Scholar
  14. 14.
    Chen, Y., Wang, B., Lin, W.S., Wu, Y., Liu, K.J.R.: Cooperative peer-to-peer streaming: an evolutionary game-theoretic approach. IEEE Trans. Circ. Syst. Video Techn. 20, 1346–1357 (2010)CrossRefGoogle Scholar
  15. 15.
    Hsiao, P.C., Chang, L.W.: Image denoising with dominant sets by a coalitional game approach. IEEE Trans. Image Process. 22, 724–738 (2013)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Jegelka, S., Bilmes, J.: Submodularity beyond submodular energies: coupling edges in graph cuts. In: CVPR, pp. 1897–1904 (2011)Google Scholar
  17. 17.
    Levinshtein, A., Stere, A., Kutulakos, K.N., Fleet, D.J., Dickinson, S.J., Siddiqi, K.: Turbopixels: fast superpixels using geometric flows. IEEE Trans. Pattern Anal. Mach. Intell. 31, 2290–2297 (2009)CrossRefGoogle Scholar
  18. 18.
    Murphy, K.P., Weiss, Y., Jordan, M.I.: Loopy belief propagation for approximate inference: an empirical study. In: UAI, pp. 467–475 (1999)Google Scholar
  19. 19.
    Rother, C., Kolmogorov, V., Blake, A.: "grabcut”: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. 23, 309–314 (2004)CrossRefGoogle Scholar
  20. 20.
    Vicente, S., Kolmogorov, V., Rother, C.: Graph cut based image segmentation with connectivity priors. In: CVPR (2008)Google Scholar
  21. 21.
    Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: ICCV, pp. 105–112 (2001)Google Scholar
  22. 22.
    Winn, J.M., Criminisi, A., Minka, T.P.: Object categorization by learned universal visual dictionary. In: ICCV, pp. 1800–1807 (2005)Google Scholar
  23. 23.
    Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Li, F.F.: Imagenet: a large-scale hierarchical image database. In: CVPR, pp. 248–255 (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan

Personalised recommendations