Graph based topological map matching
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
May 15, 2014
app pub date -
Dec 31, 2010
filing date -
Dec 31, 2010
priority date (Note) -
Published
status (Latency Note)
Importance
Abstract
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.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully