Matching Delaunay Graphs

This paper describes a Bayesian framework for matching Delaunay graphs. 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 triangular 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. We present a particularly simple face compatibility model that is entirely devoid of free parameters. It requires only knowledge of the numbers of nodes, edges and faces in the model graph. The resulting matching scheme is evaluated on radar images and compared with its edge-based counterpart.