Structural Matching by Discrete Relaxation

This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we focus on the issue of how relational inexactness may be quantified. We illustrate that several popular relational distance measures can be recovered as specific limiting cases of the Bayesian consistency measure. The second aspect of our comparison concerns the way in which structural inexactness is controlled. We investigate three different realizations of the matching process which draw on contrasting control models. The main conclusion of our study is that the active process of graph-editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter.

[1]  Olivier D. Faugeras,et al.  Semantic Description of Aerial Images Using Stochastic Labeling , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[3]  Josef Kittler,et al.  MFT based discrete relaxation for matching high order relational structures , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[4]  Andrew K. C. Wong,et al.  Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Edwin R. Hancock,et al.  Deterministic Search Stragtegies for Relational Graph Matching , 1997, EMMCVPR.

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

[8]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[9]  Anil K. Jain,et al.  CAD-Based Computer Vision: From CAD Models to Relational Graphs , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[12]  Harry G. Barrow,et al.  Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques , 1976, Inf. Process. Lett..

[13]  Avinash C. Kak,et al.  3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Edwin R. Hancock,et al.  Matching delaunay graphs , 1997, Pattern Recognit..

[15]  William J. Christmas,et al.  Probabilistic feature-labelling schemes: modelling compatibility coefficient distributions , 1996, Image Vis. Comput..

[16]  Robert M. Haralick,et al.  A Metric for Comparing Relational Descriptions , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

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

[19]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

[20]  Edwin R. Hancock,et al.  Resolving edge-line ambiguities using probabilistic relaxation , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

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

[22]  Eam Khwang Teoh,et al.  Pattern recognition by graph matching using the Potts MFT neural networks , 1995, Pattern Recognit..

[23]  Kim L. Boyer,et al.  Structural Stereopsis for 3-D Vision , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Josef Kittler,et al.  Discrete relaxation , 1990, Pattern Recognit..

[25]  E. Gardner.  Structure of metastable states in the Hopfield model , 1986 .

[26]  Edwin R. Hancock,et al.  A Bayesian compatibility model for graph matching , 1996, Pattern Recognit. Lett..

[27]  K. Boyer,et al.  Organizing Large Structural Modelbases , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[29]  Azriel Rosenfeld,et al.  3-D Shape Recovery Using Distributed Aspect Matching , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[30]  Federico Girosi,et al.  Parallel and Deterministic Algorithms from MRFs: Surface Reconstruction , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  Edwin R. Hancock,et al.  Relational matching with dynamic graph structures , 1995, Proceedings of IEEE International Conference on Computer Vision.

[32]  Edwin R. Hancock,et al.  Relational matching by discrete relaxation , 1995, Image Vis. Comput..

[33]  Josef Kittler,et al.  A Bayesian interpretation for the Hopfield network , 1993, IEEE International Conference on Neural Networks.