Optimized Discrete Fréchet Distance between trajectories - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Optimized Discrete Fréchet Distance between trajectories

Maxence Esnault
  • Fonction : Auteur
Florian Lardy
  • Fonction : Auteur

Résumé

Distance computation between polylines or trajectories is a key point to assess similarity between geometrical objects. This paper describes a new optimized algorithm to compute discrete Fréchet distance which aims to lower computation time and improve precision. This algorithm is applied to GPS trajectories. It includes a filtering, pruning and an enhancement process. Thanks to this algorithm, big data trajectory repositories can be mined. This process is validated on a large trajectory dataset.
Fichier non déposé

Dates et versions

hal-01631192 , version 1 (08-11-2017)

Identifiants

Citer

Thomas Devogele, Laurent Etienne, Maxence Esnault, Florian Lardy. Optimized Discrete Fréchet Distance between trajectories. 6th ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, Nov 2017, Redondo Beach, United States. 9 p., ⟨10.1145/3150919.3150924⟩. ⟨hal-01631192⟩
194 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More