2005 | OriginalPaper | Chapter
Asymmetric Inexact Matching of Spatially-Attributed Graphs
Authors : Yang Li, Dorothea Blostein, Purang Abolmaesumi
Published in: Graph-Based Representations in Pattern Recognition
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.