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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Gautama, S., Goeman, W., & D’Haeyer, J. (2005). Defining consistency to detect change using inexact graph matching. In Lecture Notes in Computer Science (Vol. 3434, pp. 243–252). Springer Verlag. https://doi.org/10.1007/978-3-540-31988-7_23
Mendeley helps you to discover research relevant for your work.