• Title/Summary/Keyword: Moving Object Trajectory

Search Result 150, Processing Time 0.036 seconds

A motion descriptor design combining the global feature of an image and the local one of an moving object (영상의 전역 특징과 이동객체의 지역 특징을 융합한 움직임 디스크립터 설계)

  • Jung, Byeong-Man;Lee, Kyu-Won
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.898-902
    • /
    • 2012
  • A descriptor which is suitable for motion analysis by using the motion features of moving objects from the real time image sequence is proposed. To segment moving objects from the background, the background learning is performed. We extract motion trajectories of individual objects by using the sequence of the $1^{st}$ order moment of moving objects. The center points of each object are managed by linked list. The descriptor includes the $1^{st}$ order coordinates of moving object belong to neighbor of the per-defined position in grid pattern, the start frame number which a moving object appeared in the scene and the end frame number which it disappeared. A video retrieval by the proposed descriptor combining global and local feature is more effective than conventional methods which adopt a single feature among global and local features.

  • PDF

Fast Heuristic Algorithm for Similarity of Trajectories Using Discrete Fréchet Distance Measure (이산 프레셰 거리 척도를 이용한 궤적 유사도 고속계산 휴리스틱 알고리즘)

  • Park, Jinkwan;Kim, Taeyong;Park, Bokuk;Cho, Hwan-Gue
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.4
    • /
    • pp.189-194
    • /
    • 2016
  • A trajectory is the motion path of a moving object. The advances in IT have made it possible to collect an immeasurable amount of various type of trajectory data from a moving object using location detection devices like GPS. The trajectories of moving objects are widely used in many different fields of research, including the geographic information system (GIS) field. In the GIS field, several attempts have been made to automatically generate digital maps of roads by using the vehicle trajectory data. To achieve this goal, the method to cluster the trajectories on the same road is needed. Usually, the $Fr{\acute{e}}chet$ distance measure is used to calculate the distance between a pair of trajectories. However, the $Fr{\acute{e}}chet$ distance measure requires prolonged calculation time for a large amount of trajectories. In this paper, we presented a fast heuristic algorithm to distinguish whether the trajectories are in close distance or not using the discrete $Fr{\acute{e}}chet$ distance measure. This algorithm trades the accuracy of the resulting distance with decreased calculation time. By experiments, we showed that the algorithm could distinguish between the trajectory within 10 meters and the distant trajectory with 95% accuracy and, at worst, 65% of calculation reduction, as compared with the discrete $Fr{\acute{e}}chet$ distance.

A Hybrid Algorithm for Online Location Update using Feature Point Detection for Portable Devices

  • Kim, Jibum;Kim, Inbin;Kwon, Namgu;Park, Heemin;Chae, Jinseok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.600-619
    • /
    • 2015
  • We propose a cost-efficient hybrid algorithm for online location updates that efficiently combines feature point detection with the online trajectory-based sampling algorithm. Our algorithm is designed to minimize the average trajectory error with the minimal number of sample points. The algorithm is composed of 3 steps. First, we choose corner points from the map as sample points because they will most likely cause fewer trajectory errors. By employing the online trajectory sampling algorithm as the second step, our algorithm detects several missing and important sample points to prevent unwanted trajectory errors. The final step improves cost efficiency by eliminating redundant sample points on straight paths. We evaluate the proposed algorithm with real GPS trajectory data for various bus routes and compare our algorithm with the existing one. Simulation results show that our algorithm decreases the average trajectory error 28% compared to the existing one. In terms of cost efficiency, simulation results show that our algorithm is 29% more cost efficient than the existing one with real GPS trajectory data.

The Effect of Process Models on Short-term Prediction of Moving Objects for Autonomous Driving

  • Madhavan Raj;Schlenoff Craig
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.4
    • /
    • pp.509-523
    • /
    • 2005
  • We are developing a novel framework, PRIDE (PRediction In Dynamic Environments), to perform moving object prediction (MOP) for autonomous ground vehicles. The underlying concept is based upon a multi-resolutional, hierarchical approach which incorporates multiple prediction algorithms into a single, unifying framework. The lower levels of the framework utilize estimation-theoretic short-term predictions while the upper levels utilize a probabilistic prediction approach based on situation recognition with an underlying cost model. The estimation-theoretic short-term prediction is via an extended Kalman filter-based algorithm using sensor data to predict the future location of moving objects with an associated confidence measure. The proposed estimation-theoretic approach does not incorporate a priori knowledge such as road networks and traffic signage and assumes uninfluenced constant trajectory and is thus suited for short-term prediction in both on-road and off-road driving. In this article, we analyze the complementary role played by vehicle kinematic models in such short-term prediction of moving objects. In particular, the importance of vehicle process models and their effect on predicting the positions and orientations of moving objects for autonomous ground vehicle navigation are examined. We present results using field data obtained from different autonomous ground vehicles operating in outdoor environments.

