Please use this identifier to cite or link to this item:
|Title:||Online map matching by indexing approximate road segments||Authors:||Han, J.
minimum description length(MDL)
optimized packed R tree
|Issue Date:||2011||Citation:||Han, J.,Fu, X.,Liu, L.,Jiang, D. (2011). Online map matching by indexing approximate road segments. ICSESS 2011 - Proceedings: 2011 IEEE 2nd International Conference on Software Engineering and Service Science : 299-303. ScholarBank@NUS Repository. https://doi.org/10.1109/ICSESS.2011.5982313||Abstract:||Given a typical real-world application, a large number of tracking points come at a high rate in a stream fashion and efficient online map matching is a pressing concern. In this paper, two map matching schemes are proposed, which make aggressive use of available main memory to achieve efficient matching. First, road network is partitioned into approximate segments, namely line or arc segments, by minimum description length (MDL) principle. Second, approximate segments are indexed into an optimized packed R tree, insuring that the minimal coverage and overlap are achieved. Based on this, we propose two online map matching schemes, namely Top Matching (TM) and kNN Refinement Matching (KRM), coupled with corresponding buffering strategies. Theory and experiment show that the times of accessing roads is significantly reduced to approximately a fraction of 3 to 6, demonstrating superior performance in terms of running time and matching quality. © 2011 IEEE.||Source Title:||ICSESS 2011 - Proceedings: 2011 IEEE 2nd International Conference on Software Engineering and Service Science||URI:||http://scholarbank.nus.edu.sg/handle/10635/40588||ISBN:||9781424496969||DOI:||10.1109/ICSESS.2011.5982313|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 21, 2019
checked on Apr 19, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.