DagSemProc.08091.12.pdf
- Filesize: 175 kB
- 8 pages
Document
Qualitative Arrangement Information for Matching
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8091
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-10-23
Cite As Get BibTex
Diedrich Wolter. Qualitative Arrangement Information for Matching. In Logic and Probability for Scene Interpretation. Dagstuhl Seminar Proceedings, Volume 8091, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08091.12
Abstract
In the context of a generalized robot localization task we investigate the utility of qualitative arrangement information in recognition tasks. Qualitative information allows us to make certain knowledge explicit, separating it from uncertain information that we are facing in recognition tasks. This can give rise to efficient matching algorithms for recognition tasks. Particularly qualitative ordering information is very helpful: it can adequately capture certain spatial knowledge and leads to efficient polynomial-time matching algorithms.
Subject Classification
Keywords
- Matching
- qualitative spatial reasoning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads