Graph matching with hierarchical discrete relaxation

Pattern Recognition Letters

Volumn 20, Issue 10, 1999, Pages 1041-1052

  Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Discrete relaxation; Graph matching; Hierarchy; SAR images

Indexed keywords

IMAGE PROCESSING; SYNTHETIC APERTURE RADAR;

EID: 0033208226     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(99)00071-9     Document Type: Article

References (16)

1. Cohen F., Cooper D. Simple parallel hierarchical and relaxation algorithms for segmenting non-causal Markovian random fields. IEEE PAMI. 9:1987;195-219.
2. Davis L., Henderson T. Hierarchical constraint processes for shape analysis. IEEE PAMI. 3:1981;265-277.
3. Finch A.M., Wilson R.C., Hancock E.R. Matching Delaunay graphs. Pattern Recognition. 30:1997;123-140.
4. Gidas B. A renormalization group approach to image processing problems. IEEE PAMI. 11:1989;164-180.
5. Heckerman D., Breese J.S. Causal independence for probability assessment and inference using Bayesian networks. IEEE Trans. Systems Man and Cybernet. Part A - Systems and Humans. 26:1996;826-831.
6. Henderson T. Discrete Relaxation Techniques. 1990;Oxford University Press, Oxford, London, Melbourne.
7. Marr D. Vision. 1982;Freeman, San Francisco.
8. Meila, M., Jordan, M., 1997. Optimal triangulation with continuous cost functions. Advances in Neural Information Processing Systems 9, to appear.
9. Myers, R., Hancock, E.R., to appear. Genetic algorithms for structural editing. In: Proceedings of the 1998 Structural and Syntactic Pattern Recognition Workshop. Lecture Notes in Computer Science, Springer, Berlin, to appear.
10. Pearl J. Probabilistic Reasoning in Intelligent Systems. 1988;Morgan Kaufmann, Los Altos.
11. Qian, J., Ehrich, R., 1990. A framework for uncertainty reasoning in hierarchical visual evidence space. In: Proc. 10th Internat. Conf. Pattern Recognition, Vol. 1, pp. 119-124.
12. Sengupta K., Boyer K.L. Organising large structural model-bases. IEEE PAMI. 17:1995;321-332.
13. Sengupta, K., Boyer, K.L., 1995b. Using geometric hashing and information theoretic clustering for fast recognition from large CAD model-bases. IEEE Internat. Symp. Comput. Vision, pp. 151-156.
14. Smyth P., Heckerman D., Jordan M.I. Probabilistic independence networks for hidden Markov probability models. Neural Comput. 9:1997;227-269.
15. Spiegelhalter D.J., Lauritzen S.L. Sequential updating of conditional probabilities on directed graphical structures. Networks. 20:1990;579-605.
16. Wilson, R.C., Hancock, E.R., 1997. Structural matching by discrete relaxation. IEEE PAMI, June 1997.