Averaging GPS Segments

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Electrical, Electronics and Communications Engineering".

Deadline for manuscript submissions: closed (31 December 2019) | Viewed by 4931

Special Issue Editors


E-Mail Website
Guest Editor
School of Computing, University of Eastern Finland, 80101 Joensuu, Finland
Interests: clustering; machine learning; data mining; location-based applications
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
School of Computing, University of Eastern Finland, Office TB341, Science Park, Joensuu, Finland
Interests: location-based applications; data mining; user interfaces

Special Issue Information

Dear Colleagues,

Background:

In recent years, navigation- and location-based applications have seen a rise in development. For these to work reliably, up-to-date road networks are essential. Maintaining these road networks requires extensive manual editing, which has led researchers to develop automated road-network extraction methods from GPS trajectories. A common approach is to divide the task in two:

  • detecting the intersections
  • creating the road segments

This Special Issue focuses on the later and poses the following challenge: knowing the location of the intersections and using only the GPS trajectory segments between intersection pairs, compute the road segment connecting such a pair.

text

Call for submissions:

The objective is to find methods to average a given set of trajectories so that they would match ground truth segments obtained from Open Street Map. The algorithm should be both effective and efficient. We organize the special issue as a challenge. We invite researchers and practitioners to:

  • Submit your method in the competition
  • Submit a paper to the special issue

It is possible to submit your method only to the competition but we recommend to submit also a paper to the special issue if the method has novelty. Paper submissions outside the competition are also allowed and not limited to the averaging problem. Paper submissions dealing with problems related to GPS trajectory analysis and road network construction are also welcome. All submitted papers will go through a normal review process.

Competition rules:

We will provide a training set extracted from the data in [1,2,3,4]. Submitted methods should work on all these segments but expected to generalize to other similar data beyond the training set. The methods are not allowed to utilize additional data others than what is included in the training dataset. In specific, external databases are forbidden. All submissions should be self-documented programs in Matlab, Python, C/C++, Java or PHP to be executed on a Linux machine. We provide templates for reading and writing the data. Each submission must contain:

  • Source code
  • Method description
  • Citation (if method is existing) or a submitted paper (if the method is original)

Important dates:

  • Competition opens:                            1 Dec 2018
  • Deadline for algorithm submissions:   15 April 2019
  • Deadline for manuscript submissions: 31 May 2019
  • Final results                                        21 June 2019

Evaluation:

All submissions will be evaluated on a different test dataset, which will be similar to the training set but larger. The resulting segment averages will be compared with ground truth extracted from OpenStreetMap. The main criteria in the competition will be quality. The evaluation will be done by visual inspection and an objective measure that will be revealed later. Trajectory similarity will also be calculated using other measures (DTW, Hausdorff, and Frechet) to gain more insight. Secondary criteria will be the speed and simplicity of the algorithm. We will evaluate all methods by running them on the same Dell R920 machine with 4 x E7-4860 (total 48 cores), 1 TB, and 4 TB SAS HD.

Results:

Results will be published on the competition website by 21 June 2019, latest. Intermediate results on the training data will be available already during the competition immediately after every upload. We will provide the following outcomes from the competition:

  • Two ranking lists: quality and speed (quality <10% worse than that of the winner)
  • Results will be fully documented and published later as a paper
  • All test data will also be published
  • The winner will be invited to visit the Machine Learning group at UEF. We cover reasonable travel and accommodation expenses, and provide VIP treatment during the visit

Competition web site:

http://cs.uef.fi/sipu/segments/

Prof. Dr. Pasi Fränti
Dr. Radu Mariescu-Istodor
Guest Editors

References:

  1. Ahmed, S. Karagiorgou, D. Pfoser, and C. Wenk. 2015. "A Comparison and Evaluation of Map Construction Algorithms". GeoInformatica, 19 (3), pp. 601-632.
  2. Biagioni and J. Eriksson. 2012. "Inferring road maps from global positioning system traces: Survey and comparative evaluation". Transportation Research Record: Journal of the Transportation Research Board, (2291), pp. 61-71.
  3. Mariescu-Istodor and P. Fränti, "Grid-based method for GPS route analysis for retrieval" ACM Transactions on Spatial Algorithms and Systems 3 (3), July 2017.
  4. Mariescu-Istodor and P. Fränti. "Cellnet: Inferring road networks from gps trajectories." ACM Transactions on Spatial Algorithms and Systems 4, no. 3 (2018): 8.

 

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • GPS
  • trajectory
  • segments
  • averaging
  • road network

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

11 pages, 9719 KiB  
Article
Estimating Road Segments Using Natural Point Correspondences of GPS Trajectories
by Artem Leichter and Martin Werner
Appl. Sci. 2019, 9(20), 4255; https://doi.org/10.3390/app9204255 - 11 Oct 2019
Cited by 3 | Viewed by 1778
Abstract
This work proposes a fast and straightforward method, called natural point correspondences (NaPoCo), for the extraction of road segment shapes from trajectories of vehicles. The algorithm can be expressed with 20 lines of code in Python and can be used as a baseline [...] Read more.
This work proposes a fast and straightforward method, called natural point correspondences (NaPoCo), for the extraction of road segment shapes from trajectories of vehicles. The algorithm can be expressed with 20 lines of code in Python and can be used as a baseline for further extensions or as a heuristic initialization for more complex algorithms. In this paper, we evaluate the performance of the proposed method. We show that (1) the order of the points in a trajectory can be used to cluster points among the trajectories for road segment shape extraction and (2) that preprocessing using polygonal approximation improves the results of the approach. Furthermore, we show based on “averaging GPS segments” competition results, that the algorithm despite its simplicity and low computational complexity achieves state-of-the-art performance on the challenge dataset, which is composed of data from several cities and countries. Full article
(This article belongs to the Special Issue Averaging GPS Segments)
Show Figures

Figure 1

13 pages, 624 KiB  
Article
Estimating Road Segments Using Kernelized Averaging of GPS Trajectories
by Pierre-François Marteau
Appl. Sci. 2019, 9(13), 2736; https://doi.org/10.3390/app9132736 - 06 Jul 2019
Cited by 8 | Viewed by 2627
Abstract
A method called iTEKA, which stands for iterative time elastic kernel averaging, was successfully used for averaging time series. In this paper, we adapt it to GPS trajectories. The key contribution is a denoising procedure that includes an over-sampling scheme, the detection and [...] Read more.
A method called iTEKA, which stands for iterative time elastic kernel averaging, was successfully used for averaging time series. In this paper, we adapt it to GPS trajectories. The key contribution is a denoising procedure that includes an over-sampling scheme, the detection and removal of outlier trajectories, a kernelized time elastic averaging method, and a down-sampling as post-processing. The experiment carried out on benchmark datasets showed that the proposed procedure is effective and outperforms straightforward methods based on medoid or Euclidean averaging approaches. Full article
(This article belongs to the Special Issue Averaging GPS Segments)
Show Figures

Figure 1

Back to TopTop