Abstract
This paper describes a Bayesian framework for matching Delaunay triangulations. Relational structures of this sort are ubiquitous in intermediate level computer vision, being used to represent both Voronoi tessellations of the image plane and volumetric surface data. Our matching process is realised in terms of probabilistic relaxation. The novelty of our method stems from its use of a support function specified in terms of face-units of the graphs under match. In this way we draw on more expressive constraints than is possible at the level of edge-units alone. In order to apply this new relaxation process to the matching of realistic imagery requires a model of the compatibility between faces of the data and model graphs. We present a particularly simple compatibility model that is entirely devoid of free parameters. It requires only knowledge of the number of nodes, edges and faces in the model graph. The resulting matching scheme is evaluated on radar images.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Ahuja and M Tuceryan, “Extraction of Early Perceptual Structure in Dot Patterns: Integrating Region, Boundary and Component Gestalt”, CVGIP, 48, pp 304–356, 1989.
J-D. Boissonnat, “Geometric Structures for Three-Dimensional Shape Representation”, ACM Transactions on Graphics, 3, pp. 266–286, 1984.
A.N. Evans, N.G. Sharp and E.R. Hancock, “Noise Models for Linear Feature Detection in SAR Images”, Proceedings of the 1994 International Conference on Image Processing, pp 466–470, 1994.
O.D. Faugeras, E. Le Bras-Mehlman and J-D. Boissonnat,“Representing Stereo Data with the Delaunay Triangulation”, Artificial Intelligence, 44, pp. 41–87, 1990.
J. Kittler and E.R. Hancock, “Combining Evidence in Probabilistic Relaxation”, International Journal of Pattern Recognition and Artificial Intelligence, 3, pp 29–64, 1989.
J. Kittler and E.R. Hancock, “Contextual Decision Rule for Region Analysis”, Image and Vision Computing, 5, pp, 145–154, 1987.
J. Kittler, W.J. Christmas and M.Petrou, “Probabilistic Relaxation for Matching Problems in Machine Vision”, Proceedings of the Fourth International Conference on Computer Vision, pp. 666–674, 1993.
H. Ogawa, “Labelled Point Pattern Matching by Delaunay Triangulation and Maximal Cliques”, Pattern Recognition, 19, pp. 35–40, 1986.
M. Tuceryan and T Chorzempa, “Relative Sensitivity of a Family of Closest Point Graphs in Computer Vision Applications”, Pattern Recognition, 25, pp. 361–373, 1991.
R.C. Wilson and E.R Hancock, “Matching Features in Aerial Images by Relaxation Labelling”, Progress in Image Analysis and Processing III, Editor: S. Impedovo, pp. 209–217, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finch, A.M., Wilson, R.C., Hancock, E.R. (1995). Matching delaunay triangulations by probabilistic relaxation. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_316
Download citation
DOI: https://doi.org/10.1007/3-540-60268-2_316
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60268-2
Online ISBN: 978-3-540-44781-8
eBook Packages: Springer Book Archive