Back to Search Start Over

Making sense of ultrahigh-resolution movement data: A new algorithm for inferring sites of interest

Authors :
Anne Loison
Rory P. Wilson
James Redcliffe
Jonathan R. Potts
Mathieu Garel
Rhys Munden
Luca Börger
Laboratoire d'Ecologie Alpine (LECA)
Université Joseph Fourier - Grenoble 1 (UJF)-Centre National de la Recherche Scientifique (CNRS)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])
Department of Integrative Biology
University of Guelph
Biosciences
Swansea University
Laboratoire d'Ecologie Alpine (LECA )
Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Laboratoire de Biométrie et Biologie Evolutive - UMR 5558 (LBBE)
Université Claude Bernard Lyon 1 (UCBL)
Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)
Source :
BMC Ecology and Evolution, BMC Ecology and Evolution, BMC, 2019, 9 (1), pp.265-274. ⟨10.1002/ece3.4721⟩, Ecology and Evolution, Ecology and Evolution, Wiley Open Access, 2019, 9 (1), pp.265-274. ⟨10.1002/ece3.4721⟩, Ecology and Evolution, 2019, 9 (1), pp.265-274. ⟨10.1002/ece3.4721⟩
Publication Year :
2018
Publisher :
Wiley, 2018.

Abstract

International audience; Decomposing the life track of an animal into behavioral segments is a fundamental challenge for movement ecology. The proliferation of high‐resolution data, often collected many times per second, offers much opportunity for understanding animal movement. However, the sheer size of modern data sets means there is an increasing need for rapid, novel computational techniques to make sense of these data. Most existing methods were designed with smaller data sets in mind and can thus be prohibitively slow. Here, we introduce a method for segmenting high‐resolution movement trajectories into sites of interest and transitions between these sites. This builds on a previous algorithm of Benhamou and Riotte‐Lambert (2012). Adapting it for use with high‐resolution data. The data’s resolution removed the need to interpolate between successive locations, allowing us to increase the algorithm’s speed by approximately two orders of magnitude with essentially no drop in accuracy. Furthermore, we incorporate a color scheme for testing the level of confidence in the algorithm's inference (high = green, medium = amber, low = red). We demonstrate the speed and accuracy of our algorithm with application to both simulated and real data (Alpine cattle at 1 Hz resolution). On simulated data, our algorithm correctly identified the sites of interest for 99% of “high confidence” paths. For the cattle data, the algorithm identified the two known sites of interest: a watering hole and a milking station. It also identified several other sites which can be related to hypothesized environmental drivers (e.g., food). Our algorithm gives an efficient method for turning a long, high‐resolution movement path into a schematic representation of broadscale decisions, allowing a direct link to existing point‐to‐point analysis techniques such as optimal foraging theory. It is encoded into an R package called SitesInterest, so should serve as a valuable tool for making sense of these increasingly large data streams.

Details

ISSN :
20457758 and 27307182
Volume :
9
Database :
OpenAIRE
Journal :
Ecology and Evolution
Accession number :
edsair.doi.dedup.....7bb9105c9c8d7f587390b5e320ab84f5
Full Text :
https://doi.org/10.1002/ece3.4721