Title :
Any-time behavior for obstacle tracking
Author :
Sobottka, Karin ; Bunke, Horst
Author_Institution :
Inst. of Comput. Sci. & Appl. Math., Bern Univ., Switzerland
fDate :
6/21/1905 12:00:00 AM
Abstract :
Since any-time behavior allows a tradeoff between solution quality and search time, any-time algorithms are very useful for automotive applications in which robustness and real-time processing plays a significant role. In general, any-time algorithms have the property that a solution is ready whenever the algorithm is stopped and the solution improves with additional computing time. We make use of this for obstacle tracking. Our obstacle tracking scheme is based on finding feature correspondences. First, we apply a restricted matching strategy to obtain a first solution to the correspondence problem. Afterwards, while computing time remains, the current solution is improved using an optimal matching strategy. Following this strategy, a processing in real-time can be ensured at any time
Keywords :
collision avoidance; computer vision; computerised navigation; image matching; image sequences; optical tracking; real-time systems; road vehicles; any-time behavior; collision avoidance; computer vision; feature correspondence; image matching; image sequence; navigation; obstacle tracking; real-time systems; road vehicles; Automotive applications; Computer science; Electronic mail; Image resolution; Image sensors; Intelligent sensors; Layout; Mathematics; Optimal matching; Robustness;
Conference_Titel :
Intelligent Transportation Systems, 1999. Proceedings. 1999 IEEE/IEEJ/JSAI International Conference on
Conference_Location :
Tokyo
Print_ISBN :
0-7803-4975-X
DOI :
10.1109/ITSC.1999.821083