Institutional Repository
| effective map-matching on the most simplified road network | |
| Liu Kuien; Li Yaguang; He Fengcheng; Xu Jiajie; Ding Zhiming | |
| 2012 | |
| Conference Name | 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012 |
| Source | GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems |
| Pages | 609-612 |
| Conference Date | November 6, 2012 - November 9, 2012 |
| Conference Place | Redondo Beach, CA, United states |
| Indexed Type | EI |
| ISBN | 9781450316910 |
| Department | (1) Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) University of Chinese Academy of Sciences Beijing 100049 China |
| English Abstract | The effectiveness of map-matching algorithms highly depends on the accuracy and correctness of underlying road networks. In practice, the storage capacity of certain hardware, e.g. mobile devices and embedded systems, is sometimes insufficient to maintain a large digital map for map-matching. Unfortunately, most existing map-matching approaches consider little about this problem. They only apply to environments with information-rich maps, but turn out to be unacceptable for map-matching on simplified road networks. In this paper, we propose a novel map-matching algorithm called Passby to work on most simplified road networks. The storage size of a digital map in disk or memory can be greatly reduced after the simplification. Even under the most simplified situation, i.e., each road segment only consists of a couple of intersection points and omits any other information of it, the experimental results on real dataset show that our Passby algorithm significantly maintains high matching accuracy. Benefiting from the small size of map, simple index structure and heuristic foresight strategy, Passby improves matching accuracy as well as efficiency. © 2012 ACM.; The effectiveness of map-matching algorithms highly depends on the accuracy and correctness of underlying road networks. In practice, the storage capacity of certain hardware, e.g. mobile devices and embedded systems, is sometimes insufficient to maintain a large digital map for map-matching. Unfortunately, most existing map-matching approaches consider little about this problem. They only apply to environments with information-rich maps, but turn out to be unacceptable for map-matching on simplified road networks. In this paper, we propose a novel map-matching algorithm called Passby to work on most simplified road networks. The storage size of a digital map in disk or memory can be greatly reduced after the simplification. Even under the most simplified situation, i.e., each road segment only consists of a couple of intersection points and omits any other information of it, the experimental results on real dataset show that our Passby algorithm significantly maintains high matching accuracy. Benefiting from the small size of map, simple index structure and heuristic foresight strategy, Passby improves matching accuracy as well as efficiency. © 2012 ACM. |
| Keyword | Algorithms Geographic Information Systems Global Positioning System Mobile Devices Motor Transportation |
| Sponsorship | Google; Esri; Microsoft; Nokia; NVIDIA |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15820 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Liu Kuien,Li Yaguang,He Fengcheng,et al. effective map-matching on the most simplified road network[C],2012:609-612. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment