Construction method of moving object trajectory index structure based on CURE algorithm

Author(s):  
A. G. Tashlinskii ◽  
P. V. Smirnov ◽  
M. G. Tsaryov

The paper considers the effectiveness of motion estimation in video using pixel-by-pixel recurrent algorithms. The algorithms use stochastic gradient decent to find inter-frame shifts of all pixels of a frame. These vectors form shift vectors’ field. As estimated parameters of the vectors the paper studies their projections and polar parameters. It considers two methods for estimating shift vectors’ field. The first method uses stochastic gradient descent algorithm to sequentially process all nodes of the image row-by-row. It processes each row bidirectionally i.e. from the left to the right and from the right to the left. Subsequent joint processing of the results allows compensating inertia of the recursive estimation. The second method uses correlation between rows to increase processing efficiency. It processes rows one after the other with the change in direction after each row and uses obtained values to form resulting estimate. The paper studies two criteria of its formation: gradient estimation minimum and correlation coefficient maximum. The paper gives examples of experimental results of pixel-by-pixel estimation for a video with a moving object and estimation of a moving object trajectory using shift vectors’ field.


2020 ◽  
Vol 16 (1) ◽  
pp. 22-38
Author(s):  
Diego Vilela Monteiro ◽  
Rafael Duarte Coelho dos Santos ◽  
Karine Reis Ferreira

Spatiotemporal data is everywhere, being gathered from different devices such as Earth Observation and GPS satellites, sensor networks and mobile gadgets. Spatiotemporal data collected from moving objects is of particular interest for a broad range of applications. In the last years, such applications have motivated many pieces of research on moving object trajectory data mining. In this article, it is proposed an efficient method to discover partners in moving object trajectories. Such a method identifies pairs of trajectories whose objects stay together during certain periods, based on distance time series analysis. It presents two case studies using the proposed algorithm. This article also describes an R package, called TrajDataMining, that contains algorithms for trajectory data preparation, such as filtering, compressing and clustering, as well as the proposed method Partner.


2016 ◽  
Vol 47 (1) ◽  
pp. 123-144 ◽  
Author(s):  
Guan Yuan ◽  
Penghui Sun ◽  
Jie Zhao ◽  
Daxing Li ◽  
Canwei Wang

Sign in / Sign up

Export Citation Format

Share Document