Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Aggregation and comparison of trajectories
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Shape-Based Similarity Query for Trajectory of Mobile Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Similarity Search for Multidimensional Data Sequences
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Rotation invariant distance measures for trajectories
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On map-matching vehicle tracking data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing large human-motion databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Similarity measures for trajectory of moving objects in cellular space
Proceedings of the 2009 ACM symposium on Applied Computing
Exploring movement-similarity analysis of moving objects
SIGSPATIAL Special
Efficient mutual nearest neighbor query processing for moving object trajectories
Information Sciences: an International Journal
NNCluster: an efficient clustering algorithm for road network trajectories
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Efficient identification and approximation of k-nearest moving neighbors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.01 |
An interesting issue in moving object databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with time dimension) of moving objects, rather than spatial shapes (trajectories without time dimension) of their trajectories. In this paper we propose a simple and effective way to compare spatial shapes of moving object trajectories. We introduce a new distance function based on "one way distance" (OWD). Algorithms for evaluating OWD in both continuous (piece wise linear) and discrete (grid representation) cases are developed. An index structure for OWD in grid representation, which guarantees no false dismissals, is also given to improve the efficiency of similarity search. Empirical studies show that OWD out-performs existent methods not only in precision, but also in efficiency. And the results of OWD in continuous case can be approximated by discrete case efficiently.