Handbook of discrete and computational geometry
Scaling up dynamic time warping for datamining applications
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Journal of Computer and System Sciences - Computational biology 2002
Robust Similarity Measures for Mobile Object Trajectories
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Analyzing Relative Motion within Groups of Trackable Moving Point Objects
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Shape-Based Similarity Query for Trajectory of Mobile Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Semantic Interpretation of Object Activities in a Surveillance System
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Multi Feature Path Modeling for Video Surveillance
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Event Detection by Eigenvector Decomposition Using Object and Frame Features
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 7 - Volume 07
An Optimal Algorithm for the Maximum-Density Segment Problem
SIAM Journal on Computing
Elastic Translation Invariant Matching of Trajectories
Machine Learning
Journal of Computer and System Sciences
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Spatio-temporal data reduction with deterministic error bounds
The VLDB Journal — The International Journal on Very Large Data Bases
Time-focused clustering of trajectories of moving objects
Journal of Intelligent Information Systems
Computing longest duration flocks in trajectory data
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
A geometric framework for solving subsequence problems in computational biology efficiently
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Dynamics-aware similarity of moving objects trajectories
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
The definition and computation of trajectory and subtrajectory similarity
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Clustering of time series data-a survey
Pattern Recognition
Compressing spatio-temporal trajectories
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Clustering vessel trajectories with alignment kernels under trajectory compression
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Machine learning for vessel trajectories using compression, alignments and domain knowledge
Expert Systems with Applications: An International Journal
Mining multi-object spatial-temporal movement patterns
SIGSPATIAL Special
| Hi-index | 0.00 |
A natural time-dependent similarity measure for two trajectories is their average distance at corresponding times. We give algorithms for computing the most similar subtrajectories under this measure, assuming the two trajectories are given as two polygonal, possibly self-intersecting lines. When a minimum duration is specified for the subtrajectories, and they must start at exactly corresponding times in the input trajectories, we give a linear-time algorithm for computing the starting time and duration of the most similar subtrajectories. The algorithm is based on a result of independent interest: We present a linear-time algorithm to find, for a piece-wise monotone function, an interval of at least a given length that has minimum average value. When the two subtrajectories can start at different times in the two input trajectories, it appears difficult to give an exact algorithm for the most similar subtrajectories problem, even if the duration of the desired two subtrajectories is fixed to some length. We show that the problem can be solved approximately, and with a performance guarantee. More precisely, we present (1 + ε)-approximation algorithms for computing the most similar subtrajectories of two input trajectories for the case where the duration is specified, and also for the case where only a minimum on the duration is specified.