Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 4. Kluwer Academic Publishers, Boston (1999)
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)
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, 7 p. (2002) (on CD-ROM)
Hummel, R., Zucker, S.: On the foundations of relaxation labeling processes. IEEE Trans Pat. Anal. and Mach. Intel. 5(3), 742–776 (1983)
Li, S.: Markov Random Field Modeling in Computer Vision. Springer, New-York (1995)
Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. Journal of Artif. Neural Networks 2(4), 411–420 (1995)
Wilson, R.: Inexact Graph Matching Using Symbolic Constraints. Ph. D. thesis, Department of Computer Science, University of York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gautama, S., Goeman, W., D’Haeyer, J. (2005). Defining Consistency to Detect Change Using Inexact Graph Matching. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)