This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A RKHS Interpolator-Based Graph Matching Algorithm
July 2002 (vol. 24 no. 7)
pp. 988-995

In this paper, we present a novel algorithm for performing attributed graph matching. This algorithm is derived from a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces. The algorithm incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on multiple sets of attributes. No assumption is made about the adjacency structure of the graphs to be matched.

[1] M. A. van Wyk and T.S. Durrani, “A Framework for Multi-Scale and Hybrid RKHS-Based Approximators,” IEEE Trans. Signal Processing, vol. 48, no. 12, pp. 3559-3568, 2000.
[2] M.A. van Wyk and W.-H. Steeb, Chaos in Electronics, Series: Mathematical Modeling: Theory and Applications. vol. 2,Dordrecht, the Netherlands: Kluwer Academic, 1997.
[3] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[4] M. You and K.C. Wong, “An Algorithm for Graph Optimal Isomorphism,” Proc. ICPR, pp. 316-319, 1984.
[5] W.-H. Tsai and K.-S. Fu, “Error-Correcting Isomorphisms of Attributed Relation Graphs for Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 9, pp. 757-768, 1979.
[6] W.-H. Tsai and K.-S. Fu, “Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 13, pp. 48-62, 1983.
[7] F. Depiero, M. Trived, and S. Serbin, “Graph Matching Using a Direct Classification of Node Attendance,” Pattern Recognition, vol. 29, no. 6, pp. 1031-1048, 1996.
[8] M.A. Eshera and K.-S. Fu, “A Graph Distance Measure for Image Analysis,” IEEE Trans. Systems, Man, and Cybernetics, vol. 14, no. 3, pp. 398-408, 1984.
[9] H. Bunke and K. Shearer, “A Graph-Distance Metric Based on the Maximal Common Subgraph,” Pattern Recognition Letters, vol. 19, nos. 3-4, pp. 255-259, 1998.
[10] H. Bunke and B. Messmer, “Recent Advances in Graph Matching,” Int'l J. Pattern Recognition Artificial Intelligence, vol. 11, no. 1, pp. 169-203, 1997.
[11] R. Allen, L. Cinque, S. Tanimoto, L. Shapiro, and D. Yasuda, “A Parallel Algorithm for Graph Matching and Its MarPlas Implementaion,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 5, pp. 490-501, 1997.
[12] H.A.L. Almohamad, “Polynomial Transform for Matching Pairs of Weighted Graphs,” Applied Math. Modeling, vol. 15, no. 4, pp. 216-222, 1991.
[13] H.A. Almohamad and S.O. Duffuaa, “A Linear Programming Approach for the Weighted Graph Matching Problem,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 5, pp. 522-525, May 1993.
[14] S. Umeyama, “An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, Sept. 1988.
[15] A. Rangarajan and E. Mjolsness, "A Lagrangian Relaxation Network for Graph Matching," IEEE Int'l Conf. Neural Networks (ICNN), vol. 7, pp. 4629-4634. IEEE Press, 1994.
[16] A. D.J. Cross, C. Wilson, and E.R. Hancock, “Inexact Matching Using Genetic Search,” Pattern Recognition, vol. 30, no. 6, pp. 953-970, 1997.
[17] D.E. Van Den Bout and T.K. Miller, III,“Graph partitioning using annealed neural network,” IEEE Trans. on Neural Networks, vol. 1, no. 2, June 1990.
[18] C. von der Malsburg, “Pattern Recognition by Labelled Graph Matching,” Neural Networks, vol. 1, pp. 141-148, 1988.
[19] P.D. Simic, "Constrained Nets for Graph Matching and Other Quadratic Assignment Problems," Neural Computation, vol. 3, pp. 268-281, 1991.
[20] E. Mjolsness and C. Garrett, “Algebraic Transformations of Objective Functions,” Neural Networks, vol. 3, pp. 651-669, 1990.
[21] S.-S. Yu and W.-H. Tsai, "Relaxation by the Hopfield Neural Network," Pattern Recognition, vol. 25, pp. 197-208, Feb. 1992.
[22] M. Peng and N. Gupta, “Invariant and Occluded Object Recognition Based on Graph Matching,” Int'l J. Electronic Eng. Education, vol. 32, pp. 31-38, 1995.
[23] S. Shams, “Multiple Elastic Modules for Visual Pattern Recognition,” Neural Networks, vol. 8, no. 9, pp. 1439-1465, 1995.
[24] E. Mjolsness, G. Gindi, and P. Anandan, “Optimization in Model Matching and Perceptual Organization,” Neural Computation, vol. 1, pp. 218-229, 1989.
[25] L. Kitchen, “Relaxation Applied to Matching Quantitative Relational Structures,” IEEE Trans. Systems Man Cybernetics, vol. 10, pp. 96-101, 1980.
[26] L. Kitchen and A. Rosenfeld, “Discrete Relaxation for Matching Relational Structures,” IEEE Trans. Systems Man Cybernetics, vol. 9, pp. 869-874, 1979.
[27] R.C. Wilson and E.R. Hancock, “Structural Matching by Discrete Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 6, pp. 634-648, June 1997.
[28] L.G. Shapiro and R.M. Haraldick, “Structural Descriptions and Inexact Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, no. 6, pp. 504-519, 1981.
[29] R.A. Hummel and S.W. Zucker, “On the Foundations of Relaxation Labelling Processes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 3, pp. 267-286, 1983.
[30] M. Pelillo and M. Refice, “Learning Compatibility Coefficients for Relaxation Labelling Processes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 9, pp. 933-945, Sept. 1994.
[31] L.S. Davis, “Shape Matching Using Relaxation Techniques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 1, pp. 60-72, 1979.
[32] S. Peleg, “A New Probabilistic Relaxation Scheme,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 2, no. 4, pp. 362-369, 1980.
[33] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749–764, Aug. 1995.
[34] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996.
[35] A.M. Finch, R.C. Wilson, and E.R. Hancock, “Symbolic Matching with the EM Algorithm,” Pattern Recognition, vol. 31, no. 11, pp. 1777-1790, 1998.
[36] M.L. Williams, R.C. Wilson, and E.R. Hancock, “Multiple Graph Matching with Bayesian Inference,” Pattern Recognition Letters, vol. 18, pp. 1275-1281, 1997.
[37] A.D.J. Cross and E.R. Hancock, Graph Matching with Dual Step Em Algorithm IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 1236-1253, 1998.
[38] R.C. Wilson and E.R. Hancock, “A Bayesian Compatibility Model for Graph Matching,” Pattern Recognition Letters, vol. 17, pp. 263-276, 1996.
[39] B.J. van Wyk, M.A. van Wyk, and F. Virolleau, “The CGGM Algorithm and its DSP implementation,” Proc. Third European DSP Conf. Education Resources, Sept. 2000.
[40] M.A. van Wyk and J. Clark, “An Algorithm for Approximate Least-Squares Attributed Graph Matching,” Problems in Applied Math. and Computational Intelligence, pp. 67-72, 2001.
[41] B.J. van Wyk and M.A. van Wyk, “The Spherical Approximation Graph Matching Algorithm,” Proc. Int'l Workshop Multidisciplinary Design Optimization, Aug., pp. 280-288 2000.
[42] M.A. van Wyk, B.J. van Wyk, and T.S. Durrani, “RKHS Interpolator-Based Graph and Subgraph Matching Algorithm,” Proc. PRASA Workshop, Nov., 1999.
[43] M. Pelillo, K. Siddiqi, and S.W. Zucker, “Matching Hierarchical Structures Using Association Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 11, pp. 1105-1120, 1999.
[44] J.T.L. Wang, K. Zhang, K. Jeong, and D. Shasha, “A System for Approximate Tree Matching,” IEEE Trans. Knowledge and Data Eng., vol. 6, no. 4, pp. 559-571, Aug. 1994.
[45] S.Y. Lu, “A Tree Matching Algorithm Based on Tree Merging and Node Splitting,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 249-255, 1984.
[46] D.W. Matula, “An Algorithm for Subtree Identification,” SIAM Rev., vol. 10, pp. 273-274, 1968.
[47] S.W. Reyner, “An Analysis of a Good Algorithm for the Subtree Problem,” SIAM J. Computing, vol. 6, pp. 730-732, 1977.
[48] D. Shasha, J. Wang, and K. Zhang, “Exact and Approximate Algorithm for Unordered Tree Matching,” IEEE Trans. Systems, Man, and Cybernetics, vol. 24, no. 4, pp. 668-678, 1994.
[49] P.R. Halmos, Measure Theory. Princeton, NJ: Van Nostrand Co., 1964.
[50] S.Z. Li, “Matching: Invariant to Translations Rotations and Scale Changes,” Pattern Recognition, vol. 25, no. 8, pp. 583-594, 1992.
[51] R.J.P. De Figueiredo and G. Chen, Nonlinear Feedback Control Systems: An Operator Theory Approach. San Diego, CA: Academic Press, 1993.
[52] S. Haykin, Adaptive Filter Theory. Upper Saddle River, NJ: Prentice Hall, 1996.
[53] D.G. Luenberger, Optimization by Vector Space Methods. New York: John Wiley&Sons, 1969.
[54] B. Noble and J.W. Daniel, Applied Linear Algebra, Third ed. Englewood Cliffs, NJ: Prentice Hall, 1988.
[55] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[56] A. Chichocki and R. Unbehauen, Neural Networks for Optimization and Signal Processing, John Wiley&Sons, Stuttgart, 1993.

Index Terms:
Graph matching, attributed relational graphs, reproducing kernel Hilbert space theory, combinatorial optimization, neural networks, pattern matching, image processing.
Citation:
Michaël A. van Wyk, Tariq S. Durrani, Barend J. van Wyk, "A RKHS Interpolator-Based Graph Matching Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 988-995, July 2002, doi:10.1109/TPAMI.2002.1017624
Usage of this product signifies your acceptance of the Terms of Use.