Results 141 to 150 of about 2,945,917 (192)
High Accuracy Tightly-Coupled Integrity Monitoring Algorithm for Map-Matching [PDF]
A map-matching algorithm employs data from Global Positioning System (GPS), a Geographic Information System (GIS)-based road map and other sensors to first identify the correct link on which a vehicle travels and then to determine the physical location ...
Mohammed Quddus
exaly +7 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013
Hidden Markov Models (HMMs) based map matching - that matches a sequence of location samples to a road network - has received a lot of traction in recent years. In this paper we revisit the basic assumption underlying HMM-based map matching algorithms, namely, the hypothesis that the true mobility is Markovian.
Mudhakar Srivatsa +3 more
openaire +2 more sources
Hidden Markov Models (HMMs) based map matching - that matches a sequence of location samples to a road network - has received a lot of traction in recent years. In this paper we revisit the basic assumption underlying HMM-based map matching algorithms, namely, the hypothesis that the true mobility is Markovian.
Mudhakar Srivatsa +3 more
openaire +2 more sources
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2010
Map matching is a fundamental operation in many applications such as traffic analysis and location-aware services, the killer apps for ubiquitous computing. In past, several map matching approaches have been proposed. Roughly, they can be categorized into four groups: geometric, topological, probabilistic, and other advanced techniques.
Ahmed Jawad 0001, Kristian Kersting
openaire +1 more source
Map matching is a fundamental operation in many applications such as traffic analysis and location-aware services, the killer apps for ubiquitous computing. In past, several map matching approaches have been proposed. Roughly, they can be categorized into four groups: geometric, topological, probabilistic, and other advanced techniques.
Ahmed Jawad 0001, Kristian Kersting
openaire +1 more source
Journal of Algorithms, 2003
Summary: The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic information systems, etc. More precisely, we define feasible distance measures that reflect how close a given pattern \(H\) is to some part of a larger pattern \(G\).
Helmut Alt +3 more
openaire +3 more sources
Summary: The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic information systems, etc. More precisely, we define feasible distance measures that reflect how close a given pattern \(H\) is to some part of a larger pattern \(G\).
Helmut Alt +3 more
openaire +3 more sources
Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2002
A simple MAP model-matching criterion that captures important aspects of recognition in controlled situations is described. A detailed metrical object model is assumed. A probabilistic model of image features is combined with a simple prior on both the pose and the feature interpretations to yield a mixed objective function.
openaire +2 more sources
A simple MAP model-matching criterion that captures important aspects of recognition in controlled situations is described. A detailed metrical object model is assumed. A probabilistic model of image features is combined with a simple prior on both the pose and the feature interpretations to yield a mixed objective function.
openaire +2 more sources
Space-map-matching-based candidate selection for GPS map matching
2016 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI), 2016GPS map matching is the process to align observed GPS positions with road networks of a digital map. One of the key technique in a state-of-art GPS map matching algorithm is to select candidates for each observed GPS point. Traditional candidate selection algorithms focus on spatial proximity, which is not sufficient in real cases.
Chunyang Ma +4 more
openaire +2 more sources

