Genetic search for structural matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1064, Issue , 1996, Pages 514-525

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNAS; COMPUTER VISION; GENETIC ALGORITHMS; IMAGE MATCHING; SIMULATED ANNEALING; STOCHASTIC SYSTEMS;

DISCRETE OPTIMISATION; EXPERIMENTAL EVALUATION; FITNESS MEASURES; GENETIC SEARCH; GLOBAL CONSISTENCY; OPTIMISATIONS; RELATIONAL GRAPH; STRUCTURAL MATCHING;

HAMMING DISTANCE;

EID: 84957544769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015562     Document Type: Conference Paper

References (19)

1. Aarts E. and Korst J., “Simulated Annealing and Boltzmann Machines”, John Wiley and Sons, New York, 1989.
2. Barrow H.G. and Poplestone R.J., “Relational Descriptions in Picture Processing”, Machine Intelligence, 6, 1971.
3. Cross A.D.J. and Hancock E.R., “Relational Matching with Stochastic Optimisation” IEEE International Symposium on Computer Vision, pp. 31-36, 1995.
4. Faugeras O.D. and Berthod M., “Improving Consistency and Resolving Ambiguity in Relaxation Labelling”, IEEE PAMI, 3, pp. 412-424, 1981.
5. Fogel D.B., “An Introduction to Simulated Evolutionary Optimisation”, IEEE Transactions on Neural Networks, 5, pp. 3-14, 1994.
6. Geman S. and Geman D., “Stochastic relaxation, Gibbs distributions and Bayesian restoration of images,” IEEE PAMI, PAMI-6, pp.721-741, 1984.
7. Gidas B., “A Re-normalisation-Group Approach to Image Processing Problems”, IEEE PAMI, 11, pp. 164-180, 1989.
8. Hancock, E.R. and Kittler J., “Discrete Relaxation,” Pattern Recognition, 23, pp.711-733, 1990.
9. Hancock, E.R. and Kittler J., “A Bayesian Interpretation for the Hop field Network,” IEEE International Conference on Neural Networks, pp. 341-346, 1993.
10. Kirkpatrick S., Gelatt C.D. and Vecchi M.P., “Optimisation by Simulated Annealing”, Science, 220, pp. 671-680, 1983.
11. 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.
12. 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.
13. Shapiro L.G. and Haralick R.M., “A Metric For Comparing Relational Descriptions”, IEEE PAMI, 7, pp 90-94, 1985.
14. Sanfeliu A. and Fu K.S., “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition”, IEEE SMC, 13, pp 353-362, 1983.
15. 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.
16. Wilson R.C., Evans A.N. and Hancock E.R., “Relational Matching by Discrete Relaxation”, Image and Vision Computing, 13, pp. 411-421, 1995.
17. 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.
18. 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.
19. Yuille A., “Generalised Deformable Models, Statistical Physics and Matching Problems”, Neural Computation, 2, pp. 1-24, 1990.