Dominant set and target clique extraction

A standard paradigm to apply graph based representations to computer vision and pattern recognition is to construct a graph from the problem and then formulate the problem in terms of finding cliques in the graph. Many methods have been proposed to extract maximum clique, enumerate all cliques or a number of largest cliques. In this paper we present an approach to a new problem of target clique extraction, i.e., extracting a clique containing a particular vertex. This approach is based on the dominant set clustering and the recently proposed Infection and Immunization Dynamics. We intervene in the game evolution process and gear the convergence towards the target clique. Experiments validate the effectiveness of our approach.