Robust and fast similarity search for moving object trajectories
University of Waterloo · New Jersey Institute of Technology
Abstract
An important consideration in similarity-based retrieval of moving object trajectories is the definition of a distance function. The existing distance functions are usually sensitive to noise, shifts and scaling of data that commonly occur due to sensor failures, errors in detection techniques, disturbance signals, and different sampling rates. Cleaning data to eliminate these is not always possible. In this paper, we introduce a novel distance function, Edit Distance on Real sequence (EDR) which is robust against these data imperfections. Analysis and comparison of EDR with other popular distance functions, such as Euclidean distance, Dynamic Time Warping (DTW), Edit distance with Real Penalty (ERP), and…
Citation impact
- FWCI
- 25.60
- Percentile
- 100%
- References
- 49
Authors
3Topics & keywords
- Euclidean distance
- Dynamic time warping
- Similarity (geometry)
- Edit distance
- Pruning
- Computer science
- Nearest neighbor search
- Artificial intelligence