Development of Auto Tracking System for Baseball Pitching (투구된 공의 실시간 위치 자동추적 시스템 개발)

  • Lee, Ki-Chung;Bae, Sung-Jae;Shin, In-Sik
    • Korean Journal of Applied Biomechanics
    • /
    • v.17 no.1
    • /
    • pp.81-90
    • /
    • 2007
  • The effort identifying positioning information of the moving object in real time has been a issue not only in sport biomechanics but also other academic areas. In order to solve this issue, this study tried to track the movement of a pitched ball that might provide an easier prediction because of a clear focus and simple movement of the object. Machine learning has been leading the research of extracting information from continuous images such as object tracking. Though the rule-based methods in artificial intelligence prevailed for decades, it has evolved into the methods of statistical approach that finds the maximum a posterior location in the image. The development of machine learning, accompanied by the development of recording technology and computational power of computer, made it possible to extract the trajectory of pitched baseball from recorded images. We present a method of baseball tracking, based on object tracking methods in machine learning. We introduce three state-of-the-art researches regarding the object tracking and show how we can combine these researches to yield a novel engine that finds trajectory from continuous pitching images. The first research is about mean shift method which finds the mode of a supposed continuous distribution from a set of data. The second research is about the research that explains how we can find the mode and object region effectively when we are given the previous image's location of object and the region. The third is about the research of representing data into features that we can deal with. From those features, we can establish a distribution to generate a set of data for mean shift. In this paper, we combine three works to track baseball's location in the continuous image frames. From the information of locations from two sets of images, we can reconstruct the real 3-D trajectory of pitched ball. We show how this works in real pitching images.

Real-Time Response at Motion Control

  • Ha, Young-Youl;Han, Sung-Ho;Woo, Gap-Joo;Kim, Jae-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.94.2-94
    • /
    • 2002
  • $\textbullet$ The method to have real-time response at the motion control. $\textbullet$ The trajectory generation method guarantees the continuous acceleration in changing the velocity during the actuator is moving. $\textbullet$ We propose the velocity profile generation algorithm in order to change object position or object velocity with continuous acceleration using blending method.

  • PDF

Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구)

  • Jeong, Ji-Mun
    • 한국디지털정책학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.517-530
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However, Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets showed that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also showed that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

Study on Continuous Nearest Neighbor Query on Trajectory of Moving Objects (이동객체의 궤적에 대한 연속 최근접 질의에 관한 연구)

  • Chung, Ji-Moon
    • Journal of Digital Convergence
    • /
    • v.3 no.1
    • /
    • pp.149-163
    • /
    • 2005
  • Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However. Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets shows that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also shows that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

  • PDF

A Study on Center Detection and Motion Analysis of a Moving Object by Using Kohonen Networks and Time Delay Neural Networks

  • Kim, Jong-Young;Hwang, Jung-Ku;Jang, Tae-Jeong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.63.5-63
    • /
    • 2001
  • In this paper, moving objects tracking and dynamic characteristic analysis are studied. Kohonen´s self-organizing neural network models are used for moving objects tracking and time delay neural networks are used for dynamic characteristic analysis. Instead of objects brightness, neuron projections by Kohonen Networks are used. The motion of target objects can be analyzed by using the differential neuron image between the two projections. The differential neuron image which is made by two consecutive neuron projections is used for center detection and moving objects tracking. The two differential neuron images which are made by three consecutive neuron projections are used for the moving trajectory estimation.

  • PDF

Moving Object Tracking Scheme based on Polynomial Regression Prediction in Sparse Sensor Networks (저밀도 센서 네트워크 환경에서 다항 회귀 예측 기반 이동 객체 추적 기법)

  • Hwang, Dong-Gyo;Park, Hyuk;Park, Jun-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.44-54
    • /
    • 2012
  • In wireless sensor networks, a moving object tracking scheme is one of core technologies for real applications such as environment monitering and enemy moving tracking in military areas. However, no works have been carried out on processing the failure of object tracking in sparse sensor networks with holes. Therefore, the energy consumption in the existing schemes significantly increases due to plenty of failures of moving object tracking. To overcome this problem, we propose a novel moving object tracking scheme based on polynomial regression prediction in sparse sensor networks. The proposed scheme activates the minimum sensor nodes by predicting the trajectory of an object based on polynomial regression analysis. Moreover, in the case of the failure of moving object tracking, it just activates only the boundary nodes of a hole for failure recovery. By doing so, the proposed scheme reduces the energy consumption and ensures the high accuracy for object tracking in the sensor network with holes. To show the superiority of our proposed scheme, we compare it with the existing scheme. Our experimental results show that our proposed scheme reduces about 47% energy consumption for object tracking over the existing scheme and achieves about 91% accuracy of object tracking even in sensor networks with holes.