DocumentCode :
2726451
Title :
Benchmark of efficient data structures for recognising movable objects
Author :
Bilke, Andreas ; Sieck, Jürgen
Author_Institution :
Res. Group Inf. & Commun. Syst., HTW Berlin (Univ. of Appl. Sci.), Berlin, Germany
fYear :
2011
fDate :
21-22 Nov. 2011
Firstpage :
173
Lastpage :
176
Abstract :
In previous research a passenger assistance system to detect arriving buses was developed. In this paper, more investigation is made concerning the implementation of an efficient server for managing arriving buses and informing waiting users. Three different search structures are described and their suitability for the server is evaluated. The data points for the search were extracted from OpenStreetMap to get a realistic point distribution.
Keywords :
cartography; data structures; feature extraction; object recognition; traffic engineering computing; OpenStreetMap; arriving buses detection; data structure benchmark; movable object recognition; passenger assistance system; point distribution; Benchmark testing; Cities and towns; Data mining; Data structures; Europe; Global Positioning System; Servers; benchmark; delaunay triangulation; kd-tree; nearest neighbour search; passenger assistance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Informatics (CINTI), 2011 IEEE 12th International Symposium on
Conference_Location :
Budapest
Print_ISBN :
978-1-4577-0044-6
Type :
conf
DOI :
10.1109/CINTI.2011.6108493
Filename :
6108493
Link To Document :
بازگشت