This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Graduated Assignment Algorithm for Graph Matching
April 1996 (vol. 18 no. 4)
pp. 377-388

Abstract—A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, two-way (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity [O(lm), where l and m are the number of links in the two graphs] and robustness in the presence of noise offer advantages over traditional combinatorial approaches. The algorithm, not restricted to any special class of graph, is applied to subgraph isomorphism, weighted graph matching, and attributed relational graph matching. To illustrate the performance of the algorithm, attributed relational graphs derived from objects are matched. Then, results from twenty-five thousand experiments conducted on 100 node random graphs of varying types (graphs with only zero-one links, weighted graphs, and graphs with node attributes and multiple link types) are reported. No comparable results have been reported by any other graph matching algorithm before in the research literature. Twenty-five hundred control experiments are conducted using a relaxation labeling algorithm and large improvements in accuracy are demonstrated.

[1] L.G. Shapiro and R.M. Haralick, "Structural Descriptions and Inexact Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 504-519, Sept. 1981.
[2] K.S. Fu, "A Step Towards Unification of Syntactic and Statistical Pattern Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, pp. 200-205, Mar. 1983.
[3] E. Lawler and D. Wood, "Branch and Bound Methods: A Survey," Operations Research, vol. 14, pp. 699-719, July-Aug. 1966.
[4] W.-H. Tsai and K.-S. Fu, "Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition," IEEE Trans. Systems, Man, Cybernetics., vol. 13, pp. 48-62, Jan./Feb. 1983.
[5] M.A. Eshera and K.S. Fu, "A Graph Distance Measure for Image Analysis," IEEE Trans. Systems Man, Cybernetics, vol. 14, pp. 398-407, May/June 1984.
[6] A. Rosenfeld, R. Hummel, and S. Zucker, "Scene Labeling by Relaxation Operations", IEEE Trans. Systems Man, Cybernetics., vol. 6, pp. 420-433, June 1976.
[7] L.S. Davis, "Shape Matching Using Relaxation Techniques," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, pp. 60-72, Jan. 1979.
[8] S. Peleg, "A New Probabilistic Relaxation Scheme," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 2, pp. 362-369, July 1980.
[9] R. Hummel and S. Zucker, "On the Foundations of Relaxation Labeling Processes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, pp. 267-287, May 1983.
[10] J. Ton and A.K. Jain, "Registering Landsat Images by Point Matching," IEEE Trans. Geoscience and Remote Sensing, vol. 27, no. 5, pp. 642-651, Sept. 1989.
[11] S.Z. Li, "Matching: Invariant to Translations, Rotations, and Scale Changes," Pattern Recognition, vol. 25, pp. 583-594, 1992.
[12] 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.
[13] M. Berthod, M. Kato, and J. Zerubia, "DPA: A Deterministic Approach to the MAP Problem," IEEE Trans. Image Processing, (in press), 1996.
[14] P. Kuner and B. Ueberreiter, "Pattern Recognition by Graph Matching Combinatorial Versus Continuous Optimization," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 2, pp. 527-542, 1988.
[15] E. Mjolsness, G. Gindi, and P. Anandan, "Optimization in Model Matching and Perceptual Organization," Neural Computation, vol. 1, pp. 218-229, 1989.
[16] E. Mjolsness and C. Garrett, "Algebraic Transformations of Objective Functions," Neural Networks, vol. 3, pp. 651-669, 1990.
[17] P.D. Simic, "Constrained Nets for Graph Matching and Other Quadratic Assignment Problems," Neural Computation, vol. 3, pp. 268-281, 1991.
[18] S.-S. Yu and W.-H. Tsai, "Relaxation by the Hopfield Neural Network," Pattern Recognition, vol. 25, pp. 197-208, Feb. 1992.
[19] S.S. Young, P.D. Scott, and N.M. Nasrabadi, "Object Recognition Using Multilayer Hopfield Neural Network," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 417-422, 1994.
[20] T.-W. Chen and W.-C. Lin, A Neural Network Approach to CSG-Based 3-D Object Recognition IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 7, pp. 719-726, July 1994.
[21] P. Suganthan, E. Teoh, and D. Mital, "Pattern Recognition by Graph Matching Using the Potts MFT Neural Networks," Pattern Recognition, vol. 28, pp. 997-1,009, 1995.
[22] 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.
[23] 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.
[24] M. Krcmar and A. Dhawan, "Application of Genetic Algorithms in Graph Matching," Proc. Int'l Conf. Neural Networks, vol. 6, pp. 3872-3876, 1994.
[25] 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.
[26] R. Sinkhorn, "A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices," Ann. Math. Statistics, vol. 35, pp. 876-879, 1964.
[27] J.J. Kosowsky and A.L. Yuille, "The Invisible Hand Algorithm: Solving the Assignment Problem with Statistical Physics," Neural Networks, vol. 7, pp. 477-490, 1994.
[28] A. Rangarajan, S. Gold, and E. Mjolsness, "A Novel Optimizing Network Architecture with Applications," Neural Computation, (in press), 1996.
[29] A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
[30] D. Geiger and F. Girosi,“Parallel and deterministic algorithms from MRFs: Surface reconstruction,” IEEE Transactions on PAMI, vol. 13, no. 5, pp. 401-412, May 1991.
[31] Y. G. Leclerc, "Constructing Simple Stable Descriptions for Image Partitioning," Int'l J. Computer Vision, vol. 3, pp. 73-102, 1989.
[32] C. Peterson and B. Soderberg, "A New Method for Mapping Optimization Problems Onto Neural Networks," Int'l J. Neural Systems, vol. 1, pp. 3-22, 1989.
[33] A. Rangarajan and R. Chellappa, "Generalized Graduated Non-Convexity Algorithm for Maximum A Posteriori Image Estimation," Proc. 10th ICPR,Atlantic City, N.J., USA, June 1990.
[34] A. Rosenfeld and A.C. Kak,Digital Picture Processing. Academic Press, 2nd ed., 1982
[35] 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.
[36] B. Kamgar-Parsi and B. Kamgar-Parsi, "On Problem Solving With Hopfield Networks," Biological Cybernetics, vol. 62, pp. 415-423, 1990.
[37] G.V. Wilson and G.S. Pawley, "On the Stability of the Travelling Salesman Problem Algorithm of Hopfield and Tank," Biological Cybernetics, vol. 58, pp. 63-70, 1988.
[38] S. Gold, E. Mjolsness, and A. Rangarajan, "Clustering With a Domain Specific Distance Measure," J. Cowan, G. Tesauro, and J.Alspector, eds., Advances in Neural Information Processing Systems 6, pp. 96-103.San Francisco, Calif: Morgan Kaufmann, 1994.
[39] S. Gold, C.P. Lu, A. Rangarajan, S. Pappu, and E. Mjolsness, "New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence," G. Tesauro, D. S. Touretzky, and T. K. Leen, eds., Advances in Neural Information Processing Systems 7.Cambridge, Mass.: MIT Press, 1995, pp. 957-964.
[40] S. Gold, A. Rangarajan, and E. Mjolsness, "Learning With Preknowledge: Clustering With Point and Graph Matching Distance Measures," Neural Computation, vol. 8, pp. 787-804, 1996.
[41] A.L. Yuille and J.J. Kosowsky, "Statistical Physics Algorithms that Converge," Neural Computation, vol. 6, pp. 341-356, May 1994.
[42] 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.
[43] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[44] J. Feldman, M.A. Fanty, and N.H. Goddard, "Computing with Structured Neural Networks," Computer, Vol. 21, No. 3, Mar. 1988, pp. 91-103.
[45] D. Geiger and A. Yuille, "A Common Framework for Image Segmentation," Int'l J. Computer Vision, vol. 6, pp. 227-243, 1991.
[46] J.S. Bridle, “Training Stochastic Model Recognition Algorithms as Networks Can Lead to Mutual Information Estimation of Parameters,” Advances in Neural Information Processing Systems, D.S. Touretzky, ed., vol. 2, pp. 211-217, 1990.
[47] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[48] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[49] V. Chvatal, Linear Programming.New York: W.H. Freeman and Company, 1983.
[50] M.J. Black and A. Rangarajan, “On the Unification of Line Processes, Outlier Rejection, and Robust Statistics with Applications in Early Vision,” Int'l J. Computer Vision, vol. 19, no. 1, pp. 57-91, 1996.
[51] M.A. Eshera and K.S. Fu, "An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 604-619, Sept. 1986.
[52] D. Luenberger, Linear and Nonlinear Programming.Reading, Mass.: Addison-Wesley, 1984.
[53] I. M. Elfadel and A. L. Yuille, "Mean-Field Phase Transitions and Correlation Functions for Gibbs Random Fields," J. Math. Imaging Vision, vol. 3, pp. 167,186, 1993.
[54] M.I. Jordan and R.A. Jacobs, “Hierarchical Mixtures of Experts and the EM Algorithm,” Neural Computation, vol. 6, pp. 181-214, 1994.
[55] A.L. Yuille, P. Stolorz, and J. Utans, "Statistical Physics, Mixtures of Distributions, and the EM Algorithm," Neural Computation, vol. 6, pp. 334-340, Mar. 1994.
[56] O. Faugeras and M. Berthod, "Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 412-424, July 1981.
[57] K. Price, "Relaxation Matching Techniques—A Comparison," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 617-623, Sept. 1985.
[58] The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B.Shmoys,eds. Chichester: John Wiley and Sons, 1985.

Index Terms:
Graduated assignment, continuation method, graph matching, weighted graphs, attributed relational graphs, softassign, model matching, relaxation labeling.
Citation:
Steven Gold, Anand Rangarajan, "A Graduated Assignment Algorithm for Graph Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, April 1996, doi:10.1109/34.491619
Usage of this product signifies your acceptance of the Terms of Use.