Analysing infrequently sampled animal tracking data by incorporating generalized movement trajectories with kernel density estimation

When analysing the movements of an animal, a common task is to generate a continuous probability density surface that characterises the spatial distribution of its locations, termed a home range. Traditional kernel density estimation (KDE), the Brownian Bridges kernel method, and time-geographic density estimation are all commonly used for this purpose, although their applicability in some practical situations is limited. Other studies have argued that KDE is inappropriate analysing moving objects, while the latter two methods are only suitable for tracking data collected at frequent enough intervals such that an object’s movement pattern can be adequately represented using a space–time path created by connecting consecutive points. This research formulates and evaluates KDE using generalised movement trajectories approximated by Delaunay triangulation (KDE-DT) as a method for analysing infrequently sampled animal tracking data. In this approach, a DT is constructed from a point pattern of tracking data in order to approximate the network of movement trajectories for an animal. This network represents the generalised movement patterns of an animal rather than its specific, individual trajectories between locations. Then, kernel density estimates are calculated with distances measured using that network. First, this paper describes the method and then applies it to generate a probability density surface for a Florida panther from radio-tracking data collected three times per week. Second, the performance of the technique is evaluated in the context of delineating wildlife home ranges and core areas from simulated animal locational data. The results of the simulations suggest that KDE-DT produces more accurate home range estimates than traditional KDE, which was evaluated with the same data in a previous study. In addition to animal home range analysis, the technique may be useful for characterising a variety of spatial point patterns generated by objects that move through continuous space, such as pedestrians or ships.     

Comparing Abstraction Refinement Algorithms

We present a generic algorithm that provides a unifying scheme for the comparison of abstraction refinement algorithms. It is centered around the notion of refinement cue which generalizes counterexamples. It is demonstrated how the essential features of several refinement algorithms can be captured as instances.We argue that the generic algorithm does not limit the completeness of instances, and show that the proposed generalization of counterexamples is necessary for completeness — thus addressing a shortcoming of more limited notions of counterexample-guided refinement.     

Mosaic model for sensorimotor learning and control

Humans demonstrate a remarkable ability to generate accurate and appropriate motor behavior under many different and often uncertain environmental conditions. We previously proposed a new modular architecture, the modular selection and identification for control (MOSAIC) model, for motor learning and control based on multiple pairs of forward (predictor) and inverse (controller) models. The architecture simultaneously learns the multiple inverse models necessary for control as well as how to select the set of inverse models appropriate for a given environment. It combines both feedforward and feedback sensorimotor information so that the controllers can be selected both prior to movement and subsequently during movement. This article extends and evaluates the MOSAIC architecture in the following respects. The learning in the architecture was implemented by both the original gradient-descent method and the expectation-maximization (EM) algorithm. Unlike gradient descent, the newly derived EM algorithm is robust to the initial starting conditions and learning parameters. Second, simulations of an object manipulation task prove that the architecture can learn to manipulate multiple objects and switch between them appropriately. Moreover, after learning, the model shows generalization to novel objects whose dynamics lie within the polyhedra of already learned dynamics. Finally, when each of the dynamics is associated with a particular object shape, the model is able to select the appropriate controller before movement execution. When presented with a novel shape-dynamic pairing, inappropriate activation of modules is observed followed by on-line correction.     

Dynamic Visual Abstraction of Soccer Movement

Trajectory‐based visualization of coordinated movement data within a bounded area, such as player and ball movement within a soccer pitch, can easily result in visual crossings, overplotting, and clutter. Trajectory abstraction can help to cope with these issues, but it is a challenging problem to select the right level of abstraction (LoA) for a given data set and analysis task. We present a novel dynamic approach that combines trajectory simplification and clustering techniques with the goal to support interpretation and understanding of movement patterns. Our technique provides smooth transitions between different abstraction types that can be computed dynamically and on‐the‐fly. This enables the analyst to effectively navigate and explore the space of possible abstractions in large trajectory data sets. Additionally, we provide a proof of concept for supporting the analyst in determining the LoA semi‐automatically with a recommender system. Our approach is illustrated and evaluated by case studies, quantitative measures, and expert feedback. We further demonstrate that it allows analysts to solve a variety of analysis tasks in the domain of soccer.     

局部多层网格划分下的轨迹数据概化方法

针对轨迹数据概化中空间划分的区域范围不能有效控制以及覆盖网格尺度难以合理选择的问题,提出局部多层网格划分方法,对样本密集的区域进行迭代划分。在此基础上提出一种轨迹数据概化方法,在局部多层网格划分的基础上,考虑时间约束合并轨迹连续往复通过的邻接区域,生成概化轨迹。真实数据的实验表明该算法得到的概化轨迹较同类算法保持了更多轨迹特性,更加适合后续数据挖掘,如聚类处理。     

Knowledge-based spatiotemporal linear abstraction

We present a theoretical framework and a case study for reusing the same conceptual and computational methodology for both temporal abstraction and linear (unidimensional) space abstraction, in a domain (evaluation of traffic-control actions) significantly different from the one (clinical medicine) in which the method was originally used. The method, known asknowledge-based temporal abstraction, abstracts high-level concepts and patterns from time-stamped raw data using a formal theory of domain-specific temporal-abstraction knowledge. We applied this method, originally used to interpret time-oriented clinical data, to the domain of traffic control, in which the monitoring task requires linear pattern matching along both space and time. First we reused the method for creation of unidimensional spatial abstractions over highways, given sensor measurements along each highway measured at the same time point. Second, we reused the method to create temporal abstractions of the traffic behaviour, for the same space segments, but during consecutive time points. We defined the corresponding temporal-abstraction and spatial-abstraction domain-specific knowledge. Our results suggest that (1) the knowledge-base temporal-abstraction method is reusable over time and unidimensional space as well as over significantly different domains; (2) the method can be generalised into a knowledge-based linear-abstraction method, which solves tasks requiring abstraction of data along any linear distance measure; and (3) a spatiotemporal-abstraction method can be assembled, from two copies of the generalised method and a spatial-decomposition mechanism, and is applicable to tasks requiring abstraction of time-oriented data into meaningful spatiotemporal patterns over a linear, decomposable space, such as traffic over a set of highways.     

Movement primitives as a robotic tool to interpret trajectories through learning-by-doing

Articulated movements are fundamental in many human and robotic tasks.While humans can learn and generalise arbitrarily long sequences of movements,and particularly can optimise them to ft the constraints and features of their body,robots are often programmed to execute point-to-point precise but fxed patterns.This study proposes a new approach to interpreting and reproducing articulated and complex trajectories as a set of known robot-based primitives.Instead of achieving accurate reproductions,the proposed approach aims at interpreting data in an agent-centred fashion,according to an agent s primitive movements.The method improves the accuracy of a reproduction with an incremental process that seeks frst a rough approximation by capturing the most essential features of a demonstrated trajectory.Observing the discrepancy between the demonstrated and reproduced trajectories,the process then proceeds with incremental decompositions and new searches in sub-optimal parts of the trajectory.The aim is to achieve an agent-centred interpretation and progressive learning that fts in the frst place the robots capability,as opposed to a data-centred decomposition analysis.Tests on both geometric and human generated trajectories reveal that the use of own primitives results in remarkable robustness and generalisation properties of the method.In particular,because trajectories are understood and abstracted by means of agent-optimised primitives,the method has two main features： 1） Reproduced trajectories are general and represent an abstraction of the data.2） The algorithm is capable of reconstructing highly noisy or corrupted data without pre-processing thanks to an implicit and emergent noise suppression and feature detection.This study suggests a novel bio-inspired approach to interpreting,learning and reproducing articulated movements and trajectories.Possible applications include drawing,writing,movement generation,object manipulation,and other tasks where the performance requires human-like interpretation and generalisation capabilities.     

Abstract representations for interactive visualization of virtual 3D city models

Virtual 3D city models increasingly cover whole city areas; hence, the perception of complex urban structures becomes increasingly difficult. Using abstract visualization, complexity of these models can be hidden where its visibility is unnecessary, while important features are maintained and highlighted for better comprehension and communication. We present a technique to automatically generalize a given virtual 3D city model consisting of building models, an infrastructure network and optional land coverage data; this technique creates several representations of increasing levels of abstraction. Using the infrastructure network, our technique groups building models and replaces them with cell blocks, while preserving local landmarks. By computing a landmark hierarchy, we reduce the set of initial landmarks in a spatially balanced manner for use in higher levels of abstraction. In four application examples, we demonstrate smooth visualization of transitions between precomputed representations; dynamic landmark highlighting according to virtual camera distance; an implementation of a cognitively enhanced route representation, and generalization lenses to combine precomputed representations in focus + context visualization.     

An internal model principle is necessary and sufficient for linear output synchronization

Output synchronization of a network of heterogeneous linear state–space models under time-varying and directed interconnection structures is investigated. It is shown that, assuming stabilizability and detectability of the individual systems and imposing very mild connectedness assumptions on the interconnection structure, an internal model requirement is necessary and sufficient for synchronizability of the network to polynomially bounded trajectories. The resulting dynamic feedback couplings can be interpreted as a generalization of existing methods for identical linear systems.     

Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations

Complex queries on trajectory data are increasingly common in applications involving moving objects. MBR or grid-cell approximations on trajectories perform suboptimally since they do not capture the smoothness and lack of internal area of trajectories. We describe a parametric space indexing method for historical trajectory data, approximating a sequence of movement functions with single continuous polynomial. Our approach works well, yielding much finer approximation quality than MBRs. We present the PA-tree, a parametric index that uses this method, and show through extensive experiments that PA-trees have excellent performance for offline and online spatio-temporal range queries. Compared to MVR-trees, PA-trees are an order of magnitude faster to construct and incur I/O cost for spatio-temporal range queries lower by a factor of 2-4. SETI is faster than our method for index construction and timestamp queries, but incurs twice the I/O cost for time interval queries, which are much more expensive and are the bottleneck in online processing. Therefore, the PA-tree is an excellent choice for both offline and online processing of historical trajectories     

