Abstract
This paper introduces a novel algorithm for performing Attributed Graph Matching (AGM). A salient characteristic of the Interpolator-Based Kronecker Product Graph Matching (IBKPGM) algorithm is that it does not require the explicit calculation of compatibility values between vertices and edges, either using compatibility functions or probability distributions. No assumption is made about the adjacency structure of the graphs to be matched. The IBKPGM algorithm uses Reproducing Kernel Hilbert Space (RKHS) interpolator theory to obtain an unconstrained estimate to the Kronecker Match Matrix (KMM) from which a permutation sub-matrix is inferred.
Chapter PDF
Similar content being viewed by others
Keywords
- Reproduce Kernel Hilbert Space
- Graph Match
- Optimal Assignment
- Compatibility Function
- Pattern Recognition Letter
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.
References
Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching, IEEE Trans. Patt. Anal. Machine Intell., Vol. 18(4) (1996)377ā388
You, M., Wong, K. C.: An Algorithm for Graph Optimal Isomorphism, Proc. ICPR, (1984) 316ā319
Tsai, W.-H., Fu, K.-S.: Error-Correcting Isomorphisms of Attributed Relation Graphs for Pattern Recognition, IEEE Trans. Syst. Man Cybern., Vol. 9(1979)757ā768
Tsai, W.-H., Fu, K.-S.: Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition, IEEE Trans. Systems, Man, Cybernetics, Vol. 13(1983)48ā62
Depiero, F., Trived, M., Serbin, S.: Graph Matching using a Direct Classification of Node Attendance, Pattern Recognition, Vol. 29(6) (1996) 1031ā1048
Eshera, M. A., Fu, K-S.: A Graph Distance Measure for Image Analysis, IEEE Trans. Syst. Man Cybern., Vol. 14(3)(1984)
Bunke, H., Messmer, B.: Recent Advances in Graph Matching, Int. J. Pattern Recognition Artificial Intell., Vol. 11(1)(1997)169ā203
Almohamad, H. A. L., Duffuaa, S. O.: A Linear Programming Approach for the Weighted Graph Matching Problem, IEEE Trans. Patt. Anal. Machine Intell., Vol. 15(5) (1993)522ā525
Almohamad, H. A. L.: Polynomial Transform for Matching Pairs of Weighted Graphs, Applied Mathematical Modelling, Vol. 15(4)(1991)216ā222
Umeyama, S.: An Eigendecomposition Approach to Weighted Graph Matching Problems, IEEE Trans. Patt. Anal. Machine Intell., Vol. 10(5) (1988)695ā703
Hummel, R. A., Zucker, S. W.: On the Foundations of Relaxation Labelling Processes, IEEE Trans. Patt. Anal. Machine Intell., Vol. 5(3)(1983)267ā286
Peleg, S.: A New Probabilistic Relaxation Scheme, IEEE Trans. Patt. Anal. Machine Intell., 2(4) (1980)362ā369
Christmas, W. J., Kittler, J., Petrou, M.: Structural Matching in Computer Vision using Probabilistic Relaxation, IEEE Trans. Patt. Anal. Machine Intell., Vol. 17(8) (1995)749ā764
Finch, A. M., Wilson, R. C., Hancock, R.: Symbolic Matching with the EM Algorithm, Pattern Recognition, Vol. 31(11)(1998)1777ā1790
Williams, M. L., Wilson, R. C., Hancock, E. R.: Multiple Graph Matching with Bayesian Inference, Pattern Recognition Letters, Vol. 18(1997)1275ā1281
Cross, A. D. J., Hancock, E. R.: Graph Matching with a Dual Step EM Algorithm, IEEE Trans. Patt. Anal. Machine Intell., Vol. 20(11)(1998)1236ā1253
Wilson, R. C., Hancock, E. R.: A Bayesian Compatibility Model for Graph Matching, Pattern Recognition Letters, Vol. 17(1996)263ā276
Cross, A. D. J., Wilson, C., Hancock, E. R.: Inexact Matching Using Genetic Search, Pattern Recognition, Vol. 30(6) (1997)953ā970
Wilson, R. C., Hancock, E. R.: Structural Matching by Discrete Relaxation, IEEE Trans. Patt. Anal. Machine Intell., Vol. 19(8) (1997)634ā648
van Wyk, M. A., Durrani, T. S.: A Framework for Multi-Scale and Hybrid RKHS-Based Approximators, IEEE Trans. Signal Proc., Vol. 48(12) (2000)3559ā3568
van Wyk, M. A., Durrani, T. S., van Wyk, B. J.: A RKHS Interpolator-Based Graph Matching Algorithm, To appear in IEEE Trans. Patt. Anal. Machine Intell, July 2002
Van Wyk, M. A., Clark, J.: An Algorithm for Approximate Least-Squares Attributed Graph Matching, in Problems in Applied Mathematics and Computational Intelligence, N. Mastorakis (ed.), World Science and Engineering Society Press, (2001) 67ā72
Luenberger, D. G.: Optimization by Vector Space Methods, New York, NY: John Wiley & Sons, 1969
van Wyk, B. J., van Wyk, M. A., Virolleau, F.: The CGGM Algorithm and its DSP implementation, Proc. 3rd European DSP Conference on Education and Research, ESIEE-Paris, 20ā21 September, 2000
Faugeras, O. D., Price, K. E.: Semantic Description of Aerial Images Using Stochastic Labeling, IEEE Trans. Patt. Anal. Machine Intell., Vol. 3(6)(1981)633ā642
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Wyk, B.J., van Wyk, M.A. (2002). Non-bayesian Graph Matching without Explicit Compatibility Calculations. In: Caelli, T., Amin, A., Duin, R.P.W., de Ridder, D., Kamel, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2002. Lecture Notes in Computer Science, vol 2396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70659-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-70659-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44011-6
Online ISBN: 978-3-540-70659-5
eBook Packages: Springer Book Archive