Cited By
View all- Tang BYiu MMouratidis KZhang JWang K(2021)On discovering motifs and frequent patterns in spatial trajectories with discrete Fréchet distanceGeoInformatica10.1007/s10707-021-00438-xOnline publication date: 26-Jun-2021
Multi-level filtering to retrieve similar trajectories under the Fréchet distance
Authors: 
Hong Wei, Riccardo Fellegara, Yin Wang, Leila De Floriani, 
Hanan SametAuthors Info & Claims
Hong Wei, Riccardo Fellegara, Yin Wang, Leila De Floriani, Hanan SametAuthors Info & ClaimsPages 600 - 603
Abstract
Computing with trajectories has become an important and practical research topic. In many scenarios, the goal is to find similar trajectories. The Fréchet distance is a very promising metric for measuring trajectory similarity and yet limited in practical applications due to its expensive computing complexity. In this paper, we demonstrate an efcicient approach to retrieve similar trajectories using the Fréchet distance. Essentially, the proposed method builds up a set of R-trees for indexing trajectories and thereby enables multi-level of positive and negative filtering to speed up the similarity queries. For answering 5,000 queries on a dataset of 20,000 trajectories, the experimental results show that the proposed method achieves significant speedups at certain filtering levels while maintaining very high precision and recall in retrieving similar trajectories.
References
[1]
J. Sankaranarayanan, H. Samet, and H. Alborzi. Path Oracles for Spatial Networks. PVLDB '09.
[2]
S. Nutanong and H. Samet. Memory-efficient algorithms for spatial network queries. ICDE '13.
[3]
S. Peng and H. Samet. CDO: Extremely High-throughput Road Distance Computations on City Road Networks. SIGSPATIAL '16.
[4]
J. Sankaranarayanan, H. Alborzi, and H. Samet. Efficient Query Processing on Spatial Networks. SIGSPATIAL '05.
[5]
J. Sankaranarayanan and H. Samet. Distance Oracles for Spatial Networks. ICDE '09.
[6]
J. Sankaranarayanan and H. Samet. Query Processing Using Distance Oracles for Spatial Networks. TKDE '10.
[7]
J. Sankaranarayanan and H. Samet. Roads Belong in Databases. IEEE Data Eng. Bull., 33:4--11, 2010.
[8]
S. Peng, H. Wei, H. Li, and H. Samet. Simplification and Refinement for Speedy Spatio-temporal Hot Spot Detection Using Spark. SIGSPATIAL '16.
[9]
E. H. Jacox and H. Samet. Metric Space Similarity Joins. TODS '08.
[10]
S. Nutanong, E. H. Jacox, and H. Samet. An Incremental Hausdorff Distance Calculation Algorithm. PVLDB '11.
[11]
J. Sankaranarayanan, H. Alborzi, and H. Samet. Distance Join Queries on Spatial Networks. SIGSPATIAL '06.
[12]
P. C. Besse, B. Guillouet, J. M. Loubes, and F. Royer. Review and Perspective for Distance-Based Clustering of Vehicle Trajectories. IEEE TITS '16.
[13]
F. Hausdorff. Grundzuge der Mengenlehre. 1914.
[14]
M. Fréchet. Sur quelques points de calcul fonctionnel. 1914.
[15]
D. J. Berndt and J. Clifford. Using Dynamic Time Warping to Find Patterns in Time Series. AAAIWS '94.
[16]
H. Alt, A. Efrat, G. Rote, and C. Wenk. Matching Planar Maps. J. Algorithms, 49 (2):262--283, 2003.
[17]
S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk. On Map-matching Vehicle Tracking Data. PVLDB '05.
[18]
H. Wei, Y. Wang, G. Forman, and Y. Zhu. Map Matching: Comparison of Approaches Using Sparse and Noisy Data. SIGSPATIAL'13.
[19]
H. Alt and M. Godau. Computing The Fréchet Distance Between Two Polygonal Curves. Int. J. Comput. Geom. Appl., 05(1-2):75--91, 1995.
[20]
T. Eiter and H. Mannila. Computing discrete Fréchet distance. Technical report, Technische Universitat Wie, 1994.
[21]
K. Buchin, M. Buchin, and Y. Wang. Exact Algorithms for Partial Curve Matching via the Fréchet Distance. SODA '09.
[22]
K. Bringmann. Why Walking the Dog Takes Time: Fréchet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. FOCS '14.
[23]
K. Bringmann and W. Mulzer. Approximability of the Discrete Fréchet Distance. SoCG '15.
[24]
A. Driemel, S. Har-Peled, and C. Wenk. Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. SoCG '10.
[25]
E. W. Chambers, E. Colin De Verdière, J. Erickson, S. Lazard, F. Lazarus, and S. Thite. Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time. SoCG '08.
[26]
A. F. Cook Iv and C. Wenk. Geodesic Fréchet Distance With Polygonal Obstacles. Technical report, 2008.
[27]
J. Baldus and K. Bringmann. A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup). SIGSPATIAL'17.
[28]
K. Buchin, Y. Diez, T. van Diggelen, and W. Meulemans. Efficient Trajectory Queries Under the Fréchet Distance (GIS Cup). SIGSPATIAL'17.
[29]
F. Dütsch and J. Vahrenhold. A Filter-and-Refinement-Algorithm for Range Queries Based on the Fréchet Distance (GIS Cup). SIGSPATIAL'17.
[30]
A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. SIGMOD '84.
[31]
J. Baldus and K. Bringmann. A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup). SIGSPATIAL'17.
[32]
F. Brabec and H. Samet. Client-Based Spatial Browsing on the World Wide Web. IEEE Internet Computing, 11(1):52--59, 2007.
[33]
C. Esperança and H. Samet. Experience with SAND-Tcl: A Scripting Tool for Spatial Databases. DG.O '00.
[34]
H. Samet, H. Alborzi, F. Brabec, C. Esperança, G. R. Hjaltason, F. Morgan, and E. Tanin. Use of the SAND Spatial Browser for Digital Government Applications. Commun. ACM, 46(1):61--64, 2003.
Index Terms
- Multi-level filtering to retrieve similar trajectories under the Fréchet distance
Recommendations
Optimized Discrete Fréchet Distance between trajectories
BigSpatial '17: Proceedings of the 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial DataDistance 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 ...
Efficient trajectory queries under the Fréchet distance (GIS Cup)
SIGSPATIAL '17: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsConsider a set P of trajectories (polygonal lines in R2), and a query given by a trajectory Q and a threshold ϵ > 0. To answer the query we wish to find all trajectories P ∈ P such that δF(P, Q) ≤ ϵ, where δF denotes the Fréchet distance. We present an ...
Fréchet distance between two point sets
AbstractWe define and study the Fréchet distance and the discrete Fréchet distance between two point sets in the plane. One problem based on the well-known Fréchet distance is to find a polygonal curve on a point set with small Fréchet ...
Comments
Information & Contributors
Information
Published In
November 2018
655 pages
ISBN:9781450358897
DOI:10.1145/3274895
- General Chairs:
- Farnoush Banaei-Kashani,
- Erik Hoel,
- Program Chairs:
- Ralf Hartmut Güting,
- Roberto Tamassia,
- Li Xiong
Copyright © 2018 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 November 2018
Check for updates
Author Tags
Qualifiers
- Demonstration
Funding Sources
Conference
SIGSPATIAL '18
Sponsor:
SIGSPATIAL '18: 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 6 - 9, 2018
Washington, Seattle
Acceptance Rates
SIGSPATIAL '18 Paper Acceptance Rate 30 of 150 submissions, 20%;
Overall Acceptance Rate 220 of 1,116 submissions, 20%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 266Total Downloads
- Downloads (Last 12 months)32
- Downloads (Last 6 weeks)5
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
Cited By
View all- Tang BYiu MMouratidis KZhang JWang K(2021)On discovering motifs and frequent patterns in spatial trajectories with discrete Fréchet distanceGeoInformatica10.1007/s10707-021-00438-xOnline publication date: 26-Jun-2021
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in