Asymmetric inexact matching of spatially-attributed graphs

Authors:
Yang Li;Dorothea Blostein;Purang Abolmaesumi
Affiliations:
School of Computing, Queen's University, Kingston Ontario, Canada;School of Computing, Queen's University, Kingston Ontario, Canada;School of Computing, Queen's University, Kingston Ontario, Canada
Venue:
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Year:
2005

Citing 8
Cited 0

Feature-based correspondence: an eigenvector approach

Image and Vision Computing - Special issue: BMVC 1991
An Active Testing Model for Tracking Roads in Satellite Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Bayesian compatibility model for graph matching

Pattern Recognition Letters
New Prospects in Line Detection by Dynamic Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Bayesian Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses inexact matching of graphs that are spatially-attributed and asymmetric. In a spatially-attributed graph, vertex attributes indicate the coordinates of an image feature represented by the vertex. Asymmetry arises when two graphs represent the same data at different resolutions: this causes an edge in the coarse graph to match an entire path in the fine graph. The two graphs may use different coordinate systems, so a coordinate transform must be estimated during the graph matching. We present an edge first graph matching algorithm to solve this problem, and illustrate its application to the registration of satellite images to road maps. In our current implementation, graphs that represent road networks are manually extracted from satellite images and digitized road maps. Most of the existing algorithms are not designed to handle the asymmetry present when matching a coarse graph to a fine graph.