Trajectory similarity measures
Authors:
Open Access
- 20 May 2015
- journal article
- Published by Association for Computing Machinery (ACM) in SIGSPATIAL Special
- Vol. 7 (1) , 43-50
Abstract
Storing, querying, and analyzing trajectories is becoming increasingly important, as the availability and volumes of trajectory data increases. One important class of trajectory analysis is computing trajectory similarity. This paper introduces and compares four of the most common measures of trajectory similarity: longest common subsequence (LCSS), Fréchet distance, dynamic time warping (DTW), and edit distance. These four measures have been implemented in a new open source R package, freely available on CRAN [19]. The paper highlights some of the differences between these four similarity measures, using real trajectory data, in addition to indicating some of the important emerging applications for measurement of trajectory similarity.Keywords
This publication has 18 references indexed in Scilit:
- How fast is a cow? Cross‐Scale Analysis of Movement DataTransactions in GIS, 2011
- Computational Movement Analysis2011
- A trajectory-based analysis of coordinated team activity in a basketball gameComputer Vision and Image Understanding, 2009
- Detecting Commuting Patterns by Clustering SubtrajectoriesLecture Notes in Computer Science, 2008
- Movement Patterns in Spatio‐temporal Data2008
- Exact indexing of dynamic time warpingKnowledge and Information Systems, 2005
- On The Marriage of Lp-norms and Edit Distance2004
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVESInternational Journal of Computational Geometry & Applications, 1995
- Fast subsequence matching in time-series databasesACM SIGMOD Record, 1994
- Sur quelques points du calcul fonctionnelRendiconti del Circolo Matematico di Palermo Series 2, 1906