专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2012089285A1 GRAPH BASED TOPOLOGICAL MAP MATCHING 审中-公开
标题翻译：基于图形的拓扑图匹配
公开(公告)号：WO2012089285A1
公开(公告)日：2012-07-05
申请号：PCT/EP2010/070973
申请日：2010-12-31
申请人： TOMTOM GERMANY GMBH & CO. KG , MUND, Heiko , SCHARMAN, Hannes
发明人： MUND, Heiko , SCHARMAN, Hannes
IPC分类号： G01C21/30
CPC分类号： G06T11/206 , G01C21/30
摘要： An improved method for matching traces derived from probe data to one or more line segments in a digital vector map. Points in a probe trace are provisionally matched one-by- one to line segments in the digital vector map to identify all possible matching candidates. A graph of the matching candidates is created having one or more paths. The graph has a plurality of sequential levels corresponding to the points in the probe trace. Each matching candidate is assigned to a level of the graph corresponding with trace point to which it relates. Edges are established between matching candidates in adjacent levels provided they are topologically related to one another. The graph is simplified and scored. The best paths deliver the matching results. The invention allows use of graph theoretic methods to find the best path through the graph, which in turn represents an efficient map matching algorithm. The concepts of this invention may be used in conjunction with longitudinal distance as matching criterion.
摘要翻译：一种改进的方法，用于将从探测数据导出的轨迹与数字矢量图中的一个或多个线段相匹配。探针轨迹中的点临时匹配数字向量图中的线段，以识别所有可能的匹配候选。创建具有一个或多个路径的匹配候选的图形。图形具有与探针轨迹中的点对应的多个顺序水平。每个匹配的候选者被分配到与其相关的跟踪点对应的图表的级别。边缘在相邻级别的匹配候选者之间建立，只要它们在拓扑上相关。图表被简化和评分。最好的路径提供匹配的结果。本发明允许使用图理论方法来找到通过该图的最佳路径，其又代表有效的地图匹配算法。本发明的概念可以与纵向距离一起用作匹配标准。

IPRDB

热门服务

关于我们

友情链接

联系方式