NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Towards an Approach for Knowledge-Based Road Detection
Published
Author(s)
Mike Foedisch, Craig I. Schlenoff, Michael O. Shneier
Abstract
Our previous work on road detection suggests the usage of prior knowledge in order to improve performance. In this paper we will explain our motivation for a novel approach, define requirements and point out issues, particularly concerning the representation of road depending on the use, which need to be addressed. The proposed system will provide symbolic data for high-level processes and guidance for low-level processes. Furthermore, we will outline the recognition approach based on previously discussed requirements and issues. This paper has a visionary character based on our experience with road detection for autonomous road vehicles.
Proceedings Title
CIKM Conference: Workshop on Research in Knowledge Representation for Autonomous Systems| | |
Conference Dates
October 31-November 5, 2005
Conference Location
Bremen, GE
Conference Title
Research in Knowledge Representation for Autonomous Systems Workshop
Foedisch, M.
, Schlenoff, C.
and Shneier, M.
(2006),
Towards an Approach for Knowledge-Based Road Detection, CIKM Conference: Workshop on Research in Knowledge Representation for Autonomous Systems| | |, Bremen, GE, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=824020
(Accessed October 6, 2025)