fr chet distance between uncertain trajectories
play

Frchet Distance Between Uncertain Trajectories Computing Expected - PowerPoint PPT Presentation

Jan 07, 2024 •103 likes •605 views

Frchet Distance Between Uncertain Trajectories Computing Expected Value and Upper Bound Kevin Buchin 1 Maarten Lffler 2 Aleksandr Popov 1 Marcel Roeloffzen 1 1 Department of Mathematics and Computer Science Eindhoven University of Technology 2

  1. Fréchet Distance Between Uncertain Trajectories Computing Expected Value and Upper Bound Kevin Buchin 1 Maarten Löffler 2 Aleksandr Popov 1 Marcel Roeloffzen 1 1 Department of Mathematics and Computer Science Eindhoven University of Technology 2 Department of Information and Computing Sciences Utrecht University 16th March 2020

  2. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  3. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  4. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  5. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  6. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  7. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  8. Why (uncertain) trajectories? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 2 / 15

  9. Uncertain trajectories Measurement uncertainty, regions connected with line segments. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 3 / 15

  10. Uncertain trajectories Measurement uncertainty, regions connected with line segments. Indecisive point: ℓ options per point ℓ = 3 K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 3 / 15

  11. Uncertain trajectories Measurement uncertainty, regions connected with line segments. Indecisive point: Imprecise point: ℓ options per point Connected region ℓ = 3 circle K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 3 / 15

  12. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  13. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  14. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  15. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  16. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  17. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  18. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  19. Similarity measures Discrete Fréchet distance and continuous Fréchet distance: K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 4 / 15

  20. Fréchet distance on uncertain trajectories Lower bound? Upper bound? Expected value? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 5 / 15

  21. Fréchet distance on uncertain trajectories Lower bound? Upper bound? Expected value? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 5 / 15

  22. Fréchet distance on uncertain trajectories Lower bound? Upper bound? Expected value? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 5 / 15

  23. Fréchet distance on uncertain trajectories Lower bound? Upper bound? Expected value? K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 5 / 15

  24. Overview imprecise indecisive disks line segments LB Polynomial* Polynomial* Polynomial* discrete FD UB NP-complete NP-complete NP-complete Exp #P-hard — #P-hard Polynomial † NP-complete † LB — FD UB NP-complete NP-complete NP-complete Exp #P-hard — — * Ahn et al., 2012. † Joint work with Fan and Raichel, submitted. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 6 / 15

  25. Overview imprecise indecisive disks line segments LB Polynomial* Polynomial* Polynomial* discrete FD UB NP-complete NP-complete NP-complete Exp #P-hard — #P-hard Polynomial † NP-complete † LB — FD UB NP-complete NP-complete NP-complete Exp #P-hard — — * Ahn et al., 2012. † Joint work with Fan and Raichel, submitted. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 6 / 15

  26. Overview imprecise indecisive disks line segments LB Polynomial* Polynomial* Polynomial* discrete FD UB NP-complete NP-complete NP-complete Exp #P-hard — #P-hard Polynomial † NP-complete † LB — FD UB NP-complete NP-complete NP-complete Exp #P-hard — — * Ahn et al., 2012. † Joint work with Fan and Raichel, submitted. Indecisive: Polynomial-time algorithms with time bands for all cases. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 6 / 15

  27. Hardness results K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 7 / 15

  28. Construction: Indecisive, discrete FD, upper bound ( 0 , 0 . 5 + ε) T Reduction from SAT. Two curves: ( 0 , 0 . 5 ) F ◮ Precise curve: formula structure; ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) N/A ( − 2 , 0 ) ( 2 , 0 ) ◮ Indecisive curve: ( 0 , − 0 . 5 ) T variable synchronisation synchronisation assignment. ( 0 , − 0 . 5 − ε) F x = 0 K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 8 / 15

  29. Construction: Indecisive, discrete FD, upper bound ( 0 , 0 . 5 + ε) T Reduction from SAT. Two curves: ( 0 , 0 . 5 ) F ◮ Precise curve: formula structure; ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) N/A ( − 2 , 0 ) ( 2 , 0 ) ◮ Indecisive curve: ( 0 , − 0 . 5 ) T variable synchronisation synchronisation assignment. ( 0 , − 0 . 5 − ε) F x = 0 K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 8 / 15

  30. Construction: Indecisive, discrete FD, upper bound ( 0 , 0 . 5 + ε) T Reduction from SAT. Two curves: ( 0 , 0 . 5 ) F ◮ Precise curve: formula structure; ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) N/A ( − 2 , 0 ) ( 2 , 0 ) ◮ Indecisive curve: ( 0 , − 0 . 5 ) T variable synchronisation synchronisation assignment. ( 0 , − 0 . 5 − ε) F x = 0 K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 8 / 15

  31. Construction: Indecisive, discrete FD, upper bound ( 0 , 0 . 5 + ε) T Reduction from SAT. Two curves: ( 0 , 0 . 5 ) F ◮ Precise curve: formula structure; ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) N/A ( − 2 , 0 ) ( 2 , 0 ) ◮ Indecisive curve: ( 0 , − 0 . 5 ) T variable synchronisation synchronisation assignment. ( 0 , − 0 . 5 − ε) F x = 0 K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 8 / 15

  32. Construction: example ( 0 , 0 . 5 + ε) ( 0 , 0 . 5 ) ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) ( − 2 , 0 ) ( 2 , 0 ) ( 0 , − 0 . 5 ) ( 0 , − 0 . 5 − ε) C = x 1 ∨ x 2 Realisation: x 1 = T, x 2 = F, x 3 = F. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 9 / 15

  33. Construction: example ( 0 , 0 . 5 + ε) ( 0 , 0 . 5 ) ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) ( − 2 , 0 ) ( 2 , 0 ) ( 0 , − 0 . 5 ) ( 0 , − 0 . 5 − ε) C = x 1 ∨ x 2 Realisation: x 1 = T, x 2 = F, x 3 = F. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 9 / 15

  34. Construction: example ( 0 , 0 . 5 + ε) ( 0 , 0 . 5 ) ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) ( − 2 , 0 ) ( 2 , 0 ) ( 0 , − 0 . 5 ) ( 0 , − 0 . 5 − ε) C = x 1 ∨ x 2 Realisation: x 1 = T, x 2 = F, x 3 = F. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 9 / 15

  35. Construction: example ( 0 , 0 . 5 + ε) ( 0 , 0 . 5 ) ( − 1 , 0 ) ( 0 , 0 ) ( 1 , 0 ) ( − 2 , 0 ) ( 2 , 0 ) ( 0 , − 0 . 5 ) ( 0 , − 0 . 5 − ε) C = x 1 ∨ x 2 Realisation: x 1 = T, x 2 = F, x 3 = F. K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 9 / 15

  36. Construction: Indecisive, discrete FD, upper bound C 1 C 2 C 3 C 4 C 5 1 + ε 1 1 1 1 1 1 1 1 1 V ( 0 , 0 ) ( 0 , 0 ) K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 10 / 15

  37. Construction: Indecisive, discrete FD, upper bound C 1 C 2 C 3 C 4 C 5 1 + ε 1 1 1 1 1 1 1 1 1 V ( 0 , 0 ) ( 0 , 0 ) C 4 = F K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 10 / 15

  38. Construction: Indecisive, discrete FD, upper bound C 1 C 2 C 3 C 4 C 5 1 + ε 1 1 1 1 1 1 1 1 1 V ( 0 , 0 ) ( 0 , 0 ) C i = T for all i K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 10 / 15

  39. Hardness results imprecise indecisive disks line segments UB NP-complete NP-complete NP-complete discrete FD Exp #P-hard — #P-hard UB NP-complete NP-complete NP-complete FD Exp #P-hard — — K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 11 / 15

  40. Algorithms using time bands K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 12 / 15

  41. Time bands: idea K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 13 / 15

  42. Time bands: idea K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 13 / 15

  43. Time bands: idea w = 1 K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 13 / 15

  44. Time bands: results Time band width w , indecisive trajectories with ℓ options, length n : K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 14 / 15

  45. Time bands: results Time band width w , indecisive trajectories with ℓ options, length n : ◮ UB dFD precise + indecisive: Θ ( 4 w ℓ n √ w ) ; K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 14 / 15

  46. Time bands: results Time band width w , indecisive trajectories with ℓ options, length n : ◮ UB dFD precise + indecisive: Θ ( 4 w ℓ n √ w ) ; ◮ UB dFD 2x indecisive: Θ ( 4 w ℓ 2 w n √ w ) ; K. Buchin, M. Löffler, A. Popov, M. Roeloffzen 14 / 15

