Advertisement

The Prefix Fréchet Similarity

  • Christian SchefferEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11355)

Abstract

We present the prefix Fréchet similarity as a new measure for similarity of curves which is e.g. motivated by evacuation analysis and defined as follows. Given two (polygonal) curves T and \(T'\), we ask for two prefix curves of T and \(T'\) which have a Fréchet distance no larger than a given distance threshold \(\delta \ge 0\) w.r.t. \(L_1\) metric such that the sum of the prefix curves is maximal. As parameterized Fréchet measures as, e.g., the prefix Fréchet similarity are highly unstable w.r.t. to the value of the distance threshold \(\delta \), we give an algorithm that computes exactly the profile of the prefix Fréchet similarity, i.e., the complete functional relation between \(\delta \) and the prefix Fréchet similarity of T and \(T'\). This is the first efficient algorithm for computing exactly the whole profile of a parametrized Fréchet distance.

While the running time of our algorithm for computing the profile of the prefix Fréchet similarity is \(\mathcal {O}\left( n^3 \log n\right) \), we provide a lower bound of \(\varOmega (n^2)\) for the running time of each algorithm computing the profile of the prefix Fréchet similarity, where n denotes the number of segments on T and \(T'\). This implies that our running time is at most a near linear factor away from being optimal.

Keywords

Fréchet distance Prefix curves Curve matching 

References

  1. 1.
    Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75–91 (1995)CrossRefGoogle Scholar
  2. 2.
    Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30–September 2 2005, pp. 853–864 (2005)Google Scholar
  3. 3.
    Buchin, K., Buchin, M., Gudmundsson, J.: Detecting single file movement. In: Proceedings of 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, 5–7 November 2008, Irvine, California, USA, p. 33 (2008)Google Scholar
  4. 4.
    Buchin, K., Buchin, M., van Leusden, R., Meulemans, W., Mulzer, W.: Computing the Fréchet distance with a retractable leash. Discrete Comput. Geom. 56(2), 315–336 (2016)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fréchet distance. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4–6 January 2009, pp. 645–654 (2009)Google Scholar
  6. 6.
    Buchin, M.: On the computability of the Fréchet distance between triangulated surfaces. Ph.D. thesis, Department of Computer Science, Freie Universität, Berlin (2007)Google Scholar
  7. 7.
    Carufel, J.D., Gheibi, A., Maheshwari, A., Sack, J., Scheffer, C.: Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5), 625–641 (2014)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gheibi, A., Maheshwari, A., Sack, J., Scheffer, C.: Minimum backward Fréchet distance. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Dallas/Fort Worth, TX, USA, 4–7 November 2014, pp. 381–388 (2014)Google Scholar
  9. 9.
    Gudmundsson, J., Wolle, T.: Football analysis using spatio-temporal tools. Comput. Environ. Urban Syst. 47, 16–27 (2014)CrossRefGoogle Scholar
  10. 10.
    Keogh, E.J., Pazzani, M.J.: Scaling up dynamic time warping for datamining applications. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, 20–23 August 2000, pp. 285–289 (2000)Google Scholar
  11. 11.
    Kim, M., Kim, S., Shin, M.: Optimization of subsequence matching under time warping in time-series databases. In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, 13–17 March 2005, pp. 581–586 (2005)Google Scholar
  12. 12.
    Maheshwari, A., Sack, J., Scheffer, C.: Approximating the integral Fréchet distance. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, 22–24 June 2016, Reykjavik, Iceland, pp. 26:1–26:14 (2016)Google Scholar
  13. 13.
    Maheshwari, A., Sack, J., Shahbaz, K., Zarrabi-Zadeh, H.: Fréchet distance with speed limits. Comput. Geom. 44(2), 110–120 (2011)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Maheshwari, A., Sack, J., Shahbaz, K., Zarrabi-Zadeh, H.: Improved algorithms for partial curve matching. Algorithmica 69(3), 641–657 (2014)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Scheffer, C.: More flexible curve matching via the partial Fréchet similarity. Int. J. Comput. Geom. Appl. 26(1), 33–52 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceTU BraunschweigBraunschweigGermany

Personalised recommendations