Geopth: A Lightweight Approach To Category-based Trajectory Retrieval Via Geometric Prototype Trajectory Hashing
2025 · Yang Xu, Zuliang Yang, Kai Ming Ting
Abstract
Trajectory similarity retrieval is an important part of spatiotemporal data mining, however, existing methods have the following limitations: traditional metrics are computationally expensive, while learning-based methods suffer from substantial training costs and potential instability. This paper addresses these problems by proposing Geometric Prototype Trajectory Hashing (GeoPTH), a novel, lightweight, and non-learning framework for efficient category-based trajectory retrieval. GeoPTH constructs data-dependent hash functions by using representative trajectory prototypes, i.e., small point sets preserving geometric characteristics, as anchors. The hashing process is efficient, which involves mapping a new trajectory to its closest prototype via a robust, Hausdorff metric. Extensive experiments show that GeoPTH's retrieval accuracy is highly competitive with both traditional metrics and state-of-the-art learning methods, and it significantly outperforms binary codes generated through
Authors
(none)
Tags
Stats
Related papers
- Towards Robust Trajectory Embedding For Similarity Computation: When Triangle Inequality Violations In Distance Metrics Matter (2025)0.00
- A Practical Index Structure Supporting Fr\'echet Proximity Queries Among Trajectories (2020)6.34
- Simple Distances For Trajectories Via Landmarks (2018)4.52
- Fedhap: Federated Hashing With Global Prototypes For Cross-silo Retrieval (2022)7.81
- Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index For Knn And Range Queries (2024)0.00
- Pseudo: Interactive Pattern Search In Multivariate Time Series With Locality-sensitive Hashing And Relevance Feedback (2021)8.09
- Metric-learning Based Deep Hashing Network For Content Based Retrieval Of Remote Sensing Images (2019)13.93
- Contrast & Compress: Learning Lightweight Embeddings For Short Trajectories (2025)0.00