Skip to main content

On the Design of Reliable Graph Matching Techniques for Change Detection

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3691))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hummel, R., Zucker, S.: On the foundations of relaxation labeling processes. IEEE Trans. Pat. Anal. and Mach. Intel. 5(3), 742–776 (1983)

    Google Scholar 

  2. Christmas, W., Kittler, J., Petrou, M.: Structural Matching in Computer Vision Using Probabilistic Relaxation. IEEE Trans. Pat. Anal. and Mach. Intel. 17(8), 749–764 (1995)

    Article  Google Scholar 

  3. Gautama, S., Borghgraef, A., Bruyland, I.: Automatic registration of satellite images with GIS databases. In: Proc. Advanced Concepts for Intelligent Vision Systems (ACIVS 2002), Gent, Belgium, p. 7 (2002) (on CD-ROM)

    Google Scholar 

  4. Wilson, R.: Inexact Graph Matching Using Symbolic Constraints. Ph. D. thesis, Department of Computer Science. University of York (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gautama, S., Goeman, W., D’Haeyer, J. (2005). On the Design of Reliable Graph Matching Techniques for Change Detection. In: Gagalowicz, A., Philips, W. (eds) Computer Analysis of Images and Patterns. CAIP 2005. Lecture Notes in Computer Science, vol 3691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556121_73

Download citation

  • DOI: https://doi.org/10.1007/11556121_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28969-2

  • Online ISBN: 978-3-540-32011-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics