Inexact graph matching using genetic search

Pattern Recognition

Volumn 30, Issue 6, 1997, Pages 953-970

  Cross, Andrew D J ^a   Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Aerial stereograms; Discrete relaxation; Genetic search; Graph matching

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GENETIC ALGORITHMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; RANDOM PROCESSES; SENSITIVITY ANALYSIS;

AERIAL STEREOGRAMS; GRAPH MATCHING METHODS;

PATTERN RECOGNITION;

EID: 0031170384     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(96)00123-9     Document Type: Article

References (40)

1. O. D. Faugeras and M. Berthod, Improving consistency and resolving ambiguity in relaxation labelling, IEEE PAMI 3, 412-424 (1981).
2. D. B. Fogel, An introduction to simulated evolutionary optimisation, IEEE Trans. Neural Networks 5, 3-14 (1994).
3. S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions and Bayesian restoration of images, IEEE PAMI 6, 721-741 (1984).
4. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, Optimisation by simulated annealing, Science 220, 671-680 (1983).
5. C. Peterson and B. Soderberg, A new method for mapping optimisation problems, Int. J. Neural Systems 1, 2-33 (1989).
6. X. F. Qi and F. Palmieri. Theoretical analysis of evolutionary algorithms with an infinite population in continuous space: basic properties of selection and mutation, IEEE Trans. Neural Networks 5, 102-119 (1994).
7. 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).
8. A. Yuille, Generalised deformable models, statistical physics and matching problems, Neural Comput. 2, 1-24 (1990).
9. H. G. Barrow and R. J. Popplestone, Relational descriptions in picture processing, Mach, Intell. 6, 377-396 (1971).
10. L. G. Shapiro and R. M. Haralick, A metric for comparing relational descriptions, IEEE PAMI 7, 90-94 (1985).
11. A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE SMC 13, 353-362 (1983).
12. R. C. Wilson and E. R. Hancock, Graph matching by discrete relaxation, in Pattern Recognition in Practice IV, E. Gelsema and L. Kanal, eds, pp. 165-176 (1994).
13. R. C. Wilson, A. N. Evans and E. R. Hancock, Relational matching by discrete relaxation, Image Vision Comput. 13, 411-421 (1995).
14. B. Gidas, A re-normalisation-group approach to image processing problems, IEEE PAMI 11, 164-180 (1989).
15. L. Herault, R. Horaud, F. Veillon and J-J. Niez, Symbolic image matching by simulated annealing, Proc BMVC90, 319-324 (1990).
16. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines. Wiley, New York (1989).
17. D. Goldberg, Genetic Algorithms in Search, Optimisation and Learning. Addison-Wesley, Reading, Massachusetts (1989).
18. J. R. Beveridge and E. M. Riseman, Optimal geometric model matching under full 3D perspective, Comput. Vision Image Understanding 61, 351-364 (1995).
19. J. R. Beveridge, E. R. Riseman and C. R. Graves, Demonstrating polynomial run-time growth for local search, Proc. IEEE Comput. Soc. Int. Symp. on Computer Vision, Coral Gables, Florida, 533-538 (1995).
20. A. K. C. Wong and M. You, Entropy and distance of random graphs with application to structural pattern recognition, IEEE PAMI 7, 599-609 (1985).
21. D. Waltz, Understanding line drawings of scenes with shadows, in The Psychology of Computer Vision, P.H. Winton, ed. McGraw-Hill, New York (1975).
22. L. Davis, Bit-climbing, representational bias and test suite design, Proc. 4th Int. Conf. on Genetic Algorithms, 18-23 (1991).
23. L. Eshelman, The CHC adaptive search algorithm: how to have safe search when engaging in non-traditional genetic recombination, Found. Genetic Algorithms 1, 265-283 (1991).
24. S. J. Louis and G. J. E. Rawlins, Syntactic analysis of convergence in genetic algorithms, Found. Genetic Algorithms 2, 141-151 (1993).
25. E. S. Gelsema, Abductive reasoning in Bayesian belief networks using a genetic algorithm, Pattern Recognition Lett. 16, 865-871 (1995).
26. M. Pelillo, F. Abbattista and A. Maffione, An evolutionary approach to training relaxation labelling processes, Pattern Recognition Lett. 16, 1069-1078 (1995).
27. E. R. Hancock and J. Kittler, Discrete relaxation, Pattern Recognition 23, 711-733 (1990).
28. J. Besag, On the statistical analysis of dirty pictures, Proc. Roy. Statist. Soc. Ser. B 48, 259-302 (1986).
29. D. Whitley, J. R. Beveridge, C. Graves and K. Mathias, Test driving three 1995 genetic algorithms: new test functions and geometric matching, Heuristics 1, 77-104 (1995).
30. E. R. Hancock and J. Kittler, A Bayesian interpretation for the Hopfield network, IEEE Int. Conf. Neural Networks 1, 341-346 (1993).
31. W. Cedeno, V. R. Vemuri and T. Slezak, Multi-niche crowding in genetic algorithms and its application to the assembly of DNA restriction fragments, Evolutionary Comput. 2, 321-345 (1995).
32. R. C. Wilson and E. R. Hancock, Gauging consistency and controlling structural errors, Proc. IEEE Comput. Soc. Comput. Vision and Pattern Recognition Conf., 47-54 (1996).
33. R. C. Wilson and E. R. Hancock, Relational matching with dynamic graph structures, Proc. 5th Int. Conf. on Computer Vision, 450-456 (1995).
34. A. D. J. Cross and E. R. Hancock, Relational matching with stochastic optimisation, IEEE Int. Symp. on Computer Vision, 365-370 (1995).
35. W. E. L. Crimson, The combinatorics of object recognition in cluttered environments using constrained search, Artificial Intell. 44, 121-165 (1990).
36. B. T. Messmer and H. Bunke, Efficient error-tolerant subgraph isomorphism detection, in Shape, Structure and Pattern Recognition, D. Dori and A. Bruckstein, eds, pp. 231-240 (1995).
37. A. D. J. Cross and E. R. Hancock, Inexact matching with genetic search, Advances in Structural and Syntactical Pattern Recognition, P. Perner, P. Wang and A. Rosenfeld, eds, Lecture Notes in Computer Science, Vol. 1121, pp. 150-159. Springer, Berlin (1996).
38. A. D. J. Cross, R. C. Wilson and E. R. Hancock, Genetic search for structural matching, Proc. ECCV96, B. Buxton and R. Cipolla, eds, Lecture Notes in Computer Science, Vol. 1064, 514-525. Springer, Berlin (1996).
39. A.M. Finch, R.C. Wilson and E.R. Hancock, , Matching Delaunay graphs, Pattern Recognition 30, 123-146 (1997).
40. R. C. Wilson and E. R. Hancock, A Bayesian compatibility model for graph matching, Pattern Recognition Lett. 17, 263-276 (1996).