基于循环神经网络的空载电动出租车的充电桩推荐方法

提出了一种基于循环神经网络的空载电动出租车的充电桩推荐方法（CPRM-IET,charging pile recommendation method for idle electric taxis）,来为空载状态下的电动出租车推荐最佳充电桩。空载状态下的电动出租车移动一般依赖于驾驶人的潜意识移动倾向和驾驶习惯,因此需要根据其历史移动轨迹来预测其未来移动,从而找到充电额外移动最小的若干充电桩。在CPRM-IET中,使用了一种基于双阶段注意力机制的循环神经网络（DA-RNN,dual-stage attention-based recurrent neural network）模型来预测电动出租车的未来轨迹,DA-RNN模型包括输入注意力机制和时间注意力机制。输入注意力机制在每个时刻为输入的行驶记录分配权重,而时间注意机制为编码器的隐藏状态分配权重。根据预测轨迹,再选择额外移动最小的若干充电桩,并推荐给电动出租车驾驶人。仿真结果表明,CPRM-IET可以在额外移动和均方根误差方面取得较好的结果,反映了CPRM-IET可以准确地预测空载电动出租车的未来轨迹,并向这些电动出租车推荐合适的充电桩。     

Control of biomimetic robots based on analysis of human arm trajectories in 3D movements

In this study, a biomimetic robot arm with joint redundancy movable in a three-dimensional space is taken into consideration. The basic trajectories for controlling all joints are formulated under the minimum angular jerk criterion. Then, a time adjustment of the joint motion of the elbow relative to the shoulder is provided for representing specific properties of joint angular trajectories during a movement. Here, a systematical scheme for formulating the human-like trajectory has been developed by use of a direct kinematics. As the angular trajectories of all joints can be formulated in the proposed manner, the hand trajectory can be uniquely produced once the initial and final postures of the arm and a movement duration are given. The trajectories under the proposed scheme are produced by utilizing the same movement conditions observed by experiments. Then, performance for reproducing human-like trajectories has been evaluated under the comparative analysis between the observed and the produced trajectories.     

A road map to solid modeling

The objective of solid modeling is to represent, manipulate and reason about the 3D shape of solid physical objects by computer. Such representations should be unambiguous. Solid modeling's major application areas include design, manufacturing, computer vision, graphics and virtual reality. The field draws on diverse sources, including numerical analysis, symbolic algebraic computation, approximation theory, applied mathematics, point set topology, algebraic geometry, computational geometry and databases. In this article, we begin with some mathematical foundations of the field. We next review the major representation schemata of solids. Then, major layers of abstraction in a typical solid modeling system are characterized. The lowest level of abstraction comprises a substratum of basic service algorithms. At an intermediate level of abstraction there are algorithms for larger, more conceptual operations. Finally, a yet higher level of abstraction presents to the user a functional view that is typically targeted towards solid design. We look at some applications and at user interaction concepts. The classical design paradigms of solid modeling concentrated on obtaining one specific final shape. Those paradigms are becoming supplanted by feature-based, constraint-based design paradigms that are oriented more toward the design process and define classes of shape instances. These new paradigms venture into territory that has yet to be explored systematically. Concurrent with this paradigm shift, there is also a shift in the system architecture towards modularized confederations of plug-compatible functional components     

Measuring data abstraction quality in multiresolution visualizations

Data abstraction techniques are widely used in multiresolution visualization systems to reduce visual clutter and facilitate analysis from overview to detail. However, analysts are usually unaware of how well the abstracted data represent the original dataset, which can impact the reliability of results gleaned from the abstractions. In this paper, we define two data abstraction quality measures for computing the degree to which the abstraction conveys the original dataset: the histogram difference measure and the nearest neighbor measure. They have been integrated within XmdvTool, a public-domain multiresolution visualization system for multivariate data analysis that supports sampling as well as clustering to simplify data. Several interactive operations are provided, including adjusting the data abstraction level, changing selected regions, and setting the acceptable data abstraction quality level. Conducting these operations, analysts can select an optimal data abstraction level. Also, analysts can compare different abstraction methods using the measures to see how well relative data density and outliers are maintained, and then select an abstraction method that meets the requirement of their analytic tasks     

A Screen Space Quality Method for Data Abstraction

The rendering of large data sets can result in cluttered displays and non‐interactive update rates, leading to time consuming analyses. A straightforward solution is to reduce the number of items, thereby producing an abstraction of the data set. For the visual analysis to remain accurate, the graphical representation of the abstraction must preserve the significant features present in the original data. This paper presents a screen space quality method, based on distance transforms, that measures the visual quality of a data abstraction. This screen space measure is shown to better capture significant visual structures in data, compared with data space measures. The presented method is implemented on the GPU, allowing interactive creation of high quality graphical representations of multivariate data sets containing tens of thousands of items.