Deterministic search for relational graph matching

Pattern Recognition

Volumn 32, Issue 7, 1999, Pages 1255-1271

  Williams, Mark L ^a   Wilson, Richard C ^b   Hancock, Edwin R ^b  

^a DEFENCE SCIENCE AND TECHNOLOGY LABORATORY   (United Kingdom)

^b UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Consistent labelling; Discrete relaxation; Graph matching; Heuristic search; Natural gradient; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PATTERN MATCHING;

CONSISTENT LABELLING; DISCRETE RELAXATION; GRAPH MATCHING; HEURISTIC SEARCH; NATURAL GRADIENT; TABU SEARCH;

PATTERN RECOGNITION;

METHODOLOGY; PATTERN RECOGNITION;

EID: 0033167360     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(98)00152-6     Document Type: Article

References (33)

1. [1] R.M. Haralick, J. Kartus, Arrangements, homomorphisms and discrete relaxation, IEEE SMC 8 (1978) 600-612.
2. [2] R.M. Haralick, G. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intell. 14 (1980) 263-313.
3. [3] J.R. Ullman, Associating parts of patterns, Inform. and Control 9 (1966) 583-601.
4. [4] J.R. Ullman, An algorithm for subgraph isomorphism, J. ACM 23 (1976) 31-42.
5. [5] H.G. Barrow, R.M. Burstall, Subgraph isomorphism, matching relational structures and maximal cliques, Inform. Process. Lett. 4 (1976) 83-84.
6. [6] E. Rolland, H. Pirkul, F. Glover, Tabu search for graph partitioning, Ann. Oper. Res. 63 (1996) 290-232.
7. [7] A. Sanfeliu, K.S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE SMC 13 (1983) 353-362.
8. [8] L.G. Shapiro, R.M. Haralick, Structural description and inexact matching, IEEE PAMI 3 (1981) 504-519.
9. [9] L.G. Shapiro, R.M. Haralick, A metric for comparing relational descriptions, IEEE PAMI 7 (1985) 90-94.
10. [10] S. Gold, A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE PAMI 18 (1966) 377-388.
11. [11] S. Gold, A. Rangarajan, E. Mjolsness, Learning with pre-knowledge: clustering with point and graph-matching distance measures, Neural Comput. 8 (1996) 787-804.
12. [12] E. Mjolsness, G. Gindi, P. Anandan, Optimisation in model matching and perceptual organisation, Neural Comput. 1 (1989) 218-219.
13. [13] P.N. Suganathan, E.K. Teoh, D.P. Mital, Pattern recognition by graph matching using Potts MFT networks, Pattern Recognition 28 (1995) 997-1009.
14. [14] J.J. Kosowsky, A.L. Yuille, The invisible hand algorithm: solving the assignment problem with statistical physics, Neural Networks 7 (1994) 477-490.
15. [15] A. Yuille, Generalised deformable models, statistical physics and matching problems, Neural Comput. 2 (1990) 1-24.
16. [16] A.D.J. Cross, R.C. Wilson, E.R. Hancock, Inexact Graph Matching using Genetic Search", Pattern Recognition, 30 (1997) 953-970.
17. [17] B.T. Messmer, H. Bunke, Efficient error-tolerant subgraph isomorphism detection, in: (D. Dori, A. Bruckstein (Eds.), Shape, Structure and Pattern Recognition, World Scientific Press, Singapore, 1995, pp. 231-240.
18. [18] N.J. Nilsson, Problem solving Methods in Artificial Intelligence, McGraw-Hill, New York, 1971.
19. [19] D. Geman, S. Geman, Stochastic relaxation, Gibbs distributions and Bayesian restoration of images, IEEE PAMI 6 (1984) 721 -741.
20. [20] A.L. Yuille, J.J. Kosowsky, Statistical physics algorithms that converge, Nueral Comput. 6 (1994) 341-356.
21. [21] F. Glover, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Appl. Math. 65 (1996) 223-253.
22. [22] F. Glover, Genetic algorithms and tabu search - hybrids for optimisation, Discrtete Appl. Math. 49 (1995) 111-134.
23. [23] F. Glover, Tabu search for nonlinear and parametric optimisation (with links to genetic algorithms), Discrete Appl. Math. 49 (1995) 231-255.
24. [24] R.C. Wilson, E.R. Hancock, Structural matching by discrete relaxation, IEEE PAMI 19 (1997) 634-648.
25. [25] R.C. Wilson, A.D.J. Cross, E.R. Hancock, Structural matching with active triangulations, Comput. Vision Image Understanding 72 (1988) 20-28.
26. [26] R.C. Wilson, E.R. Hancock, Structural Matching by discrete relaxation, IEEE PAMI 19 (1997) 834-648.
27. [27] A.D.J. Cross, E.R. Hancock, Relational matching with stochastic optimisation, IEEE Int. Symp. on Computer Vision, 1995, pp. 365-370.
28. [28] A.M. Finch, R.C. Wilson, E. R. Hancock, Relational matching with mean-field annealing, Proc. 13th Int. Conf. on Pattern Recognition, vol. II, 1996, pp. 359-363.
29. [29] A.M. Finch, R.C. Wilson, E.R. Hancock, Softening discrete relaxation, Advances in Neural Information Processing Systems 9, MIT Press, Cambridge, MA, 1997, pp. 438-444.
30. [30] A.M. Finch, R.C. Wilson, E.R. Hancock, An energy function and continuous edit process for Graph-Matching, Neural Comput. 10 (1998) 1873-1894.
31. [31] K. Boyer, A. Kak, Structural setereopsis for 3D vision, IEEE PAMI 10 (1988) 144-166.
32. [32] P.J. Flynn, A.K. Jain, CAD-based vision - from CAD models to relational graphs, IEEE PAMI 13 (1991) 114-132.
33. [33] J. Kittler, W.J. Christmas, M. Petrou, Probabilistic relaxation for matching problems in machine vision, Proc. 4th Int. Conf. on Computer Vision, 1993, pp. 666-674.