Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Fast map matching, an algorithm integrating hidden Markov model with precomputation
KTH, School of Architecture and the Built Environment (ABE), Urban Planning and Environment, Geoinformatics. KTH, Royal Institute of Technology in Sweden.ORCID iD: 0000-0001-5361-6034
KTH, School of Architecture and the Built Environment (ABE), Urban Planning and Environment, Geoinformatics.ORCID iD: 0000-0003-1164-8403
2017 (English)In: International Journal of Geographical Information Science, ISSN 1365-8816, E-ISSN 1365-8824, p. 1-24Article in journal (Refereed) Published
Abstract [en]

Wide deployment of global positioning system (GPS) sensors has generated a large amount of data with numerous applications in transportation research. Due to the observation error, a map matching (MM) process is commonly performed to infer a path on a road network from a noisy GPS trajectory. The increasing data volume calls for the design of efficient and scalable MM algorithms. This article presents fast map matching (FMM), an algorithm integrating hidden Markov model with precomputation, and provides an open-source implementation. An upper bounded origin-destination table is precomputed to store all pairs of shortest paths within a certain length in the road network. As a benefit, repeated routing queries known as the bottleneck of MM are replaced with hash table search. Additionally, several degenerate cases and a problem of reverse movement are identified and addressed in FMM. Experiments on a large collection of real-world taxi trip trajectories demonstrate that FMM has achieved a considerable single-processor MM speed of 25,000–45,000 points/second varying with the output mode. Investigation on the running time of different steps in FMM reveals that after precomputation is employed, the new bottleneck is located in candidate search, and more specifically, the projection of a GPS point to the polyline of a road edge. Reverse movement in the result is also effectively reduced by applying a penalty.

Place, publisher, year, edition, pages
Taylor & Francis, 2017. p. 1-24
Keywords [en]
Map matching, precomputation, performance improvement
National Category
Transport Systems and Logistics
Research subject
Geodesy and Geoinformatics
Identifiers
URN: urn:nbn:se:kth:diva-217993DOI: 10.1080/13658816.2017.1400548ISI: 000422691100006Scopus ID: 2-s2.0-85033662435OAI: oai:DiVA.org:kth-217993DiVA, id: diva2:1158523
Note

QC 20171121

Available from: 2017-11-20 Created: 2017-11-20 Last updated: 2018-02-02Bibliographically approved
In thesis
1. Discovering Contiguous Sequential Patterns in Network-Constrained Movement
Open this publication in new window or tab >>Discovering Contiguous Sequential Patterns in Network-Constrained Movement
2017 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

A large proportion of movement in urban area is constrained to a road network such as pedestrian, bicycle and vehicle. That movement information is commonly collected by Global Positioning System (GPS) sensor, which has generated large collections of trajectories. A contiguous sequential pattern (CSP) in these trajectories represents a certain number of objects traversing a sequence of spatially contiguous edges in the network, which is an intuitive way to study regularities in network-constrained movement. CSPs are closely related to route choices and traffic flows and can be useful in travel demand modeling and transportation planning. However, the efficient and scalable extraction of CSPs and effective visualization of the heavily overlapping CSPs are remaining challenges.

To address these challenges, the thesis develops two algorithms and a visual analytics system. Firstly, a fast map matching (FMM) algorithm is designed for matching a noisy trajectory to a sequence of edges traversed by the object with a high performance. Secondly, an algorithm called bidirectional pruning based closed contiguous sequential pattern mining (BP-CCSM) is developed to extract sequential patterns with closeness and contiguity constraint from the map matched trajectories. Finally, a visual analytics system called sequential pattern explorer for trajectories (SPET) is designed for interactive mining and visualization of CSPs in a large collection of trajectories.

Extensive experiments are performed on a real-world taxi trip GPS dataset to evaluate the algorithms and visual analytics system. The results demonstrate that FMM achieves a superior performance by replacing repeated routing queries with hash table lookups. BP-CCSM considerably outperforms three state-of-the-art algorithms in terms of running time and memory consumption. SPET enables the user to efficiently and conveniently explore spatial and temporal variations of CSPs in network-constrained movement.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2017. p. 63
Series
TRITA-SOM, ISSN 1653-6126 ; 2017-13
Keywords
map matching, trajectory pattern mining, closed contiguous sequential pattern mining, trajectory pattern visualization
National Category
Other Computer and Information Science
Research subject
Geodesy and Geoinformatics
Identifiers
urn:nbn:se:kth:diva-217998 (URN)978-91-7729-589-1 (ISBN)
Presentation
2017-12-13, Sal L51, Drottning Kristinas Väg 30, KTH, Stockholm, 14:00 (English)
Opponent
Supervisors
Note

QC 20171122

Available from: 2017-11-22 Created: 2017-11-21 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Yang, CanGidofalvi, Gyözö
By organisation
Geoinformatics
In the same journal
International Journal of Geographical Information Science
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 160 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf