A Bayesian compatibility model for graph matching

Pattern Recognition Letters

Volumn 17, Issue 3, 1996, Pages 263-276

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AERIAL IMAGERY; BAYESIAN COMPATIBILITY MODEL; GRAPH MATCHING;

EDGE DETECTION; GRAPH THEORY; MATHEMATICAL MODELS; PATTERN RECOGNITION; TOPOLOGY;

GRAPH MATCHING;

IMAGE PROCESSING;

EID: 0029668281     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(95)00115-8     Document Type: Article

References (23)

1. Bhanu, B. and O.D. Faugeras (1984). Shape matching of 2-dimensional objects. IEEE Pattern Anal. Mach. Intell. 6, 137-156.
2. Christmas, W.J., J. Kittler and M. Petrou (1995). Structural matching in computer vision using probabilistic relaxation. IEEE Pattern Anal. Mach. Intell. 17, 749-764.
3. Cucka, P. and A. Rosenfeld (1992). Linear feature compatibility for pattern-matching relaxation. Pattern Recognition 25, 189-196.
4. Faugeras, O.D. and K.E. Price (1981). Semantic labelling of aerial images using stochastic relaxation. IEEE Pattern Anal. Mach. Intell. 3, 633-642.
5. Finch, A.M., R.C. Wilson and E.R.Hancock (1995). Matching Delaunay triangulations by relaxation labelling. In: Computer Analysis of Images and Patterns, Lecture Notes in Computer Science 970. Springer, Berlin, 350-358.
6. Hancock, E.R. (1993). Resolving edge-line ambiguities by relaxation labelling. Proc. IEEE CVPR Conf., 300-306.
7. Hancock, E.R. and J. Kittler (1990). Discrete relaxation. Pattern Recognition 23, 711-733.
8. Horaud, R. and T. Skordas (1989). Stereo correspondence through feature grouping and maximal cliques. IEEE Pattern Anal. Mach. Intell. 11, 1168-1180.
9. Hummel, R.A. and S.W. Zucker (1983). On the foundations of relaxation labelling. IEEE Pattern Anal. Mach. Intell. 5, 267-287.
10. Kittler, J. and E.R. Hancock (1987). Contextual decision rule for region analysis. Image and Vision Computing 5, 156-165.
11. Kittler. J. and E.R. Hancock (1989). Combining evidence in probabilistic relaxation. Internat. J. Pattern Recognition Artificial Intelligence 3, 29-52.
12. Kittler, J., W.J. Christmas and M. Petrou (1993). Probabilistic relaxation for matching problems in machine vision. Proc. Fourth Internat. Conf. on Computer Vision, 666-673.
13. Li, S.Z. (1992). Matching invariant to translations, rotations and scale changes. Pattern Recognition 25, 583-594.
14. Ogawa, H. (1994). A fuzzy relaxation technique for partial shape matching. Pattern Recognition Lett. 15, 349-355.
15. Price, K.E. (1985). Relaxation matching techniques - a comparison. IEEE Pattern Anal. Mach. Intell. 7, 617-623.
16. Rangananth, S. and L.J. Chipman (1992). Fuzzy relaxation approach to inexact scene matching. Image and Vision Computing 10, 631-640.
17. Rosenfeld, A., R.A. Hummel and S.W. Zucker (1976). Scene labelling by relaxation operations. IEEE Syst. Man Cybernet. 6, 420-433.
18. Sanfeliu, A. and K.S. Fu (1995). A distance measure between attributed relational graphs. IEEE Syst. Man Cybernet. 13, 353-362.
19. Sarkar, S. and K.L. Boyer (1993). Perceptual organisation in computer vision; a review and proposal for a classificatory structure. IEEE Syst. Man Cybernet. 23, 382-399.
20. Shapiro, L.G. and R.M. Haralick (1985). A metric for comparing relational descriptions. IEEE Pattern Anal. Mach. Intell. 7, 90-94.
21. Wilson, R.C. and E.R. Hancock (1992). Relaxation matching of road networks in aerial images using topological constraints. Proc. Internat. Society for Optical Engineering 2059, 444-455.
22. Wilson, R.C. and E.R. Hancock (1994). Graph matching by discrete relaxation. In: E.S. Gelsema and L.N. Kanal, Eds., Pattern Recognition in Practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems. North-Holland, Amsterdam, 165-176.
23. Wilson, R.C. and E.R. Hancock (1995). Relational matching with dynamic graph structures. Proc. Fifth Internat. Conf. on Computer Vision, 450-456.