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.
BibTeX - Entry
@InProceedings{wolter:DagSemProc.08091.12,
author = {Wolter, Diedrich},
title = {{Qualitative Arrangement Information for Matching}},
booktitle = {Logic and Probability for Scene Interpretation},
pages = {1--8},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {8091},
editor = {Anthony G. Cohn and David C. Hogg and Ralf M\"{o}ller and Bernd Neumann},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2008/1610},
URN = {urn:nbn:de:0030-drops-16103},
doi = {10.4230/DagSemProc.08091.12},
annote = {Keywords: Matching, qualitative spatial reasoning}
}
Keywords: |
|
Matching, qualitative spatial reasoning |
Collection: |
|
08091 - Logic and Probability for Scene Interpretation |
Issue Date: |
|
2008 |
Date of publication: |
|
23.10.2008 |