会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • INCREMENTAL NETWORK GENERATION PROVIDING SEAMLESS NETWORK
    • 增值网络生成提供无缝网络
    • WO2012089271A1
    • 2012-07-05
    • PCT/EP2010/070940
    • 2010-12-30
    • TOMTOM GERMANY GMBH & CO. KGMUND, HeikoSCHARMANN, Hannes
    • MUND, HeikoSCHARMANN, Hannes
    • G01C21/32G09B29/10
    • G01C21/26G01C21/32G06K9/00791G09B29/106
    • A system and method for generating a seamless road network of a large geographical area includes a plurality of GPS traces extending across a geographical area. A plurality of threads simultaneously employ entire traces to collectively generate the seamless road network. The method includes dividing the geographical area into tiles, with each trace extending across several tiles. Each thread can employ one of the traces while another thread employs another trace. Each thread employs an entire one of the traces extending across several tiles during a single step. A job scheduler and blocking table prevent threads from simultaneously processing traces having common tiles and disturbing one another. The threads employ an incremental map matching method, wherein the probe traces are compared to existing line segments of the digital map, and new line segments are created using the probe traces not matching the existing line segments.
    • 用于产生大地理区域的无缝道路网络的系统和方法包括跨越地理区域延伸的多个GPS迹线。 多个线程同时使用整个轨迹来共同生成无缝道路网络。 该方法包括将地理区域划分成瓦片,每个迹线延伸穿过几个瓦片。 每个线程可以使用其中一个跟踪,而另一个线程使用另一个跟踪。 每个线程在单个步骤中使用跨越多个瓦片的整个轨迹。 作业调度程序和阻止表阻止线程同时处理具有普通瓦片和相互干扰的跟踪。 线程使用增量映射匹配方法,其中将探针迹线与数字地图的现有线段进行比较,并且使用不匹配现有线段的探针迹线创建新的线段。
    • 4. 发明申请
    • MANUEVRE ANALYSIS, DIRECTION OF TRAFFIC FLOW AND DETECTION OF GRADE SEPARATED CROSSINGS FOR NETWORK GENERATION IN A DIGITAL MAP
    • MANUEVRE分析,交通流量指导和数字地图网络生成等级分割交叉检测
    • WO2012089277A1
    • 2012-07-05
    • PCT/EP2010/070965
    • 2010-12-31
    • TOMTOM GERMANY GMBH & CO. KGMUND, Heiko
    • MUND, Heiko
    • G01C21/32G08G1/01
    • G01C21/32G08G1/0112
    • A method for maneuver calculation using traces derived from probe data is provided. The method provides a digital vector map configured Io store a plurality of line segments, shape points, and maneuvers, each of the maneuvers comprising at least three consecutive shape points or junctions spatially associated within a coordinate system. Each of the plurality of maneuvers includes a maneuver weight value. Each line segment in the digital vector map is associated with, a line weight value. A probe trace is provided and map matching criteria are established. The matched probe data is utilized to adjust ihs Sine weight values. The probe trace is associated with one of the plurality of maneuvers and the maneuver weight value is adjusted based on the probe trace. The adjusted maneuver weight value is utilized to update maneuvers available at an individual shape point or junction.
    • 提供了使用从探头数据导出的轨迹进行机动计算的方法。 该方法提供配置为存储多个线段,形状点和机动的数字矢量地图,每个操作包括在坐标系内空间相关联的至少三个连续的形状点或结。 多个动作中的每一个包括机动重量值。 数字向量图中的每个线段与行权重值相关联。 提供探测器轨迹,并建立地图匹配标准。 匹配的探头数据用于调整ihs正弦重量值。 探测轨迹与多个操作中的一个相关联,并且基于探测轨迹调整操纵重量值。 调整的机动重量值用于更新在单个形状点或结点处可用的操纵。
    • 5. 发明申请
    • GRAPH BASED TOPOLOGICAL MAP MATCHING
    • 基于图形的拓扑图匹配
    • WO2012089285A1
    • 2012-07-05
    • PCT/EP2010/070973
    • 2010-12-31
    • TOMTOM GERMANY GMBH & CO. KGMUND, HeikoSCHARMAN, Hannes
    • MUND, HeikoSCHARMAN, Hannes
    • G01C21/30
    • G06T11/206G01C21/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.
    • 一种改进的方法,用于将从探测数据导出的轨迹与数字矢量图中的一个或多个线段相匹配。 探针轨迹中的点临时匹配数字向量图中的线段,以识别所有可能的匹配候选。 创建具有一个或多个路径的匹配候选的图形。 图形具有与探针轨迹中的点对应的多个顺序水平。 每个匹配的候选者被分配到与其相关的跟踪点对应的图表的级别。 边缘在相邻级别的匹配候选者之间建立,只要它们在拓扑上相关。 图表被简化和评分。 最好的路径提供匹配的结果。 本发明允许使用图理论方法来找到通过该图的最佳路径,其又代表有效的地图匹配算法。 本发明的概念可以与纵向距离一起用作匹配标准。
    • 7. 发明申请
    • TIME AND/OR ACCURACY DEPENDENT WEIGHTS FOR NETWORK GENERATION IN A DIGITAL MAP
    • 时间和/或准确度数字地图中网络生成的相关权重
    • WO2011079247A1
    • 2011-06-30
    • PCT/US2010/061973
    • 2010-12-23
    • TOMTOM NORTH AMERICA INC.TOMTOM GERMANY GMBH & CO. KGMORLOCK, ClaytonMUND, Heiko
    • MORLOCK, ClaytonMUND, Heiko
    • G01C21/30
    • G01C21/32
    • A method for improving and extending an existing digital road network and generating new networks from statistically relevant amounts of probe data recorded by GPS-enabled navigation devices. New probe data is matched to the existing digital map, then the data merged into the existing network using a time-dependent weight and/or accuracy-dependent weight. A recalculation date is established, and the weight value of a line segment and/or trace is adjusted as a function of the time span relative to the recalculation. The function may include setting a maximal time period divided into bins each having a respective weight reduction factor, or applying decay function. Through this technique, digital maps can be updated and extended without undue influence exerted by old trace data.
    • 一种用于改进和扩展现有数字道路网络并从由GPS启用的导航设备记录的统计相关数量的探测数据产生新网络的方法。 新的探测数据与现有的数字地图相匹配,然后使用时间依赖权重和/或精度依赖权重将数据合并到现有网络中。 建立重新计算日期,并且根据相对于重新计算的时间跨度来调整线段和/或轨迹的权重值。 该功能可以包括将最大时间段设置为分别具有各自的加权减少因子或应用衰减功能的箱。 通过这种技术,数字地图可以更新和扩展,而不会由旧的跟踪数据造成不必要的影响。