Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems

  • Samuel Rota Bulò
  • Immanuel M. Bomze
  • Marcello Pelillo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6218)


We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of ”players,” for finding dominant sets, a powerful graph-theoretical notion of a cluster. Each step of the proposed dynamics is shown to have a linear time/space complexity and we show that, under the assumption of symmetric affinities, the average population payoff is strictly increasing along any non-constant trajectory, thereby allowing us to prove that dominant sets are asymptotically stable (i.e., attractive) points for the proposed dynamics. The approach is general and can be applied to a large class of quadratic optimization problems arising in computer vision. Experimentally, the proposed dynamics is found to be orders of magnitude faster than and as accurate as standard algorithms.


Nash Equilibrium Image Segmentation Mixed Strategy Pure Strategy Image Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Pavan, M., Pelillo, M.: Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Machine Intell. 29(1), 167–172 (2007)CrossRefGoogle Scholar
  2. 2.
    Neumann, J., von Cramon, D.Y., Forstmann, B.U., Zysset, S., Lohmann, G.: The parcellation of cortical areas using replicator dynamics in fMRI. NeuroImage 32(1), 208–219 (2006)CrossRefGoogle Scholar
  3. 3.
    Wang, M., Ye, Z.L., Wang, Y., Wang, S.X.: Dominant sets clustering for image retrieval. Signal Process. 88(11), 2843–2849 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Hamid, R., Johnson, A., Batta, S., Bobick, A., Isbell, C., Coleman, G.: Detection and explanation of anomalous activities: representing activities as bags of event n-grams. In: CVPR, vol. 1, pp. 20–25 (2005)Google Scholar
  5. 5.
    Frommlet, F.: Tag SNP selection based on clustering according to dominant sets found using replicator dynamics. Adv. in Data Analysis (in press, 2010)Google Scholar
  6. 6.
    Wei, Q.D., Hu, W.M., Zhang, X.Q., Luo, G.: Dominant sets-based action recognition using image sequence matching. In: ICIP, vol. 6, pp. 133–136 (2007)Google Scholar
  7. 7.
    Albarelli, A., Torsello, A., Rota Bulò, S., Pelillo, M.: Matching as a non-cooperative game. In: ICCV (2009)Google Scholar
  8. 8.
    Todorovic, S., Ahuja, N.: Region-based hierarchical image matching. Int. J. Comput. Vision 78(1), 47–66 (2008)CrossRefGoogle Scholar
  9. 9.
    Torsello, A., Rota Bulò, S., Pelillo, M.: Grouping with asymmetric affinities: a game-theoretic perspective. In: CVPR, pp. 292–299 (2006)Google Scholar
  10. 10.
    Weibull, J.W.: Evolutionary game theory. Cambridge University Press, Cambridge (1995)zbMATHGoogle Scholar
  11. 11.
    Bomze, I.M., Pötscher, B.M.: Game Theoretical Foundations of Evolutionary Stability. Springer, Heidelberg (1989)zbMATHGoogle Scholar
  12. 12.
    Bomze, I.M., Weibull, J.W.: Does neutral stability imply Lyapunov stability ? Games and Econ. Behaviour 11, 173–192 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Rota Bulò, S.: A game-theoretic framework for similarity-based data clustering. PhD thesis, University of Venice (2009)Google Scholar
  14. 14.
    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: ICCV, July 2001, vol. 2, pp. 416–423 (2001)Google Scholar
  15. 15.
    Pavan, M., Pelillo, M.: Efficient out-of-sample extension of dominant-set clusters. NIPS 17, 1057–1064 (2005)Google Scholar
  16. 16.
    Fowlkes, C., Belongie, S., Malik, F.C.J.: Spectral grouping using the Nyström method. IEEE Trans. Pattern Anal. Machine Intell. 26(2), 214–225 (2004)CrossRefGoogle Scholar
  17. 17.
    Pardalos, P.M.: Quadratic problems defined on a convex hull of points. BIT Num. Math. 28(2), 323–329 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Bomze, I.M., Locatelli, M., Tardella, F.: Efficient and cheap bounds for (standard) quadratic optimization. Technical report, University ”La Sapienza” of Rome (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Samuel Rota Bulò
    • 1
  • Immanuel M. Bomze
    • 2
  • Marcello Pelillo
    • 1
  1. 1.Dipartimento di InformaticaUniv. of VeniceItaly
  2. 2.Department of Statistics and Decision Support SystemsUniv. of ViennaAustria

Personalised recommendations