Skip to main content
SpringerLink
Log in

Computing Spatial Similarity by Games

  • Conference paper
  • First Online:
AI*IA 2001: Advances in Artificial Intelligence (AI*IA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2175))

Included in the following conference series:

Abstract

The multi-modal logic S4u, known in the field of qualitative spatial reasoning to be a decidable formalism for expressing topological and mereological properties, can also be exploited to define a distance measure among patterns. Here, we recall the notion of topological distance defined in terms of games over S4u models, and show how it is effectively computed for a specific class of models: the class of polygons of the real plane, a class of topological models widely used in computer science and AI applications. Finally, we briefly overview an implemented system based on the presented framework. This paper is the practical counterpart of, and continuation to [1].

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Aiello. Topo-distance: Measuring the Difference between Spatial Patterns. In G. Brewka and L. Moniz Pereira, editors, Logics in Artificial Intelligence (JELIA 2000), LNAI, 1919, pages 73–86. Springer Verlag, 2000.

    Google Scholar 

  2. M. Aiello and J. van Benthem. Logical Patterns in Space. In D. Barker-Plummer, D. Beaver, J. van Benthem, and P. Scotto di Luzio, editors, Logic Unleashed: Language, Diagrams and Computation, Stanford, 2001. CSLI.

    Google Scholar 

  3. N. Asher and L. Vieu. Toward a Geometry of Common Sense: a semantics and a complete axiomatization of mereotopology. In IJCAI95, pages 846–852. International Joint Conference on Artificial Itelligence, 1995.

    Google Scholar 

  4. J. Barwise and L. Moss. Vicious Circles. CSLI, 1996.

    Google Scholar 

  5. B. Bennett. Modal Logics for Qualitative Spatial Reasoning. Bulletin of the IGPL, 3:1–22, 1995.

    Google Scholar 

  6. J. van Benthem. Modal Correspondence Theory. PhD thesis, University of Amsterdam, 1976.

    Google Scholar 

  7. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge Univeristy Press, 2001.

    Google Scholar 

  8. R. Casati and A. Varzi. Parts and Places. MIT Press, 1999.

    Google Scholar 

  9. S.K. Chang and S.H. Liu. Picture indexing and abstraxtion techniques for pictorial databases. IEEE Trans. on Pattern Analysis and Machine Intelligence, 6(7):475–484, 1984.

    Article  MATH  Google Scholar 

  10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000. Second edition.

    Google Scholar 

  11. A. Del Bimbo. Visual Information Retrieval. Morgan Kaufmann Publishers, 1999.

    Google Scholar 

  12. W. Frakes and R. Baeza-Yates, editors. Information Retrieval, Data Structures and Algorithms. Prentice Hall, 1992.

    Google Scholar 

  13. V. Goranko and S. Pasy. Using the universal modality: gains and questions. Journal of Logic and Computation, 2:5–30, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. D. Park. Concurrency and Automata on Infinite Sequences. In Proceedings of the 5th GI Conference, pages 167–183, Berlin, 1981. Springer Verlag.

    Google Scholar 

  15. E. Petrakis, C. Faloutsos, and L. King-Ip. ImageMap: An Image Indexing Method Based on Spatial Similarity. IEEE Transactions on Knowledge and Data Engineering, 2001. To appear.

    Google Scholar 

  16. I. Pratt and O. Lemon. Ontologies for Plane, Polygonal Mereotopology. Notre Dame Journal of Formal Logic, 38(2):225–245, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  17. D. Randell, Z. Cui, and A. G. Cohn. A Spatial Logic Based on Regions and Connection. In Proc. of Int. Conf. on Principles of Knowledge Representation and Reasoning (KR’92), pages 165–176. San Mateo, 1992.

    Google Scholar 

  18. S. Santini and J. Ramesh. Similarity measures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(9):871–883, 1999.

    Article  Google Scholar 

  19. O. Stock, editor. Spatial and Temporal Reasoning. Kluwer Academic Publishers, 1997.

    Google Scholar 

  20. H. Tagare, F. Vos, C. Jaffe, and J. Duncan. Arrangement: A spatial relation between part for evaluating similarity of tomographic section. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(9):880–893, 1995.

    Article  Google Scholar 

  21. A. Tarski. Der Aussagenkalkül und die Topologie. Fund. Math., 31:103–134, 1938.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Language and Computation, and Intelligent Sensory and Information Systems, University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, The Netherlands

    Marco Aiello

Authors
  1. Marco Aiello
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Bari, via Orabona 4, 70125, Bari, Italy

    Floriana Esposito

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aiello, M. (2001). Computing Spatial Similarity by Games. In: Esposito, F. (eds) AI*IA 2001: Advances in Artificial Intelligence. AI*IA 2001. Lecture Notes in Computer Science(), vol 2175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45411-X_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45411-X_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42601-1

  • Online ISBN: 978-3-540-45411-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation