An Energy Function and Continuous Edit Process for Graph Matching

Neural Computation

Volumn 10, Issue 7, 1998, Pages 1873-1894

  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

EID: 0001660039     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976698300017188     Document Type: Article

References (35)

1. Aarts, E., & Korst, J. (1989). Simulated annealing and Boltzmann machines. New York: Wiley.
2. Barrow, H. G., & Popplestone, R. J. (1971). Relational descriptions in picture processing. Machine Intelligence, 6.
3. Blake, A., & Zisserman, A. (1987). Visual reconstruction. Cambridge, MA: MIT Press.
4. Boyer, K., & Kak, A. (1988). Structural stereopsis for three-dimensional vision. IEEE Pattern Analysis and Machine Intelligence, 10, 144-166.
5. Bridle, J. S. (1990). Training stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters. In D. S. Touretzky (Ed.), Advances in neural information processing systems (pp. 211-217). San Mateo, CA: Morgan Kauffman.
6. Cross, A. D. J., & Hancock, E. R. (1995). Relational matching with stochastic optimisation. IEEE Computer Society International Symposium on Computer Vision (pp. 365-370).
7. Cross, A. D. J., & Hancock, E. R. (1997). Inexact graph matching using genetic search. Pattern Recognition, 30, 953-970.
8. Dayan, P., Hinton, G. E., Neal, R. M., & Zemel, R. S. (1995). The Hemholtz machine. Neural Computation, 7, 889-904.
9. Finch, A. M., Wilson, R. C., & Hancock, E. R. (1997). Matching Delaunay graphs. Pattern Recognition, 30, 123-140.
10. Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions and Bayesian restoration of images. IEEE Pattern Analysis and Machine Intelligence, 6, 721-741.
11. Gold, S., & Rangarajan, A. (1996). A graduated assignment algorithm for graph matching. IEEE Pattern Analysis and Machine Intelligence, 18, 377-388.
12. Gold, S., Rangarajan, A., & Mjolsness, E. (1996). Learning with pre-knowledge: Clustering with point and graph-matching distance measures. Neural Computation, 8, 787-804.
13. Hancock, E. R., & Kittler, J. (1993). Discrete relaxation. Pattern Recognition, 23, 711-733.
14. Hoffmann, T., & Buhmann, J. M. (1997). Pairwise data clustering with deterministic annealing. IEEE PAMI, 19, 1-14.
15. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimisation by simulated annealing. Science, 220, 671-680.
16. Meila, M., & Jordan, M. (1997). Optimal triangulation with continuous cost functions. In M. C. Mozer, M. Jordan, & M. Petsche (Eds.), Advances in neural information processing systems, 9 (pp. 557-563). Cambridge, MA: MIT Press.
17. Mjolsness, E., Gindi, G., & Anandan, P. (1989). Optimisation in model matching and perceptual organisation. Neural Computation, 1, 218-229.
18. Peterson, C., & Soderberg, B. (1989). A new method for mapping optimisation problems. International Journal of Neural Systems, 1, 2-33.
19. Rangarajan, A., Gold, S., & Mjolsness, E. (1996). A novel optimizing network architecture with applications. Neural Computation, 8, 1041-1060.
20. Rangarajan, A., Yuille, A., Gold, S., & Mjolsness, E. (1997). A convergence proof for the soft-assign quadratic assignment algorithm. In M. C. Mozer, M. Jordan, & M. Petsche (Eds.), Advances in neural information processing systems, 9 (pp. 620-626). Cambridge, MA: MIT Press.
21. Sanfeliu, A., & Fu, K. S. (1983). A distance measure between attributed relational graph. IEEE SMC, 13, 353-362.
22. Saul, L. K., & Jordan, M. I. (1995). Exploiting tractable substructures in intractable networks. In D. S. Touretzky, M. C. Moser, & D. Hasselmo (Eds.), Neural information processing systems, 8 (pp. 476-492). Cambridge, MA: MIT Press.
23. Shapiro, L. & Haralick, R. M. (1981). Structural description and inexact matching. IEEE PAMI, 3, 504-519.
24. Shapiro, L., & Haralick, R. M. (1985). A metric for comparing relational descriptions. IEEE Pattern Analysis and Machine Intelligence, 7, 90-94.
25. Simic, P. (1991). Constrained nets for graph matching and other quadratic assignment problems. Neural Computation, 3, 268-281.
26. Suganathan, P. N., Teoh, E. K., & Mital, D. P. (1995). Pattern recognition by graph matching using Potts MFT networks. Pattern Recognition, 28, 997-1009.
27. Wilson, R. C., Evans, A. N., & Hancock, E. R. (1995). Relational matching by discrete relaxation. Image and Vision Computing, 13, 411-421.
28. Wilson, R. C., & Hancock, E. R. (1995). Relational matching by dynamic graph structures. Proceedings of the Fifth International Conference on Computer Vision (pp. 450-456).
29. Wilson, R. C., & Hancock, E. R. (1996a). A Bayesian compatibility model for graph matching. Pattern Recognition Letters, 17, 263-276.
30. Wilson, R. C., & Hancock, E. R. (1996b). Gauging relational consistency and rectifying structural errors. IEEE Computer Society Computer Vision and Pattern Recognition Conference (pp. 47-54).
31. Wilson, R. C., & Hancock, E. R. (1997). Structural matching by discrete relaxation. IEEE Pattern Analysis and Machine Intelligence, 19, 634-648.
32. Wong, A. K. C., & You, M. (1985). Entropy and distance of random graphs with application to structural pattern recognition. IEEE Pattern Analysis and Machine Intelligence, 7, 599-609.
33. Yuille, A. L. (1994). Generalised deformable models, statistical physics and matching problems. Neural Computation, 2, 1-24.
34. Yuille, A. L., & Kosowsky, J. J. (1994). Statistical physics algorithms that converge. Neural Computation, 6, 341-356.
35. Yuille, A. L., Stolorz, P., & Utans, J. (1994). Statistical physics, mixtures of distributions, and the EM algorithm. Neural Computation, 6, 344-340.