Speaker: Marcello Pelillo, professor, University of Venice, Venice, Italy.

Abstract: The talk will provide an overview of "dominant sets", a graph-theoretic notion of a cluster which generalizes the concept of a maximal clique to edge-weighted graphs and has intriguing connections with optimization theory and (evolutionary) game theory. The idea is general and can be applied to weighted graphs, digraphs and hypergraphs alike. After introducing the basic properties of dominant sets, along with some generalizations, I’ll discuss a few recent computer vision applications, including interactive image segmentation and group behavior analysis.