Abstract
In this paper we present a graph based approach for mining geospatial data. The system uses error-tolerant graph matching to find correspondences between the detected image information and the geospatial vector data. Spatial relations between objects are used to find a reliable object-to-object mapping. Graph matching is used as a flexible query mechanism to answer the spatial query. A condition based on the expected graph error has been presented which allows to determine the bounds of error tolerance and in this way characterizes the relevancy of a query solution. We show that the number of null labels is an important measure to determine relevancy. To be able to correctly interpret the matching results in terms of relevancy the derived bounds of error tolerance are essential.
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
Mizzaro, S.: Relevance: The whole history. Journal of the American Society for Information Science 48(9), 810–832 (1997)
Lavrenko, V.: Optimal Mixture Models in IR. In: Crestani, F., Girolami, M., van Rijsbergen, C.J.K. (eds.) ECIR 2002. LNCS, vol. 2291, pp. 193–212. Springer, Heidelberg (2002)
Rosenfeld, R.: Two decades of Statistical Language Modeling: Where Do We Go From Here? Proceedings of the IEEE 88(8), 1270–1278 (2000)
Zhou, X., Huang, T.: Relevance feedback in content-based image retrieval: some recent advances Source. Information Sciences–Applications 148(1-4), 129–137 (2002)
Tieu, K., Viola, P.: Boosting image retrieval. International Journal of Computer Vision 56(1), 17–36 (2004)
Besl, P., McKay, N.: A method for registration of 3-D shapes. IEEE Trans. Pat. Anal. and Mach. Intel. 14(2), 239–256 (1992)
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., D’Haeyer, J., Philips, W.: Image-based change detection of geographic information using spatial constraints. In: De Caluwe, R., De Tre, G., Bordogna, G. (eds.) Flexible Querying and Reasoning in Spatio-Temporal Databases: Theories and Applications, pp. 351–368. Springer, Heidelberg (2004)
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
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gautama, S., Bellens, R., De Tré, G., D’Haeyer, J. (2006). Relevance Criteria for Data Mining Using Error-Tolerant Graph Matching. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_22
Download citation
DOI: https://doi.org/10.1007/11774938_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35153-5
Online ISBN: 978-3-540-35154-2
eBook Packages: Computer ScienceComputer Science (R0)