Kronecker product graph matching

Pattern Recognition

Volumn 36, Issue 9, 2003, Pages 2019-2030

  van Wyka, B J ^a   van Wykb, M A ^b  

^a Kentron Dynamics   (South Africa)

^b UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

Graph isomorphism; Graph matching; Image matching; Pattern matching

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTERPOLATION;

GRAPH MATCHING;

PATTERN MATCHING;

PATTERN RECOGNITION;

EID: 0038647816     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(03)00009-8     Document Type: Article

References (62)

1. Gold S. Rangarajan A. A graduated assignment algorithm for graph matching IEEE Trans. Pattern Anal. Mach. Intell. 18 4 1996 377-388
2. Finch A.M. Wilson R.C. Hancock E.R. Symbolic matching with the EM algorithm Pattern Recognition 31 11 1998 1777-1790
3. Messmer B.T. Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection IEEE Trans. Pattern Anal. Mach. Intell. 20 5 1998 493-503
4. Ullman J.R. An algorithm for subgraph isomorphism J. ACM 23 1976 31-42
5. Davis L.S. Shape matching using relaxation techniques IEEE Trans. Pattern Anal. Mach. Intell. 1 1 1979 60-72
6. Shapiro L.G. Haraldick R.M. Structural descriptions and inexact matching IEEE Trans. Pattern Anal. Mach. Intell. 3 5 1981 504-519
7. Tsai W.-H. Fu K.-S. Subgraph error-correcting isomorphisms for syntactic pattern recognition IEEE Trans. System Man Cybernet. 13 1 1983 48-62
8. Eshera M.A. Fu K.-S. A graph distance measure for image analysis IEEE Trans. System Man Cybernet. 14 3 1984 398-408
9. Boyer K.L. Kak A.C. Structural stereopsis for 3-D vision IEEE Trans. Pattern Anal. Mach. Intell. 10 2 1988 144-166
10. Fan T.-J. Medioni G. Nevata R. Recognizing 3-D objects using surface descriptions IEEE Trans. Pattern Anal. Mach. Intell. 11 11 1989 1140-1157
11. Horaud R. Skordas T. Stereo correspondence through feature grouping and maximal cliques IEEE Trans. Pattern Anal. Mach. Intell. 11 11 1989 1168-1180
12. Cinque L. Yashuda D. Shapiro L. Tanimoto S. Allen B. An improved algorithm for relational distance graph matching Pattern Recognition 29 2 1996 349-359
13. Depiero F. Trived M. Serbin S. Graph matching using a direct classification of node attendance Pattern Recognition 29 6 1996 1031-1048
14. Allen R. Cinque L. Tanimoto S. Shapiro L. Yasuda D. A parallel algorithm for graph matching and its MarPlas implementation IEEE Trans. Parallel Distributed Systems 8 5 1997 490-501
15. Shearer K. Bunke H. Venkatesh S. Video indexing and similarity retrieval by largest common subgraph detection using decision trees Pattern Recognition 34 2001 1075-1091
16. El-Sonbaty Y. Ismail M.A. A new algorithm for subgraph optimal isomorphism Pattern Recognition 31 2 1998 205-218
17. Fuchs F. Le-Men H. Efficient subgraph isomorphism with 'a priori' knowledge Ferri F.J. Iñesta J.M. Amin A. Pudil P. Advances in Pattern Recognition Lecture Notes in Computer Science Vol. 1876 2000 427-436 Springer-Verlag Berlin
18. Lazarescu M. Bunke H. Venkatesh S. Graph matching: fast candidate elimination using machine learning techniques Ferri F.J. Inesta J.M. Amin A. Pudil P. Advances in Pattern Recognition Lecture Notes in Computer Science Vol. 1876 2000 236-245 Springer-Verlag Berlin
19. Rosenfeld A. Hummel R.A. Zucker S.W. Scene labeling by relaxation operations IEEE Trans. Systems Man Cybernet. 6 6 1976 420-433
20. Faugeras O.D. Price K.E. Semantic description of aerial images using stochastic labeling IEEE Trans. Pattern Anal. Mach. Intell. 3 6 1981 633-642
21. Hummel R.A. Zucker S.W. On the foundations of relaxation labeling processes IEEE Trans. Pattern Anal. Mach. Intell. 5 3 1983 267-286
22. Price K.E. Relaxation labeling techniques IEEE Trans. Pattern Anal. Mach. Intell. 7 5 1985 617-623
23. Christmas W.J. Kittler J. Petrou M. Structural matching in computer vision using probabilistic relaxation IEEE Trans. Pattern Anal. Mach. Intell. 17 8 1995 749-764
24. Kittler J. Petrou W.J. Christmas M. A non-iterative probabilistic method for contextual correspondence matching Pattern Recognition 31 1998 1455-1468
25. A.M. Finch, R.C. Wilson, E.R. Hancock, Matching delauney triangulations by probabilistic relaxation, Proc. CAIP (1995) 350-358.
26. Williams M.L. Wilson R.C. Hancock E.R. Multiple graph matching with Bayesian inference Pattern Recognition Lett. 18 1997 1275-1281
27. Wilson R.C. Hancock E.R. A Bayesian compatibility model for graph matching Pattern Recognition Lett. 17 1996 263-276
28. Mjolsness E. Gindi G. Anandan P. Optimization in model matching and perceptual organization Neural Comput. 1 1989 218-229
29. Mjolsness E. Garrett C. Algebraic transformations of objective functions Neural Networks 3 1990 651-669
30. Simić P.D. Constrained nets for graph matching and other quadratic assignment problems Neural Comput. 3 1991 268-281
31. Yu S.-S. Tsai W.-H. Relaxation by the Hopfield neural network Pattern Recognition 25 2 1992 197-209
32. Chen T.-W. Lin W.-C. A neural network approach to CSG-based 3-D object recognition IEEE Trans. Pattern Anal. Mach. Intell. 16 7 1994 719-726
33. Suganthan P.N. Yan H. Teoh E.K. Mital D.P. Optimal encoding of graph homomorphism energy using fuzzy information aggregation operators Pattern Recognition 31 5 1998 623-639
34. Peng M. Gupta N. Invariant and occluded object recognition based on graph matching Int. J. Electr. Eng. Education 32 1995 31-38
35. Lee Y.-L. Park R.-H. A surface-based approach to 3-D object recognition using a mean field annealing neural network Pattern Recognition 35 2002 299-316
36. Rangarajan A. Yuille A. Mjolsness E. Convergence properties of the sofassign quadratic assignment algorithm Neural Computation 11 1999 1455-1474
37. Pelillo M. Replicator equations, maximal cliques, and graph isomorphism Neural Computation 11 1999 1933-1955
38. Almohamad H.A. Polynomial transform for matching pairs of weighted graphs Appl. Math. Modell. 15 4 1991 216-222
39. Almohamad H.A. Duffuaa S.O. A linear programming approach for the weighted graph matching problem IEEE Trans. Pattern Anal. Mach. Intell. 15 5 1993 522-525
40. Umeyama S. An eigendecomposition approach to weighted graph matching problems IEEE Trans. Pattern Anal. Mach. Intell. 10 5 1988 695-703
41. Van Wyk M.A. Clark J. An algorithm for approximate least-squares attributed graph matching Mastorakis N. Problems in Applied Mathematics and Computational Intelligence 2000 67-72 World Science and Engineering Society Press Singapore
42. B.J. Van Wyk, M.A. Van Wyk, The spherical approximation graph matching algorithm, Proceedings of the International Workshop on Multidisciplinary Design Optimisation, Pretoria, South Africa, 7-10 August, 2000, pp. 280-288.
43. Pelillo M. Refice M. Learning compatibility coefficients for relaxation labelling processes IEEE Trans. Pattern Anal. Mach. Intell. 16 9 1994 933-945
44. Van Wyk M.A. Durrani T.S. Van Wyk B.J. A RKHS interpolator-based graph matching algorithm IEEE Trans. Pattern Anal. Mach. Intell. 24 7 2002 988-995
45. M.A. Van Wyk, Private Communication, August 1999.
46. B.J. Van Wyk, M.A. Van Wyk, Non-Bayesian graph matching without explicit compatibility calculations, in: T. Caelli, A. Amin, R.P.W. Duin, M. Kamel, D. de Ridder (Eds.), Lecture Notes in Computer Science, Vol. 2396, Structural, Syntactic, and Statistical Pattern Recognition, Springer-Verlag, Berlin, 2002, pp. 74-82.
47. B.J. Van Wyk, M.A. Van Wyk, An interpolator-based network for image matching, Proceedings of IEEE AFRICON 2002, George, South Africa, 2-4 October, 2002, pp. 129-134.
48. Van Wyk M.A. Durrani T.S. A framework for multi-scale and hybrid RKHS-based approximators IEEE Trans. Signal Process. 48 12 2000 3559-3568
49. De Figueiredo J.P. A generalized fock space framework for nonlinear system and signal analysis IEEE Trans. Circuits Systems 30 9 1983 637-647
50. Zyla L.V. De Figueiredo J.P. Nonlinear System Identification Based on a Fock Space Framework SIAM J. Control Optim. 21 6 1983 931-939
51. M.A. Van Wyk, Private Communication, April 2002.
52. M.A. Van Wyk, New directions for AGM: Constraint embedding Kernel formulations, Internal Report VWR2002-1, Rand Afrikaans University, April 2002.
53. B.J. Van Wyk, Kronecker product, successive projection, and related graph matching algorithms, Ph.D. Dissertation, University of the Witwatersrand, Johannesburg, South Africa, 2002.
54. Clark J. Holton D.A. A First Look at Graph Theory 1991 World Scientific Publishing Singapore
55. Bondy J.A. Murty U.S.R. Graph Theory with Applications 1976 Macmillan London
56. Jonker R. Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing 38 1987 325-340
57. Bertsekas D.P. The auction algorithm for assignment and other network flow problems: a tutorial Interfaces 20 1990 133-149
58. Peleg S. A new probabilistic relaxation scheme IEEE Trans. Pattern Anal. Mach. Intell. 2 4 1980 362-369
59. Cross A.D.J. Hancock E.R. Graph matching with a dual step EM algorithm IEEE Trans. Pattern Anal. Mach. Intell. 20 11 1998 1236-1253
60. Lee J.-W. Kweon I.-S. Extraction of line features in a noisy image Pattern Recognition 30 10 1997 1651-1660
61. Burns J.B. Hanson A.R. Riseman E.M. Extracting straight lines IEEE Trans. Pattern Anal. Mach. Intell. 8 4 1986 425-455
62. Li S.Z. Matching: Invariant to translations rotations and scale changes Pattern Recognition 25 6 1992 583-594