html5-img
1 / 109

Computational Movement Analysis Lecture 1: Similarity Joachim Gudmundsson

Computational Movement Analysis Lecture 1: Similarity Joachim Gudmundsson. Aim . Goal: Extract and make sense of information from trajectories (GPS, mobile, video, rfid …). Provide fundamental software tools to simplify and support qualitative analysis. Our model.

zared
Télécharger la présentation

Computational Movement Analysis Lecture 1: Similarity Joachim Gudmundsson

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computational Movement AnalysisLecture 1: SimilarityJoachim Gudmundsson

  2. Aim Goal:Extract and make sense of information from trajectories (GPS, mobile, video, rfid…). Provide fundamental software tools to simplify and support qualitative analysis.

  3. Our model Input: Locations sampled over time 30 0 31 5 28 6 38 12 25 53 48 47 16

  4. Our model Input: Locations sampled over time Assumptions: a)Straight-line movement between consecutive samples b) Constant velocity 30 0 31 5 28 6 38 12 25 53 48 47 16

  5. Brownian bridge movement model Input: Locations sampled over time Other models? Brownian bridge Brownian motion conditioned under starting and ending position Probability that object visits region A

  6. Our model Input: a sequence of (x,y,t) - coordinates and a time stamp for example GPS data, mobile phone, radar, …

  7. Additional information Input: a sequence of (x, y, t, z, temperature, speed, direction…)

  8. Trajectory data 2005

  9. Trajectory data 2011

  10. Applications: Behavioural ecology • Migration patterns • “Popular places” • Home region • …

  11. Applications: Behavioural ecology • Migration patterns • “Popular places” • Home range • Flock movements • …

  12. Applications: Behavioural ecology • Interaction between jackdaws? • Effect of external factors ? [Joint work: Georgina Wilcox, Kevin buchin, MaikeBuchin, Ran Nathan and Anael Engel]

  13. Applications: Behavioural ecology Behavioural ecology Short term: • Annual migration behaviour • Automatically detect activity • Home range Long term: - Foraging search strategies - Factors that may influence animal movement - How changes in the environment affects wildlife

  14. Applications: Sport Data Accuracy: 100 mm Frequency: 25Hz [Joint work: Thomas Wolle and many others]

  15. Applications: Sport • Tools to support sports analysts and coaches • Evaluate a players ability to pass (receive, execute…) • Evaluate a players ability to move into open areas • Evaluate a players ability to follow instructions • Detect frequent movement patterns • Detect correlations between players’ movement • Detect frequent passing patterns • Analyse turn-overs • Which events change the intensity of the game? • …

  16. Applications: Hurricanes Goal: Early detection of hurricanes that may hit land

  17. Applications: Transport • Collision prevention • Maximize unloading/loading

  18. Applications: Shopping behaviour • Detect movement patterns • Change structure of shop to increase sales?

  19. Examples of general problems • General problems • Repetitive patterns • Popular places • Trajectory segmentation • Trajectory simplification • Trajectory clustering • Subtrajectory clustering • Movement patterns • Single file • Formations • Leadership • Meetings • …

  20. Seminar schedule • Lecture 1: Similarity • Lecture 2: Curve clustering • Lecture 3: Simplification • Lecture 4: Movement patterns • Lecture 5: Trajectory segmentation

  21. Fundamental tools: clustering When are two trajectories similar? In most cases the spatial similarity is much more important than the temporal aspect.

  22. Similarity of curves…measurements Agrawal, Lin, Sawhney & Shim, 1995 Alt & Godau, 1995 Yi, Jagadish & Faloutsos, 1998 Gaffney & Smyth, 1999 Kalpakis, Gada & Puttagunta, 2001 Vlachos, Gunopulos & Kollios, 2002 Gunopoulos, 2002 Mamoulis, Cao, Kollios, Hadjieleftheriou, Tao & Cheung, 2004 Chen, Ozsu & Oria, 2005 Nanni & Pedreschi, 2006 Van Kreveld & Luo, 2007 Gaffney, Robertson, Smyth, Camargo & Ghil, 2007 Lee, Han & Whang, 2007 Buchin, Buchin, van Kreveld & Luo, 2009 Agarwal, Aranov, van Kreveld, Löffler & Silveira, 2010 Sankaraman, Agarwal, Molhave, Pan and Boedihardjo, 2013 ...

  23. Similarity measures Input: Two polygonal curves P and Q of size m in Rd Approach: Map curve into a point in dm-dimensional space  2D 10D

  24. Similarity measures Input: Two polygonal curves P and Q of size m in Rd Approach: Map curve into a point in dm-dimensional space Similar?  10D 2D

  25. Similarity measures Input: Two polygonal curves P and Q of size m in Rd Approach: Map curve into a point in dm-dimensional space Drawbacks: P and Q must have same number points Only takes the vertices into consideration Not similar  6D 2D

  26. Similarity measures: Hausdorff Input: Two polygonal curves P and Q in Rd Distance:Hausdorff distance H(PQ) = maxpPminqQ |p-q| dH(P,Q) = max [H(PQ), H(QP)]

  27. Similarity measures: Hausdorff Input: Two polygonal curves P and Q in Rd Distance:Hausdorff distance H(PQ) = maxpPminqQ |p-q| dH(P,Q) = max [H(PQ), H(QP)] P P Q Q

  28. Similarity measures: Hausdorff Input: Two polygonal curves P and Q in Rd Distance:Hausdorff distance H(PQ) = maxpPminqQ |p-q| dH(P,Q) = max [H(PQ), H(QP)] P Q Drawbacks: Fail to capture the distance between curves.

  29. Similarity measures: Fréchet Input: Two polygonal curves P and Q in Rd • Other interesting measures are: • Dynamic Time Warping (DTW) • Longest Common Subsequence (LCSS) • Model-Driven matching (MDM) • Drawback:Non-metrics (triangle inequality does not hold) which makes clustering complicated.

  30. Similarity measure: Fréchet Distance Fréchet Distance measures the similarity of two curves. Dog walking example • Person is walking his dog (person on one curve and the dog on other) • Allowed to control their speeds but not allowed to go backwards! • Fréchet distance of the curves: minimal leash length necessary for both to walk the curves from beginning to end

  31. Fréchet Distance Fréchet Distance measures the similarity of two curves. Dog walking example • Person is walking his dog (person on one curve and the dog on other) • Allowed to control their speeds but not allowed to go backwards! • Fréchet distance of the curves: minimal leash length necessary for both to walk the curves from beginning to end

  32. Fréchet Distance Input: Two polygonal chains P=p1, … , pn and Q=q1, … , qm in Rd. The Fréchet distance between P and Q is: where  and  range over all continuous non-decreasing reparametrizations. Note that (0)=p1, (1)=pn, (0)=q1 and (1)=qm. Well-suited for the comparison of curves since it takes the continuity of the curves into account. (P,Q) =

  33. Discrete Fréchet Distance The discrete Fréchet distance considers only positions of the leash where its endpoints are located at vertices of the two polygonal curves and never in the interior of an edge. May give large errors!

  34. Compute the continuous Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  35. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  36. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  37. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q r Q

  38. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  39. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P r P Q Q

  40. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P r P Q Q

  41. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  42. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  43. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  44. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  45. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  46. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  47. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  48. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  49. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? P P Q Q

  50. Compute the Fréchet distance Input: Two polygonal chains P=p1, … , pnand Q=q1, … , qm in Rd. Decision problem:F(P, Q) ≤ r ? Freespace diagram of P and Q free space P Q

More Related