semMatch: Road Semantics-based Accurate Map Matching for Challenging Positioning Data

被引:31
作者
Aly, Heba [1 ]
Youssef, Moustafa [2 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[2] E JUST, Wireless Res Ctr, New Borg El Arab City, Alexandria, Egypt
来源
23RD ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2015) | 2015年
关键词
Road semantics-based map matching; Map matching for challenging positioning data; HMM-based map matching;
D O I
10.1145/2820783.2820824
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Map matching has been used to reduce the noisiness of the location estimates by aligning them to the road network on a digital map. A growing number of applications, e.g. energy efficient localization and cellular provider side localization, depend on the availability of only sparse and coarse-grained positioning data; leading to a challenging map matching process. In this paper, we present semMatch: a system that can provide accurate HMM-based map matching for challenging positioning traces. semMatch leverages the smartphone's inertial sensors to detect different road semantics; such as speed bumps, tunnels, and turns; and uses them in a mathematically-principled way as hints to overcome the sparse, noisy, and coarse-grained input positioning data, improving the HMM map matching accuracy and efficiency. To do that, semMatch applies a series of preprocessing modules to handle the noisy locations. The filtered location data is then processed by the core of semMatch system using a novel incremental HMM algorithm that combines a semantics-enriched digital map and the car's ambient road semantics in its estimation process. We have evaluated semMatch using traces collected from different cities covering more than 150km under different harsh scenarios including coarse-grained cellular-based positioning data, sparse GPS traces with extremely low sampling rate, and noisy traces with a large number of back-and-force transitions. The results show that semMatch significantly outperforms traditional map matching algorithms under all scenarios, with an enhancement of at least 416% and 894% in precision and recall respectively in the most difficult cases. This highlights its promise as a next generation map matching algorithm for challenging environments.
引用
收藏
页数:10
相关论文
共 40 条
  • [31] Phuyal B. P., 2001, ION GPS
  • [32] Quddus M. A., 2003, GPS SOLUTIONS
  • [33] Quddus M. A., 2007, TRANSP RES C
  • [34] Rabiner L.R., 1989, PROCEEDINGS OF THE I, V77
  • [35] Thiagarajan A., 2011, P C NETW SYS DES IMP
  • [36] Wang G., 2014, SIGSPATIAL
  • [37] Wang H., 2013, INFOCOM
  • [38] White C. E., 2000, TRANSP RES C
  • [39] Yang J.-s., 2005, J E ASIA SOC TRANSP
  • [40] Youssef M, 2010, GLOBECOM