1 / 21

Extracting Stay Regions from GPS Trajectories: A Case Study in Animal Ecology

This study presents a novel framework for extracting stay regions with uncertain boundaries from GPS trajectories. It introduces a time-aware, density-based clustering technique and applies it to analyze the migratory behavior of roe deer. The algorithm, SeqScan, is validated using a real dataset and provides a mechanism for analyzing stop-and-move patterns over large temporal scales.

frisk
Download Presentation

Extracting Stay Regions from GPS Trajectories: A Case Study in Animal Ecology

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. Extracting stay regions with uncertain boundaries from GPS trajectoriesa case study in animal ecology Haidong Wang

  2. Introduction and problem Introduction: With the advances in mobile technologies, the extraction of behavioral patterns from collections of geometric trajectories regarding e.g. people, animals and goods, has become a prominent research issue in a variety of disciplines. Problem: How to extract stay regions with uncertain boundaries from GPS trajectories.

  3. Solution to the problem and the study case Solution: To use a time-aware, density-basedclustering technique for the identification of stay regions in trajectories. Study case: Object: roe deer, a partial migration species. Pattern:

  4. Motivation The study can open up new opportunities for the study of the animal behavior .

  5. Definitions ϵ : distance threshold. K : the minimum number of points that a cluster contains. δ : presence threshold. ϵ-neighborhood : denoted N ϵ(p), is the subset of points that are ”close” to p. Core point : Point p is a core point if its ϵ-neighborhood contains at least K points. Border point : point that is not a core point but belongs to the neighborhood of a core point is a border point.

  6. Definitions Dense region: A dense region S is a sub-trajectory S = [q1, .., qm] such that the set of locations [l1, .., lm] is a maximal density connected set with respect to ϵand K. The points that do not belong to any dense region in T are qualified as noise. Presence:

  7. Example

  8. Example Dense region:

  9. Example Presence: the presence in the dense region is |t9 − t6|.

  10. Problem formulation Stay region (S): (i) S is a dense region w.r.t. ϵand K. (ii)The object’s presence in S is persistent w.r.t δ.

  11. ALGORITHM

  12. Experiments - dataset We apply the algorithm to extract the migration behavior of a group of 25 roe deer tracked in the period 2005-2008. The dataset is provided by the research institute Fondazione E.Mach. The total number of samples amounts to over 50000 points. The animals live in an area of about 30 Km2 on the Alps near the city of Trento (Italy). The history of these animals, since their capture for the installation of the GPS collar, is known and used as ground truth. The points are sampled approximately every 4 hours.

  13. Experiments – sampled points

  14. Experiment - result 4606 points over two yearswith 9.64% noise migrate 2642 points with 32% noise migrate 1543 points with 1.4% noise stationary

  15. Experiment - stats

  16. Conclusion The paper presents a novel framework for the study of migratory behaviors, consisting of: a mobility pattern model; an algorithm, i.e. SeqScan, to extract such a pattern from GPS trajectories; a usage methodology for the study of wild animal migrations; and a first validation of the whole framework over a real data set. On the algorithmic side, SeqScan provides a conceptually clean and founded mechanism for the analysis of stop-and-move like patterns over large temporal scales.

  17. Questions?

  18. Algorithm

  19. Example

  20. Example

  21. Example

More Related