Dynamics-aware similarity of moving objects trajectories
- 7 November 2007
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (location, time) points describing the motion of individual objects, however, they also implicitly storethe velocity -- an important attribute describing the dynamics the motion. Our main goal is to extend the MOD capability with reasoning about how similar are the trajectories of objects, possibly moving along geographically different routes. We use a distance function which balances the lack of temporal-awareness of the Hausdorff distance with the generality (and complexity of calculation) of the Fréchet distance. Based on the observation that in practice the individual segments of trajectories are assumed to have constant speed, we provide efficient algorithms for: (1) optimal matching between trajectories; and (2) approximate matching between trajectories, both under translations and rotations, where the approximate algorithm guarantees a bounded error with respect to the optimal one.Keywords
Funding Information
- Northrop Grumman (P.O.8200082518)
- Division of Information and Intelligent Systems (IIS-0325144/003, IIS-0324846)
This publication has 18 references indexed in Scilit:
- Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between CurvesJournal of Mathematical Imaging and Vision, 2006
- Spatio-temporal data reduction with deterministic error boundsThe VLDB Journal, 2006
- Modeling and querying moving objects in networksThe VLDB Journal, 2005
- Indexing Multidimensional Time-SeriesThe VLDB Journal, 2005
- Elastic Translation Invariant Matching of TrajectoriesMachine Learning, 2005
- Managing uncertainty in moving objects databasesACM Transactions on Database Systems, 2004
- Comparison of Distance Measures for Planar CurvesAlgorithmica, 2003
- Matching planar mapsJournal of Algorithms, 2003
- Approximate geometric pattern matching under rigid motionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991