All functions |
|
---|---|
The acoustic-container (AC) algorithm |
|
The acoustic-container depth-contour (ACDC) algorithm |
|
|
Short-cuts to elements of an |
Create a html animation of the AC/DC algorithm(s) |
|
"acdc-archive" class |
|
Plot time-specific maps from the AC/DC algorithm(s) |
|
Plot AC* container dynamics |
|
"acdc_record" class |
|
Simplify the outputs of the AC/DC algorithms |
|
Setup the detection containers required for the AC* algorithm(s) |
|
Setup detection probability kernels for the AC* algorithm(s) |
|
Examine the constant `mobility' assumption of the AC* algorithm(s) |
|
Assemble counts of transmissions/detections from sentinel tags |
|
Buffer and crop a spatial object |
|
Obtain a RasterLayer or the cells of RasterLayer that are equal to or lie within a range of specified values |
|
|
Parallelisation helpers |
The centres of activity (COA) algorithm |
|
Suggest time intervals over which to calculate centres of activity |
|
Interactively crop a |
|
Example ACDC algorithm output |
|
Example passive acoustic telemetry detections dataset |
|
Example archival dataset |
|
The coastline around the MEFS Firth of Lorn acoustic array |
|
Example detection containers from |
|
Example DC algorithm output |
|
Example DCPF algorithm output: particle histories |
|
Example DCPF algorithm output: reconstructed paths |
|
The bathymetry around the MEFS Firth of Lorn acoustic array |
|
Example tagged individuals dataset |
|
Example passive acoustic telemetry receiver moorings dataset |
|
Example sentinel tag range testing dataset |
|
The depth-contour (DC) algorithm |
|
The `quick' depth-contour (DCQ) algorithm |
|
Calculate the distance between sequential mouse clicks on a map |
|
Calculate the Euclidean distance(s) between points in three-dimensional space. |
|
Compute Euclidean distances between receivers |
|
Calculate the total distance of a path over a three-dimensional surface |
|
Evaluate movement path estimates using kernel utilisation distributions |
|
Parallelisation in |
|
|
|
Global example controls |
|
Calculate the total area sampled by acoustic receivers |
|
Calculate the area sampled by receivers through time |
|
Get detection clumps |
|
Define detection containers around receivers |
|
Sample environmental conditions around receivers |
|
Get detection container overlaps |
|
Calculate detection days |
|
Get `overlapping' detections |
|
A detection probability function based on distance |
|
Get animal `home ranges' |
|
Calculate the overlap between individuals' time at liberty and receivers' operational periods |
|
Spatial intersections with one or more geometries |
|
|
Estimate individual swimming speeds from acoustic and archival data |
Identify resting behaviour within depth time series |
|
Calculate the number of operational units through time |
|
Identify `resident' individuals in a passive acoustic telemetry array |
|
Invert a (spatial) polygon |
|
Process a kernel utilisation distribution around a barrier |
|
Define a `habitat' grid for kernel smoothing |
|
Compare Euclidean and shortest distances |
|
Calculate the distances between connected cells in a Raster* |
|
Create a Raster* of the least-cost distances around a point |
|
Construct a graph for least-cost paths analysis of movement from a point on a Raster* |
|
Interpolate shortest (least-cost) paths between locations along a movement path |
|
Calculate shortest path(s) and/or distance(s) over a surface between origin and destination coordinates |
|
Convert a detection matrix into a dataframe |
|
Compute a detection history similarity matrix |
|
Matricise detection time series |
|
Matricise individual deployment time series |
|
Matricise receiver deployment time series |
|
Implement |
|
The particle filtering routine |
|
Access the `history' element of a |
|
List `history' files from a PF algorithm |
|
Access the cells sampled by PF |
|
Create a html animation of the PF algorithm(s) |
|
"pf_archive" class |
|
Smooth POU maps |
|
(Experimental) Alternative kernel smoothing routines for particles or paths from a PF algorithm |
|
Calculate the log-probability of movement paths from a PF algorithm |
|
"pf" class |
|
Plot one-dimensional depth time series from a PF algorithm |
|
Map two-dimensional paths from a PF algorithm |
|
Map three-dimensional paths from a PF algorithm |
|
Plot particle histories from a PF algorithm |
|
Plot `probability of use' from a PF algorithm |
|
A simple movement model dependent on distance |
|
Optimisation settings for |
|
List `record' files from an AC/DC algorithm for PF |
|
Convert particle histories from |
|
Pass putative false detections through a spatial filter |
|
Basic quality checks of passive acoustic telemetry datasets |
|
Add unique receiver IDs to passive acoustic telemetry time series |
|
Process a Raster* by aggregation and quantify the error induced by this process |
|
Query the Open Topo Data API for elevation data |
|
Determine if Euclidean path segments cross a barrier |
|
Simulate (marine) monitoring arrays |
|
Simulate detections |
|
Functions for the simulation of movement paths |
|
Simulate discrete-time movement paths under a Ornstein-Uhlenbeck process (1) |
|
Simulate discrete-time movement paths from step lengths and turning angles |
|
Populate a raster with simulated values |
|
Split a raster into equal-area parts |
|
Shrink or expand an |
|
Get location coordinates from mouse click(s) |