On the design of reliable graph matching techniques for change detection

  • Authors:

  • Sidharta Gautama;Werner Goeman;Johan D'Haeyer

  • Affiliations:

  • TELIN, Ghent University, Gent, Belgium;TELIN, Ghent University, Gent, Belgium;TELIN, Ghent University, Gent, Belgium

  • Venue:
  • CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we use inexact graph matching to detect changes between spatial features coming from different data sources, e.g. image derived information versus a GIS layer. Corresponding features in the data sources need to be matched taking into account outliers and spatial inaccuracy. We discuss the notion of consistency in inexact graph matching to be able to correctly determine the optimal solution of the matching problem. 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.