Recommend

Uncertain Trajectories Best practices from start to finish Alex Mancini, Pan London Lead Nurse

Uncertain Trajectories Best practices from start to finish Alex Mancini, Pan London Lead Nurse

Uncertain Trajectories Best practices from start to finish Alex Mancini, Pan London Lead Nurse for Neonatal Palliative Singapore August 27th 2016 Nothing can prepare you for the death of a child It is vital that the staff who are caring

493 views • 25 slides
Learning Semantic Relationships of Geographical Areas Based on Trajectories Presenter: Saim

Learning Semantic Relationships of Geographical Areas Based on Trajectories Presenter: Saim

Learning Semantic Relationships of Geographical Areas Based on Trajectories Presenter: Saim Mehmood trajectories (, , ) (spatiotemporal information of moving objects) 2 Trajectory Data Mining discovering patterns in trajectories to

673 views • 55 slides
CHET F. HARRITT SCHOOL Learning Resource Center & Junior High Classroom Addition PRIDE

CHET F. HARRITT SCHOOL Learning Resource Center & Junior High Classroom Addition PRIDE

VISION MISSION Unlocking the potential of tomorrow by building Providing an extraordinary education in an inspiring confident, innovative learners today environment with caring people CHET F. HARRITT SCHOOL Learning Resource Center &

