ABSTRACT
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.
- G. Barequet, D. Z. Chen, O. Daescu, M. T. Goodrich, and J. Snoeyink. Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica, 33:150--167, 2002.Google ScholarDigital Library
- F. I. Bashir, A. A. Khokhar and D. Schonfeld. Segmented trajectory based indexing and retrieval of video data. In Proc. Int. Conf. on Image Processing (ICIP (2)) 623--626, 2003.Google ScholarCross Ref
- M. Benkert, J. Gudmundsson, F. Hübner and T. Wolle. Reporting flock patterns. In Proc. 14th Annu. Europ. Symp. on Algorithms (ESA'06), LNCS 4168:660--671, 2006. Google ScholarDigital Library
- T. Bernholt, F. Eisenbrand, and T. Hofmeister. A geometric framework for solving subsequence problems in computational biology efficiently. In Proc. 23rd ACM Symp. on Comput. Geom. (SOCG'07), 310--318, 2007. Google ScholarDigital Library
- H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. The VLDB Journal, 15:211--228, 2006. Google ScholarDigital Library
- K.-M. Chung and H.-I. Lu. An optimal algorithm for the maximum-density segment problem. SIAM J. Comput., 34:373--387, 2005. Google ScholarDigital Library
- R. M. Dudley. Metric entropy of some classes of sets with differentiable boundaries. J. Approximation Theory, 10:227--236, 1974.Google ScholarCross Ref
- Z. Fu, W. Hu and T. Tan. Similarity Based Vehicle Trajectory Clustering and Anomaly Detection. In Proc. Int. Conf. on Image Processing (ICIP'05), 2:602--605, 2005.Google Scholar
- M. H. Goldwasser, M.-Y. Kao, and H.-I. Lu. Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. J. Comput. Syst. Sci., 70:128--144, 2005. Google ScholarDigital Library
- J. Gudmundsson, J. Katajainen, D. Merrick, C. Ong, and T. Wolle. Compressing spatio-temporal trajectories. In Proc. Int. Symp. on Algorithms and Computation (ISAAC'07), 763--775, 2007. Google ScholarDigital Library
- J. Gudmundsson and M. van Kreveld. Computing longest duration flocks in trajectory data. In Proc. 14th ACM Int. Symp. on Advances in Geographic Information Systems, 35--24, 2006. Google ScholarDigital Library
- D. Halperin. Arrangements. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 389--412, CRC Press, 2nd edition, 2004. Google ScholarDigital Library
- I. Junejo, O. Javed and M. Shah. Multi Feature Path Modeling for Video Surveillance. In Proc. 17th Int. Conf. on Pattern Recognition (ICPR'04), 7:716--719, 2004. Google ScholarDigital Library
- E. J. Keogh and M. J. Pazzani. Scaling up Dynamic Time Warping for Datamining Applications. In Proc. 4th Asia-Pacific Conf. on Knowledge Discovery and Data Mining (PADKK), 285--289, 2000. Google ScholarDigital Library
- M. van Kreveld and J. Luo. The definition and computation of trajectory and subtrajectory similarity. In Proc. 15th ACM Int. Symp. on Geographic Information Systems (ACM-GIS'07), 44--47, 2007. Google ScholarDigital Library
- P. Laube and S. Imfeld. Analyzing relative motion within groups of trackable moving point objects. In Proc. 2nd Int. Conf. on Geographic Information Science, LNCS 2478:132--144, 2002. Google ScholarDigital Library
- P. Laube, M. van Kreveld and S. Imfeld. Finding REMO-detecting relative motion patterns in geospatial lifelines. In Proc. 11th Int. Symp. on Spatial Data Handling, 201--214, 2004.Google Scholar
- T. Warren Liao. Clustering of time series data--a survey. In Pattern Recognition, 38: 1857--1874, 2005. Google ScholarDigital Library
- Y.-L. Lin, T. Jiang, and K.-M. Chao. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci., 65:570--586, 2002. Google ScholarDigital Library
- J. Lou, Q. Liu, T. Tan and W. Hu. Semantic interpretation of object activities in a surveillance system. In Proc. 16th Int. Conf. on Pattern Recognition (ICPR'02), 3:777--780, 2002. Google ScholarDigital Library
- M. Nanni and D. Pedreschi. Time-focused density-based clustering of trajectories of moving objects. In Proc. 18th Int. Conf. on Data Engineering (ICDE'02), 285--289, 2002. Google ScholarDigital Library
- F. M. Porikli and T. Haga. Event detection by eigenvector decomposition using object and frame features. In Proc. Computer Vision and Pattern Recognition Workshop (CVPRW'04), 7:114--121, 2004. Google ScholarDigital Library
- Y. Sakurai, M. Yoshikawa and C. Faloutsos. FTW: fast similarity search under the time warping distance. In Proc. 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of database systems (PODS'05), 326--337, 2005. Google ScholarDigital Library
- G. Sinha and D. M. Mark. Measuring similarity between geospatial lifelines in studies of environment health. J. Geographical Systems, 7:115--136, 2005.Google ScholarCross Ref
- G. Trajcevski, H. Ding, P. Scheuermann, R. Tamassia, and D. Vaccaro. Dynamics-aware similarity of moving objects trajectories. In Proc. 15th ACM Int. Symp. on Geographic Information Systems (ACM-GIS'07), 1--8, 2007. Google ScholarDigital Library
- M. Vlachos, G. Kollios and D. Gunopulous. Discovering similar multidimensional trajectories. J. Intelligent Information Systems, 27:267--289, 2006.Google Scholar
- M. Vlachos, D. Gunopulous and G. Kollios. Robust similarity measures for mobile object trajectories. In Proc. 13th Int. Workshop on Database and Expert Systems Applications (DEXA'02), 721--726, 2002. Google ScholarDigital Library
- M. Vlachos, G. Kollios and D. Gunopulous. Elastic translation invariant matching of trajectories. Machine Learning, 58:301--334, 2005. Google ScholarDigital Library
- Y. Yanagisawa, J. Akahani and T. Satoh. Shape-based similarity query for trajectory of mobile objects. In Proc. 4th Int. Conf. on Mobile Data Management (MDM'03), 63--77, 2003. Google ScholarDigital Library
Index Terms
Finding long and similar parts of trajectories
Recommendations
Finding long and similar parts of trajectories
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 ...
Searching similar trajectories in real time: an effectiveness and efficiency study
WAIM'11: Proceedings of the 2011 international conference on Web-Age Information ManagementSearching similar trajectories in real time has been a challenging task in a large variety of location-aware applications. This paper addresses its two key issues, i.e. evaluating the similarity between two trajectories reasonably and effectively, and ...
Multi-level filtering to retrieve similar trajectories under the Fréchet distance
SIGSPATIAL '18: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsComputing with trajectories has become an important and practical research topic. In many scenarios, the goal is to find similar trajectories. The Fréchet distance is a very promising metric for measuring trajectory similarity and yet limited in ...
Comments