A unifying framework for relational structure matching

The matching of relational structures is a problem that pervades computer vision and pattern recognition research. During the past few decades, two radically distinct approaches have been pursued to tackle it. The first views the matching problem as one of explicit search in state-space. The most popular method within this class consists of transforming it in the equivalent problem of finding a large maximal clique in a derived "association graph." In the second approach, the relational matching problem is viewed as one of energy minimization. In this paper we provide a unifying framework for relational structure matching which does unify the two existing approaches. The work is centered around a remarkable result proved by Motzkin and Straus (1965) which allows us to formulate the maximum clique problem in terms of a continuous optimization problem. We present a class of continuous- and discrete-time "replicator" dynamical systems developed in evolutionary game theory and show how they can naturally be employed to solve our relational matching problem. Experiments are presented which demonstrate the effectiveness of the proposed approach.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Radu Horaud,et al.  Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Immanuel M. Bomze,et al.  Evolution towards the Maximum Clique , 1997, J. Glob. Optim..

[5]  Marcello Pelillo,et al.  Replicator Equations, Maximal Cliques, and Graph Isomorphism , 1998, Neural Computation.

[6]  R. Bolles,et al.  Recognizing and Locating Partially Visible Objects: The Local-Feature-Focus Method , 1982 .

[7]  Marcello Pelillo,et al.  Relaxation labeling networks that solve the maximum clique problem , 1995 .

[8]  Harry G. Barrow,et al.  A Versatile Computer-Controlled Assembly System , 1973, IJCAI.

[9]  M. Pelillo.  Relaxation labeling networks for the maximum clique problem , 1996 .

[10]  Eric Mjolsness,et al.  A Novel Optimizing Network Architecture with Applications , 1996, Neural Computation.

[11]  Robert C. Bolles,et al.  Locating Partially Visible Objects: The Local Feature Focus Method , 1980, AAAI.

[12]  King-Sun Fu,et al.  Subgraph error-correcting isomorphisms for syntactic pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[15]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[16]  A. Jagota,et al.  Feasible and infeasible maxima in a quadratic program for maximum clique , 1996 .

[17]  Panos M. Pardalos,et al.  Continuous Characterizations of the Maximum Clique Problem , 1997, Math. Oper. Res..

[18]  Stan Z. Li,et al.  Matching: Invariant to translations, rotations and scale changes , 1992, Pattern Recognit..

[19]  Harry G. Barrow,et al.  A Versatile System for Computer-Controlled Assembly , 1975, Artif. Intell..

[20]  Josef Hofbauer,et al.  The theory of evolution and dynamical systems , 1988 .

[21]  Eric Mjolsness,et al.  A Lagrangian relaxation network for graph matching , 1996, IEEE Trans. Neural Networks.

[22]  Petar D. Simic.  Constrained Nets for Graph Matching and Other Quadratic Assignment Problems , 1991, Neural Comput..

[23]  Kaleem Siddiqi,et al.  Matching Hierarchical Structures Using Association Graphs , 1999, IEEE Trans. Pattern Anal. Mach. Intell..