Clustering Trajectories for Map Construction
Publication date
2017-11-01
Editors
Hoel, Erik
Newsam, Shawn
Ravada, Siva
Tamassia, Roberto
Trajcevski, Goce
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
taverne
Abstract
We propose a new approach for constructing the underlying map from trajectory data. Our algorithm is based on the idea that road segments can be identified as stable subtrajectory clusters in the data. For this, we consider how subtrajectory clusters evolve for varying distance values, and choose stable values for these. In doing so we avoid a global proximity parameter. Within trajectory clusters, we choose representatives, which are combined to form the map. We experimentally evaluate our algorithm on vehicle and hiking tracking data. These experiments demonstrate that our approach can naturally separate roads that run close to each other and can deal with outliers in the data, two issues that are notoriously difficult in road network reconstruction.
Keywords
Trajectories, map construction, clustering, geometric algorithms, Taverne
Citation
Buchin, K, Buchin, M, Duran, D, Fasy, B, Jacobs, R, Sacristán, V, Silveira, R I, Staals, F & Wenk, C 2017, Clustering Trajectories for Map Construction. in E Hoel, S Newsam, S Ravada, R Tamassia & G Trajcevski (eds), SIGSPATIAL '17 : Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. Association for Computing Machinery, New York, pp. 1-10. https://doi.org/10.1145/3139958.3139964