Symbolic graph matching with the EM algorithm

Pattern Recognition

Volumn 31, Issue 11, 1998, Pages 1777-1790

  Finch, Andrew M ^a,b   Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

^b ADVANCED TELECOMMUNICATIONS RESEARCH INSTITUTE INTERNATIONAL   (Japan)

Author keywords

Aerial image analysis; EM algorithm; Graduated assignment; Graph matching

Indexed keywords

ERRORS; GRAPH THEORY; IMAGE ANALYSIS; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

AERIAL IMAGE ANALYSIS; SYMBOLIC GRAPH MATCHING;

ALGORITHMS;

EID: 0032210116     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(98)00010-7     Document Type: Article

References (43)

1. 1. H. G. Barrow and R. J. Popplestone, Relational descriptions in picture processing. Machine Intelligence 6 (1971).
2. 2. A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs. IEEE SMC 13, 353-362 (1983).
3. 3. L. Shapiro and R. M. Haralick, A metric for comparing relational descriptions. IEEE PAMI 7, 90-94 (1985).
4. 4. L. Shapiro and R. M. Haralick, Structural description and inexact matching, IEEE PAMI 3, 504-519 (1981).
5. 5. P. N. Suganathan, E. K. Teoh and D. P. Mital, Pattern recognition by graph matching using Potts MFT networks, Pattern Recognition 28, 997-1009 (1995).
6. 6. S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE PAMI 18, 377-388 (1996).
7. 7. A. D. J. Cross, R. C. Wilson and E. R. Hancock, Inexact graph matching with genetic search, Pattern Recognition 30, 953-970 (1997).
8. 8. A. D. J. Cross and E. R. Hancock, Relational matching with stochastic optimisation, IEEE Computer Society Int. Symp. on Computer Vision, pp. 365-370 (1995).
9. 9. R. C. Wilson and E. R. Hancock, Relational matching with dynamic graph structures. Proc. 5th Int. Conf. on Computer Vision, pp. 450-456 (1995).
10. 10. R. C. Wilson and E. R. Hancock, Structural matching by discrete relaxation, IEEE PAMI 19, 634-648 (1997).
11. 11. A. K. C. Wong and M. You, Entropy and distance of random graphs with application to structural pattern recognition, IEEE PAMI 7, 509-609 (1985).
12. 12. R. Horaud and T. Skordas, Stereo Correspondence through Feature Grouping and Maximal Cliques, IEEE PAMI 11, 1168-1180 (1989).
13. 13. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, New York, (1989).
14. 14. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, Optimisation by simulated annealing, Science 220, 671-680 (1983).
15. 15. G. R. Smith and A. D. Bruce, A study of the multi-canonical Monte-Carlo method, J. Phys. A-Math. and General, 28, 6623-6643 (1995).
16. 16. M. Locatelli and F. Schoen, Simple linkage - Analysis of a threshold-accepting global optimization method, J. Global Optim. 9, 95-111 (1996).
17. 17. X. F. Qi and F. Palmieri, Theoretical analysis of evolutionary algorithms with an infinite population in continu ous space: basic properties of selection and mutation, IEEE Trans. Neural Networks 5, 102-119 (1994).
18. 18. X. F. Qi and F. Palmieri, Theoretical analysis of evolutionary algorithms with an infinite population in continuous space: analysis of the diversification role of crossover, IEEE Trans. Neural Networks 5, 120-129 (1994).
19. 19. A. Blake and A. Zisserman, Visual Reconstruction, MIT Press, Cambridge, Massachussets (1987).
20. 20. S. Gold, A. Rangarajan and E. Mjolsness, Learning with pre-knowledge: clustering with point and graph-matching distance measures, Neural Comput. 8, 787-804 (1996).
21. 21. A. L. Yuille, P. Stolorz and J. Utans, Statistical physics, mixtures of distributions, and the EM algorithm, Neural Comput. 6, 334-340 (1994).
22. 22. L. Herault, R. Horaud, F. Veillon and J.-J. Niez, Symbolic image matching by simulated annealing, Proc. 1st British Machine Vision Conf. pp. 319-324 (1990).
23. 23. P. Simic, Constrained nets for graph matching and other quadratic assignment problems, Neural Comput. 3, 268-281 (1991).
24. 24. C. Peterson and B. Soderberg, A New Method for Mapping Optimisation Problems, Int. J. Neural Systems 1, 2-33 (1989).
25. 25. A. M. Finch, R. C. Wilson and E. R. Hancock, Relational matching with Mean-Field annealing. Proc. 13th Int. Conf. on Pattern Recognition, Vol. II, pp. 359-363 (1996).
26. 26. A. M. Finch, R. C. Wilson and E. R. Hancock, Softening Discrete Relaxation, Neural Information Processing Systems 9, M. Mozer, M. Jordan and M. Petsche (eds.) pp. 438-444, MIT Press, Cambridge (1997).
27. 27. R. C. Wilson, A. N. Evans and E. R. Hancock, Relational matching by discrete relaxation, Image Vision Comput. 13, 411-422 (1995).
28. 28. L. K. Saul and M. I. Jordan, Exploiting tractable substructures in intractable networks, Adv. Neural Inform. Process. 8, 486-492 (1996).
29. 29. S. Becker and G. E. Hinton Learning mixture models of spatial coherence, Neural Comput. 5, 267-277 (1992).
30. 30. P. Dayan, G. E. Hinton, R. M. Neal and R. S. Zemel, The Helmholtz machine, Neural Comput. 7, 889-904 (1995).
31. 31. A. P. Dempster, N. M. Laird and D. B. Rubin, Maximum-likelihood from incomplete data via the EM algorithm", J. Roy. Statist. Soc. Ser. B (methodological) 39, 1-38 (1977).
32. 32. R. C. Wilson and E. R. Hancock, Gauging relational consistency and correcting structural errors, IEEE Comput. Vision and Pattern Recognition Conference pp. 47-54 (1996).
33. 33. J. A. F. Leite and E. R. Hancock, Iterative curve organisation with the EM algorithm, Pattern Recognition Lett. 18, 143-155 (1997).
34. 34. J. Maclean and A. Jepson, Recovery of Ego-motion and segmentation of independent object motion using the EM Algorithm, Proc. BMVC, pp. 175-184 (1994).
35. 35. E. H. Adelson and Y. Weiss, A unified mixture framework for motion segmentation: Incorporating spatial coherence and estimating the number of models, Proc. IEEE Computer Vision and Pattern Recognition Conf. pp. 321-326 (1996).
36. 36. B. Moghaddam and A. Pentland, Probabilistic visual Learning for Object Detection", Proc of the 5th Int. Conf. on Computer Vision, pp. 786-793 (1995).
37. 37. J. Utans, Mixture models and the EM algorithms for object recognition within compositional hierarchies, ICSI Berkeley Technical Report TR-93-004 (1993).
38. 38. P. Viola and W. Wells, Alignment by maximisation of mutual information, Proc. 5th Int. Conf. on Computer Vision, pp. 16-23 (1995).
39. 39. W. M. Wells, MAP model matching, IEEE Computer Society Computer Vision and Pattern Recognition Conf., pp. 486-492 (1991).
40. 40. J. Hornegger and H. Niemann, Statistical learning localisation and identification of objects, Proc. 5th Int. Conf. on Computer Vision, pp. 914-919 (1995).
41. 41. S. Moss and E. R. Hancock, Registering incomplete radar images with the EM algorithm, Image and Vision Comput. 15, 637-648 (1997).
42. 42. E. R. Hancock and J. Kittler, Edge labelling using dietory based relaxation, IEEE PAMI, 12, 165-181 (1990).
43. 43. R. C. Wilson and E. R. Hancock, A Bayesian compatibility model for graph matching, Pattern Recognition Lett. 17, 263-276 (1996).