Trajectory segmentation is the process of subdividing a trajectory into parts either by grouping points similar with respect to some measure of interest, or by minimizing a global objective function. Here we present a novel online algorithm for segmentation and summary, based on point density along the trajectory, and based on the nature of the naturally occurring structure of intermittent bouts of locomotive and local activity. We show an application to visualization of trajectory datasets, and discuss the use of the summary as an index allowing efficient queries which are otherwise impossible or computationally expensive, over very large datasets.
In the field of Ecology, Trajectory segmentation is widely used in order to segment the path of an animal into functionally homogeneous units. The main approach used is to compute a single point-wise feature along the trajectory and then group similar points, with respect to the feature. For example, a method of change-point analysis @cite_32 has been used in conjunction with Residence Time (a metric of the total amount of time spent in the vicinity of a point @cite_1 ). Another approach is to segment a trajectory with respect to the momentary behavior of an animal along a path @cite_28 .
@cite_28 @cite_1 @cite_32
2528957674 2015378554 2047348678 2129822853
Motion segmentation is an important task for intelligent transportation systems. In this paper, inspired by the fact that a feature point trajectory can be sparsely represented as a combination of several feature point trajectories that share coherent transformations, an efficient and effective motion segmentation method with a sparsity constraint is proposed. Specifically, we first propose an accumulated scheme to efficiently integrate motion information from all the frames of a video sequence to construct a correlation matrix. Then, a sparse affinity matrix is built on the correlation matrix by using information-theoretic principles, where the nonzero elements in the same row of the sparse affinity matrix correspond to the feature point trajectories more likely belonging to the same motion. Thereafter, a segment and merge procedure is proposed to effectively estimate the number of motions via the sparse affinity matrix. Finally, by applying spectral clustering on the sparse affinity matrix, different motions in the video sequence are accurately segmented based on the estimated number of motions. Experimental results on the Hopkins 155 and the 62-clip datasets demonstrate that the proposed method achieves superior performance compared with several state-of-the-art methods. We propose a segmentation and feature extraction method for trajectories of moving objects. The methodology consists of three stages: trajectory data preparation; global descriptors computation; and local feature extraction. The key element is an algorithm that decomposes the profiles generated for different movement parameters (velocity, acceleration, etc.) using variations in sinuosity and deviation from the median line. Hence, the methodology enables the extraction of local movement features in addition to global ones that are essential for modeling and analyzing moving objects in applications such as trajectory classification, simulation and extraction of movement patterns. As a case study, we show how the method can be employed in classifying trajectory data generated by unknown moving objects and assigning them to known types of moving objects, whose movement characteristics have been previously learned. We have conducted a series of experiments that provide evidence about the similarities and differences that exist among different types of moving objects. The experiments show that the methodology can be successfully applied in automatic transport mode detection. It is also shown that eye-movement data cannot be successfully used as a proxy of full-body movement of humans, or vehicles. Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this paper, we propose a method for trajectory segmentation and sampling based on the representativeness of the (sub)trajectories in the MOD. In order to find the most representative subtrajectories, the following methodology is proposed. First, a novel global voting algorithm is performed, based on local density and trajectory similarity information. This method is applied for each segment of the trajectory, forming a local trajectory descriptor that represents line segment representativeness. The sequence of this descriptor over a trajectory gives the voting signal of the trajectory, where high values correspond to the most representative parts. Then, a novel segmentation algorithm is applied on this signal that automatically estimates the number of partitions and the partition borders, identifying homogenous partitions concerning their representativeness. Finally, a sampling method over the resulting segments yields the most representative subtrajectories in the MOD. Our experimental results in synthetic and real MOD verify the effectiveness of the proposed scheme, also in comparison with other sampling techniques. Point trajectories have emerged as a powerful means to obtain high quality and fully unsupervised segmentation of objects in video shots. They can exploit the long term motion difference between objects, but they tend to be sparse due to computational reasons and the difficulty in estimating motion in homogeneous areas. In this paper we introduce a variational method to obtain dense segmentations from such sparse trajectory clusters. Information is propagated with a hierarchical, nonlinear diffusion process that runs in the continuous domain but takes superpixels into account. We show that this process raises the density from 3 to 100 and even increases the average precision of labels.