effective map-matching on the most simplified road network
文献类型：会议论文
| 作者 | Liu Kuien ; Li Yaguang ; He Fengcheng ; Xu Jiajie ; Ding Zhiming |
| 出版日期 | 2012 |
| 会议名称 | 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012 |
| 会议日期 | November 6, 2012 - November 9, 2012 |
| 会议地点 | Redondo Beach, CA, United states |
| 关键词 | Algorithms Geographic information systems Global positioning system Mobile devices Motor transportation |
| 页码 | 609-612 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 会议主办者 | Google; Esri; Microsoft; Nokia; NVIDIA |
| 会议录 | GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
 |
| 语种 | 英语 |
| ISBN号 | 9781450316910 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15820]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Liu Kuien,Li Yaguang,He Fengcheng,et al. effective map-matching on the most simplified road network[C]. 见:20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012. Redondo Beach, CA, United states. November 6, 2012 - November 9, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。