Advertisement
Published in:
2005 | OriginalPaper | Chapter
Defining Consistency to Detect Change Using Inexact Graph Matching
Authors : Sidharta Gautama, Werner Goeman, Johan D’Haeyer
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
In this paper, we discuss the notion of consistency in inexact graph matching to be able to correctly determine the optimal solution of the matching problem. Consistency allows us to study the cost function which controls the graph matching process, regardless of the optimization technique that is used. The analysis is performed in the context of change detection in geospatial information. A condition based on the expected graph error is presented which allows to determine the bounds of error tolerance and in this way characterizes acceptable over inacceptable data inconsistencies.