Abstract
This paper describes a novel framework for performing relational graph matching using genetic search. The fitness measure is the recently reported global consistency measure of Wilson and Hancock. The basic measure of relational distance underpinning the technique is Hamming distance. Our standpoint is that genetic search provides a more attractive means of performing stochastic discrete optimisation on the global consistency measure than alternatives such as simulated annealing. Moreover, the action of the optimisation process is easily understood in terms of its action in the Hamming distance domain. We provide some experimental evaluation of the method in the matching of aerial stereograms.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aarts E. and Korst J., “Simulated Annealing and Boltzmann Machines”, John Wiley and Sons, New York, 1989.
Barrow H.G. and Poplestone R.J., “Relational Descriptions in Picture Processing”, Machine Intelligence, 6, 1971.
Cross A.D.J. and Hancock E.R., “Relational Matching with Stochastic Optimisation” IEEE International Symposium on Computer Vision, pp. 31–36, 1995.
Faugeras O.D. and Berthod M., “Improving Consistency and Resolving Ambiguity in Relaxation Labelling”, IEEE PAMI, 3, pp. 412–424, 1981.
Fogel D.B., “An Introduction to Simulated Evolutionary Optimisation”, IEEE Transactions on Neural Networks, 5, pp. 3–14, 1994.
Geman S. and Geman D., “Stochastic relaxation, Gibbs distributions and Bayesian restoration of images,” IEEE PAMI, PAMI-6, pp.721–741, 1984.
Gidas B., “A Re-normalisation-Group Approach to Image Processing Problems”, IEEE PAMI, 11, pp. 164–180, 1989.
Hancock, E.R. and Kittler J., “Discrete Relaxation,” Pattern Recognition, 23, pp.711–733, 1990.
Hancock, E.R. and Kittler J., “A Bayesian Interpretation for the Hop field Network,” IEEE International Conference on Neural Networks, pp. 341–346, 1993.
Kirkpatrick S., Gelatt C.D. and Vecchi M.P., “Optimisation by Simulated Annealing”, Science, 220, pp. 671–680, 1983.
Qi, X.F. and Palmieri F., “Theoretical Analysis of Evolutionary Algorithms with an Infinite Population in Continuous Space: Basic Properties of Selection and Mutation” IEEE Transactions on Neural Networks, 5, pp. 102–119, 1994.
Qi, X.F. and Palmieri F., “Theoretical Analysis of Evolutionary Algorithms with an Infinite Population in Continuous Space: Analysis of the Diversification Role of Crossover” IEEE Transactions on Neural Networks, 5, pp. 120–129, 1994.
Shapiro L.G. and Haralick R.M., “A Metric For Comparing Relational Descriptions”, IEEE PAMI, 7, pp 90–94, 1985.
Sanfeliu A. and Fu K.S., “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition”, IEEE SMC, 13, pp 353–362, 1983.
Wilson R.C and Hancock E.R, “Graph Matching by Discrete Relaxation”, Pattern Recognition in Practice IV, edited by E Gelsema and L Kanal, pp 165–176, 1994.
Wilson R.C., Evans A.N. and Hancock E.R., “Relational Matching by Discrete Relaxation”, Image and Vision Computing, 13, pp. 411–421, 1995.
Wilson R.C. and Hancock E.R., “Relational Matching with Active Graph Structures”, Proceedings of the Fifth International Conference on Computer Vision, pp. 450–456, 1995.
Wong A.K.C. and You M., “Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition”, IEEE PAMI, 7, pp 599–609, 1985.
Yuille A., “Generalised Deformable Models, Statistical Physics and Matching Problems”, Neural Computation, 2, pp. 1–24, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cross, A.D.J., Wilson, R.C., Hancock, E.R. (1996). Genetic search for structural matching. In: Buxton, B., Cipolla, R. (eds) Computer Vision — ECCV '96. ECCV 1996. Lecture Notes in Computer Science, vol 1064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015562
Download citation
DOI: https://doi.org/10.1007/BFb0015562
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61122-6
Online ISBN: 978-3-540-49949-7
eBook Packages: Springer Book Archive