406 views • 7 slides
Research-based Learning Trajectories: What are they and how do you use them? Michelle

Research-based Learning Trajectories: What are they and how do you use them? Michelle

Research-based Learning Trajectories: What are they and how do you use them? Michelle Douglas-Meyer Nikki Hawkins Melissa Hedges Thursday, May Kern Hall Brayton Case B 2:30 p.m. 3:30 p.m . Agenda Introduce learning trajectories

681 views • 24 slides
CHET F. HARRITT SCHOOL Learning Resource Center & Junior High Classroom Addition BOND PROGRAM

CHET F. HARRITT SCHOOL Learning Resource Center & Junior High Classroom Addition BOND PROGRAM

VISION MISSION Unlocking the potential of tomorrow by building Providing an extraordinary education in an inspiring confident, innovative learners today environment with caring people CHET F. HARRITT SCHOOL Learning Resource Center &

478 views • 18 slides
Innovation and Technology Transfer Prof. Ilan Chet ac*a*dem*ic (ake-demik) adj.

Innovation and Technology Transfer Prof. Ilan Chet ac*a*dem*ic (ake-demik) adj.

Innovation and Technology Transfer Prof. Ilan Chet ac*a*dem*ic (ake-demik) adj. Interdisciplinary Science Academia-Industry Relationship Patents Universities Governmental Support Research Companies Institutes Death Valley Bridging

450 views • 23 slides
Uncertain< T > A First-Order Type for Uncertain Data James Bornholt Australian National

Uncertain< T > A First-Order Type for Uncertain Data James Bornholt Australian National

Uncertain< T > A First-Order Type for Uncertain Data James Bornholt Australian National University Todd Mytkowicz Microsoft Research Kathryn S. McKinley Microsoft Research Uncertain< T >: A First-Order Type for Uncertain Data 1 Location

373 views • 21 slides
Footprint-oriented generation of traffic trajectories using cellular phone data trajectories

