大规模浮动车流数据并行地图匹配方法 |
| |
引用本文: | 谢金运,涂伟,李清泉,常晓猛,马承林,李追日,黄练.大规模浮动车流数据并行地图匹配方法[J].武汉大学学报(信息科学版),2017,42(5):697-703. |
| |
作者姓名: | 谢金运 涂伟 李清泉 常晓猛 马承林 李追日 黄练 |
| |
作者单位: | 1.深圳大学土木学院空间信息智能感知与服务深圳市重点实验室, 广东 深圳, 518060 |
| |
基金项目: | 国家自然科学基金41401444国家自然科学基金41371377深圳市战略性新兴产业发展专项资金JCYJ20121019111128765深圳市基础研究计划JCYJ20140828163633980中国博士后科学基金面上项目2014M560671测绘遥感信息工程国家重点实验室开放基金13S02 |
| |
摘 要: | 提出了一种并行地图匹配方法,高效处理海量浮动车流数据。该方法顾及交通网络拓扑,指出网格过滤、距离过滤和方向过滤等策略减少邻近候选节点的数量,利用预先生成的最短路径列表减少最短路径计算量。基于非关系型分布式数据库实现了高效率的浮动车流数据并行地图匹配,利用武汉市的浮动车流数据进行了实验。实验结果表明,本文方法正确率为90.6%,计算效率能满足大规模浮动车流数据实时处理的需要。
|
关 键 词: | 浮动车 流数据 地图匹配 并行计算 GPS轨迹数据 |
收稿时间: | 2015-07-13 |
A Parallel Map-Matching Approach for Large Volume Floating Car Stream Data |
| |
Abstract: | Mp-matching floating car data is a fundamental task in traffic surveillance, traffic anomaly detection, and urban dynamic analysis. This study proposes a parallel map-matching approach to process streaming large volume floating car data. Considering the connectivity of a transportation network, the matching candidates are limited with a coarse spatial grid. A distance filter and a direction filter are combined to reduce the number of matching candidates. The trajectory between consecutive nodes is recovered with a shortest path list. The shortest path list in memory was developed to reduce the computation and speed up the matching process. A non-relational distributed database parallelizes the map-matching procedure. The performance of the presented approach was tested with large volume floating car data in Wuhan, China. It demonstrates that this method achieves 90.62% correct map-matching results. This efficiency could fulfill the needs of real-time traffic monitoring, and will benefit trajectory analysis. |
| |
Keywords: | |
本文献已被 CNKI 等数据库收录! |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
| 点击此处可从《武汉大学学报(信息科学版)》下载免费的PDF全文 |