An expectation-maximisation approach to graph matching

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

Volumn 1223, Issue , 1997, Pages 425-439

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER VISION; HAMMING DISTANCE; ITERATIVE METHODS; PATTERN MATCHING; PATTERN RECOGNITION;

EXPECTATION-MAXIMISATION; EXPONENTIAL DISTRIBUTIONS; ITERATIVE PROCESS; KULLBACK LEIBLER DIVERGENCE; MATCHING METHODS; MEAN FIELD ANNEALING; NOISE SENSITIVITY; QUADRATIC ASSIGNMENT;

PROBABILITY DISTRIBUTIONS;

EID: 33749951965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62909-2_95     Document Type: Conference Paper

References (40)

1. Aarts E. and Korst J., “Simulated Annealing and Boltzmann Machines”, John Wiley and Sons, New York, 1989.
2. Adelson E.H. and Weiss Y., “A Unified Mixture Framework for Motion Segmentation: Incorporating SpatiM Coherence and Estimating the Number of Models” Proceedings IEEE CVPR Conference, pp. 321-326, 1996.
3. Barrow H.G. and R.J. Popplestone, “Relational Descriptions in Picture Processing”, Machine Intelligence, 6, 1971.
4. Becket S. and Hinton G.E, “Learning Mixture Models of Spatial Coherence”, Neural Computation, 5, pp 267-277, 1992.
5. Blake A. and Zisserman A., “Visual Reconstruction”, MIT Press, 1987.
6. Bridle J.S. “Training stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters” NIPS2, pp. 211-217, 1990.
7. Cross A.D.J., R.C. Wilson and E.R. Hancock, “Discrete Relaxation on a Boltzmann Machine”, Proceedings ICANN 95, pp. 491-496,1995.
8. Cross A.D.J., R.C. Wilson and E.R. Hancock, “Genetic Search for structural matching”, Proceedings ECCV96, Lecture Notes in Computer Science 1064, pp. 514-525, 1996.
9. Cross A.D.J. and E.R. Hancock, “Relational Matching with stochastic optimisation” IEEE Computer Society International Symposium on Computer Vision, pp. 365-370, 1995.
10. Dayan P., Hinton G.E., Neal R.M., Zemel R.S., “The Helmholtz Machine”, Neural Computation, 7, pp. 889-904, 1995.
11. Derapster A.P., Rubin N.M. and Rubin D.B., “Maximum-likelihood from incomplete data via the EM algorithm”, J. Royal Statistical Soc. Ser. B (methodological), 39, pp 1-38, 1977.
12. Durbin R. and Willshaw D., “An analogue approach to the travelling salesman problem”, Nature, 326, pp. 689-691, 1987.
13. Durbin R., Szeliski R. and Yuille A.L., “An analysis of the elastic net approach to the travelling salesman problem”, Neural Computation, 1,348-358, 1989.
14. Finch A.M., Wilson R.C. and Hancock E.R., “Relational Matching with Mean-Field Annealing”, Proceedings of the 13th International Confererence on Pattern Recognition, Volume II, pp. 359-363, 1996.
15. Finch A.M., Wilson R.C. and Hancock E.R., “Softening Discrete Relaxation” to appear in Advances in Neural Information Processing Systems 9, MIT Press 1997.
16. Geman S. and D. Geman, “Stochastic relaxation, Gibbs distributions and Bayesian restoration of images,” IEEE PAMI, PAMI-6, pp.721-741, 1984.
17. Gold S., A. Rangarajan and E. Mjolsness, “Learning with pre-knowledge: Clustering with point and graph-matching distance measures”, Neural Computation, 8, pp. 787-804, 1996.
18. Gold S. and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching”, IEEE PAMI, 18, pp. 377-388, 1996.
19. Hancock, E.R. and J. Kittler, “Discrete Relaxation,” Pattern Recognition, 23, pp.711-733, 1990.
20. Hornegger J. and H. Niemann, “Statistical Learning Localisation and Identification of Objects” Proceedings Fifth International Conference on Computer Vision, pp. 914-919, 1995.
21. Jordan M.I. and Jacobs R.A, “Hierarchical Mixtures of Experts and the EM Algorithm”, Neural Computation, 6, pp. 181-214, 1994.
22. Kirkpatrick S., C.D. Gelatt and M.P. Vecchi, “Optimisation by Simulated Annealing”, Science, 220, pp. 671-680, 1983.
23. Maclean J. and Jepson A, “Recovery of Ego-motion and Segmentation of Independent Object Motion using the EM Algorithm”, Proceedings BMVC, pp. 175-184, 1994.
24. Meet P., Mintz D., Rosenfeld A. and Kim D.Y., “Robust Regression Methods for Computer Vision-A Review”, International Journal of Computer vision, 6, pp. 59-70, 1991.
25. Mjolsness E., G. Gindi and P. Anandan, “Optimisation in model matching and perceptual organisation”, Neural Computation, 1, pp. 218-219, 1989.
26. Moghaddam B. and Pentland A., “Probabilistic Visual Learning for Object Detection”, Proceedings of the Fifth International Conference on Computer Vision, pp. 786-793, 1995.
27. Novovicova J., Pudil P. and Kittler J., “Divergence Based Feature Selection for Multi-modal Class Densities”, IEEE PAMI, 18, pp. 218-223, 1996.
28. Peterson C. and Soderberg B., “A New Method for Mapping Optimisation Problems”, International Journal of Neural Systems, 1, pp 2-33, 1989.
29. Sanfeliu A. and Fu K.S., “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition”, IEEE SMC 13, pp 353-362, 1983.
30. Shapiro L. and R.M. Haralick, “Structural Description and Inexact Matching”, IEEE PAMI, 3, pp 504-519, 1981.
31. Shapiro L. and R.M. Haralick, “A Metric for Comparing Relational Descriptions”, IEEE PAMI, 7, pp 90-94, 1985.
32. Simic P., “Constrained nets for graph matching and other quadratic assignment problems”, Neural Computation, 3, pp. 268-281, 1991.
33. Suganathan P.N., E.K. Teoh and D.P. Mital, “Pattern Recognition by Graph Matching using Potts MFT Networks”, Pattern Recognition, 28, pp. 997-1009, 1995.
34. Utans J., “Mixture Models and the EM Algorithms for Object Recognition within Compositional Hierarchies”, ICSI Berkeley Technical Report, TR-93-004, 1993.
35. P. Viola and W. Wells, “Alignment by Maximisation of Mutual Information”, Proceedings of the Fifth International Conference on computer Vision, pp. 16-23, 1995.
36. Wells W.M., “MAP Model Matching”, IEEE Computer Society Computer Vision and Pattern Recognition Conference, pp. 486-492, 1991.
37. Wilson R.C., Evans A.N. and Hancock E.R., “Relational Matching by Discrete Relaxation”, Image and Vision Computing, 13, pp. 411-421, 1995.
38. Wilson R.C and Hancock E.R., “Relational Matching with Dynamic Graph Structures”, Proceedings of the Fifth International Conference on Computer Vision, pp. 450-456, 1995.
39. Yuille A.L., Stolorz P. and Utans J., “Statistical Physics, Mixtures of Distributions, and the EM Algorithm” Neural Computation, 6, pp. 334-340, 1994.
40. Yuille A., “Generalised Deformable Models, Statistical Physics and Matching Problems”, Neural Computation, 2, pp. 1-24, 1990.