Footprint-oriented generation of traffic trajectories using cellular phone data trajectories

Institute for Engineering Geodesy Footprint-oriented generation of traffic trajectories using cellular phone data trajectories using cellular phone data Geneva, 59 th May, Geospatial World Forum 2014 Shenghua Chen Institute of Engineering

596 views • 24 slides
CHILDRENS CABINET Representative Chet Pollert, Chair July 28, 2020

CHILDRENS CABINET Representative Chet Pollert, Chair July 28, 2020

CHILDRENS CABINET Representative Chet Pollert, Chair July 28, 2020 ______________________________________________________________________ Lisa Bjergaard, Chair Presented a report on the activities of the Juvenile Justice Commission

174 views • 4 slides
Uncertain Centroid based Partitional Clustering of Uncertain Data Francesco Gullo Andrea

Uncertain Centroid based Partitional Clustering of Uncertain Data Francesco Gullo Andrea

Overview State of the art Uncertain centroid based partitional clustering of UO Experimental evaluation Conclusions Uncertain Centroid based Partitional Clustering of Uncertain Data Francesco Gullo Andrea Tagarelli Yahoo! Research

616 views • 26 slides
for Young Adults trajectories of weight change in the Australian Longitudinal Study on Womens

for Young Adults trajectories of weight change in the Australian Longitudinal Study on Womens

Prof Wendy Brown 1/03/2019 National Obesity Summit, Canberra Outline 1. Overweight and obesity in Australian adults Changing Weight Gain Trajectories 2. Using data to inform prevention ideas - for Young Adults trajectories of weight change

369 views • 5 slides
ST Data-warehouse for trajectories Some preliminary ideas S. Orlando, R. Orsini, A. Raffaet,

ST Data-warehouse for trajectories Some preliminary ideas S. Orlando, R. Orsini, A. Raffaet,

ST Data-warehouse for trajectories Some preliminary ideas S. Orlando, R. Orsini, A. Raffaet, A. Roncato Requirements and Starting points Trajectories arrive in streams, as triples (ID, SpatialPos, TemporalPos) to insert information

349 views • 22 slides
TALPA ARC Matrix Validation An Industry Perspective Presented by Mr. Chet Collett, Manager

TALPA ARC Matrix Validation An Industry Perspective Presented by Mr. Chet Collett, Manager

TALPA ARC Matrix Validation An Industry Perspective Presented by Mr. Chet Collett, Manager Flight Standards Alaska Airlines 2011 International Winter Operations Conference October 5, 2011 Topics Takeoff And Landing Performance

773 views • 43 slides
Stochastic Models of an Uncertain World x = F ( x , u ) x = F ( x , u , 1 ) Lecture

Stochastic Models of an Uncertain World x = F ( x , u ) x = F ( x , u , 1 ) Lecture

Stochastic Models of an Uncertain World x = F ( x , u ) x = F ( x , u , 1 ) Lecture 9: y G ( x ) y G ( x , 2 ) = = Observers and Kalman Filters Actions are uncertain. CS 344R/393R: Robotics Observations are

228 views • 3 slides
Technical Updates E-Enterprise, Modeling Richard A. (Chet) Wayland US EPA OAQPS CENSARA Fall

Technical Updates E-Enterprise, Modeling Richard A. (Chet) Wayland US EPA OAQPS CENSARA Fall

Technical Updates E-Enterprise, Modeling Richard A. (Chet) Wayland US EPA OAQPS CENSARA Fall Meeting October 11, 2017 Topics E-Enterprise Air Quality Projects Appendix W Transport & Regional Haze 2014 NATA 2

653 views • 29 slides
Mark-recapture distance sampling (MRDS) in Distance 7.1 Setting up Distance for MRDS

Mark-recapture distance sampling (MRDS) in Distance 7.1 Setting up Distance for MRDS

Mark-recapture distance sampling (MRDS) in Distance 7.1 Setting up Distance for MRDS Setting up a Distance project for MRDS Data requirements MRDS analyses Setting up Distance You need a copy of R installed on your computer

364 views • 10 slides
JU JUNE NE EV EVEN ENTS TS June 4 & 5 - Chet Crites Skeet Shoot June 10, 11, & 12 -

JU JUNE NE EV EVEN ENTS TS June 4 & 5 - Chet Crites Skeet Shoot June 10, 11, & 12 -

JU JUNE NE EV EVEN ENTS TS June 4 & 5 - Chet Crites Skeet Shoot June 10, 11, & 12 - S.C.T.P. Kids June 17 th - 12 th Annual Golf & Clay Outing June 19 th - Sporting Clay Classification Shoot Ma Mark rk th the Da e Dates tes

407 views • 16 slides
Chapter 2, Part 2 2.4. Applications Orthogonal trajectories Exponential Growth/Decay

Chapter 2, Part 2 2.4. Applications Orthogonal trajectories Exponential Growth/Decay

Chapter 2, Part 2 2.4. Applications Orthogonal trajectories Exponential Growth/Decay Newtons Law of Cooling/Heating Limited Growth (Logistic Equation) Miscellaneous Models 1 2.4.1. Orthogonal Trajectories Example: Family of circles,

1.07k views • 70 slides
Revealing trajectories towards a sustainable energy future Introduction: Methodological Overview

Revealing trajectories towards a sustainable energy future Introduction: Methodological Overview

16 th IAEE European Conference, Ljubljana, Aug. 27, 2019 Revealing trajectories towards a sustainable energy future Introduction: Methodological Overview and Past Development Trajectories of the Icelandic Energy System: Lessons for the Future

252 views • 22 slides
The Maryland Healthcare Landscape Greater Baltimore Committee November 7, 2017 Chet Burrell

The Maryland Healthcare Landscape Greater Baltimore Committee November 7, 2017 Chet Burrell

The Maryland Healthcare Landscape Greater Baltimore Committee November 7, 2017 Chet Burrell President & CEO PROPRIETARY AND CONFIDENTIAL Median Household Income in Maryland Richest State in the Nation (Highest) Maryland: $76,596

648 views • 46 slides
Android UI Development: Tips, Tricks, and Techniques Romain Guy Chet Haase Android UI Toolkit

Android UI Development: Tips, Tricks, and Techniques Romain Guy Chet Haase Android UI Toolkit

Android UI Development: Tips, Tricks, and Techniques Romain Guy Chet Haase Android UI Toolkit Team Google Android UI Development: c i f i r r Tips, Tricks, and Techniques e T y l l a t o T Romain Guy Chet Haase Android UI

498 views • 38 slides
Clustering compositional data trajectories F. Greco , F. Bruno Dipartimento di Scienze Statistiche

Clustering compositional data trajectories F. Greco , F. Bruno Dipartimento di Scienze Statistiche

Clustering compositional data trajectories F. Greco , F. Bruno Dipartimento di Scienze Statistiche Universit di Bologna Outline We deal with trajectories of compositional data, that is with sequences of composition measurements in domains.

479 views • 33 slides
Distance Methods Distance Estimates attempt to estimate the mean number of changes per site

Distance Methods Distance Estimates attempt to estimate the mean number of changes per site

Distance Methods Distance Methods Distance Estimates attempt to estimate the mean number of changes per site since 2 species (sequences) split from each other Simply counting the number of differences (sometimes called p distance) may

375 views • 6 slides
OASIS Context Server Technical Committee First Meeting Serge Huber, shuber@jahia.com Thomas

OASIS Context Server Technical Committee First Meeting Serge Huber, shuber@jahia.com Thomas

OASIS Context Server Technical Committee First Meeting Serge Huber, shuber@jahia.com Thomas Sigdestad, tsi@enonic.com Chet Ensign, chet.ensign@oasis-open.org Agenda, April 29th (day 1) 9h30 - Arrival and croissants 10h00-12h00 Start of

493 views • 15 slides

More recommend