• Title/Summary/Keyword: ? 궤적

Search Result 2,023, Processing Time 0.025 seconds

Performance Evaluation of Trajectory Clustering in Road Network Environment (도로 네트워크 환경을 위한 궤적 클러스터링의 성능 평가)

  • Baek, Ji-Haeng;Won, Jung-Im;Kim, Sang-Wook
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.06a
    • /
    • pp.97-100
    • /
    • 2008
  • 최근 궤적 정보를 이용한 많은 연구들이 진행되고 있으나, 이들 대부분의 연구는 유클리드 공간 내의 궤적들을 대상으로 하고 있다. 그러나 실제 응용에서 대부분의 이동 객체들은 도로 네트워크 공간상에 존재하므로, 유클리드 공간을 대상으로 한 연구들은 도로 네트워크 공간에 적용시키는 것은 적합하지 않다. 본 논문에서는 도로 네트워크 내 이동 객체들의 대용량 궤적 정보를 대상으로 제안된 선행 연구의 클러스터링 기법을 다양한 실험을 통하여 그 정확도를 검증한다. 실험 결과에 따르면 제안된 기법은 사람에 의하여 유사 궤적들을 클러스터링한 결과와 비교하여 95%이상의 높은 정확도를 보였다.

  • PDF

Dynamic Equations of Motion and Trajectory Optimization for the Mid-Altitude Unmanned Airship Platform (중고도 무인비행선의 궤적 생성을 위한 운동방정식 유도 및 궤적 최적화)

  • Lee, Sang-Jong;Bang, Hyo-Chung;Hong, Jin-Seong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.5
    • /
    • pp.46-55
    • /
    • 2006
  • In general, 3-dimensional point-mass equation has been widely used for the trajectory optimization of the fixed-wing aircraft and reentry vehicle. But it should be modified and represent target vehicle's own characteristics. For a lighter-than-air vehicle such as an airship, there exists different and peculiar flight characteristics compared with the aircraft. The first part of this paper is to derive the dynamic equation of motion for the mid-altitude unmanned airship and the second part is to obtain the optimal trajectories under the minimal time flight given constraints. The trajectory optimization problem is converted into the nonlinear programming problem using Sequential Quadratic Programming approach. Finally numerical solutions are presented in the last part of the paper.

Grid-based Similar Trajectory Search for Moving Objects on Road Network (공간 네트워크에서 이동 객체를 위한 그리드 기반 유사 궤적 검색)

  • Kim, Young-Chang;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.1
    • /
    • pp.29-40
    • /
    • 2008
  • With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.

  • PDF

Storing and Querying Trajectory Information on PostgreSQL/PostGIS (PostgreSQL/PostGIS 기반의 궤적 정보 저장 및 질의)

  • Yang, Pyoung-Woo;Lee, Yong-Mi;Lee, Yon-Sik;Nam, Kwang-Woo
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.57-64
    • /
    • 2011
  • This paper describes how to storing and querying trajectory information on PostgreSQL/PostGIS. Recently as technology of mobile devices is advancing, many researches for location-based services and moving object's trajectory have been studied. Trajectory is the set of information of the location by the time, and is one of the most im portant information for location-based services. Traditional spatial database systems do not support trajectory data types and functions. In this paper, we propose a trajectory data type and query functions for moving objects on PostgreSQL/PostGIS.

Detection of Moving Objects in Crowded Scenes using Trajectory Clustering via Conditional Random Fields Framework (Conditional Random Fields 구조에서 궤적군집화를 이용한 혼잡 영상의 이동 객체 검출)

  • Kim, Hyeong-Ki;Lee, Gwang-Gook;Kim, Whoi-Yul
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1128-1141
    • /
    • 2010
  • This paper proposes a method of moving object detection in crowded scene using clustered trajectory. Unlike previous appearance based approaches, the proposed method employes motion information only to isolate moving objects. In the proposed method, feature points are extracted from input frames first and then feature tracking is followed to create feature trajectories. Based on an assumption that feature points originated from the same objects shows similar motion as the object moves, the proposed method detects moving objects by clustering trajectories of similar motions. For this purpose an energy function based on spatial proximity, motion coherence, and temporal continuity is defined to measure the similarity between two trajectories and the clustering is achieved by minimizing the energy function in CRFs (conditional random fields). Compared to previous methods, which are unable to separate falsely merged trajectories during the clustering process, the proposed method is able to rearrange the falsely merged trajectories during iteration because the clustering is solved my energy minimization in CRFs. Experiment results with three different crowded scenes show about 94% detection rate with 7% false alarm rate.

Similar Sub-Trajectory Retrieval based on k-warping Algorithm for Moving Objects in Video Databases (비디오 데이타베이스에서 이동 객체를 위한 k-워핑 알고리즘 기반 유사 부분궤적 검색)

  • 심춘보;장재우
    • Journal of KIISE:Databases
    • /
    • v.30 no.1
    • /
    • pp.14-26
    • /
    • 2003
  • Moving objects' trajectories play an important role in indexing video data on their content and semantics for content-based video retrieval. In this paper, we propose new similar sub-trajectory retrieval schemes based on k-warping algorithm for efficient retrieval on moving objects' trajectories in video data. The proposed schemes are fixed-replication similar sub-trajectory retrieval(FRSR) and variable-replication similar sub-trajectory retrieval(VRSR). The former can replicate motions with a fixed number for all motions being composed of the trajectory. The latter can replicate motions with a variable number. Our schemes support multiple properties including direction, distance, and time interval as well as a single property of direction, which is mainly used for modeling moving objects' trajectories. Finally, we show from our experiment that our schemes outperform Li's scheme(no-warping) and Shan's scheme(infinite-warping) in terns of precision and recall measures.

Policies of Trajectory Clustering in Index based on R-trees for Moving Objects (이동체를 위한 R-트리 기반 색인에서의 궤적 클러스터링 정책)

  • Ban ChaeHoon;Kim JinGon;Jun BongGi;Hong BongHee
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.507-520
    • /
    • 2005
  • The R-trees are usually used for an index of trajectories in moving-objects databases. However, they need to access a number of nodes to trace same trajectories because of considering only a spatial proximity. Overlaps and dead spaces should be minimized to enhance the performance of range queries in moving-objects indexes. Trajectories of moving-objects should be preserved to enhance the performance of the trajectory queries. In this paper, we propose the TP3DR-tree(Trajectory Preserved 3DR-tree) using clusters of trajectories for range and trajectory queries. The TP3DR-tree uses two split policies: one is a spatial splitting that splits the same trajectory by clustering and the other is a time splitting that increases space utilization. In addition, we use connecting information in non-leaf nodes to enhance the performance of combined-queries. Our experiments show that the new index outperforms the others in processing queries on various datasets.

Detecting Road Intersections using Partially Similar Trajectories of Moving Objects (이동 객체의 부분 유사궤적 탐색을 활용한 교차로 검출 기법)

  • Park, Bokuk;Park, Jinkwan;Kim, Taeyong;Cho, Hwan-Gue
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.404-410
    • /
    • 2016
  • Automated road map generation poses significant research challenges since GPS-based navigation systems prevail in most general vehicles. This paper proposes an automated detecting method for intersection points using GPS vehicle trajectory data without any background digital map information. The proposed method exploits the fact that the trajectories are generally split into several branches at an intersection point. One problem in previous work on this intersection detecting is that those approaches require stopping points and direction changes for every testing vehicle. However our approach does not require such complex auxiliary information for intersection detecting. Our method is based on partial trajectory matching among trajectories since a set of incoming trajectories split other trajectory cluster branches at the intersection point. We tested our method on a real GPS data set with 1266 vehicles in Gangnam District, Seoul. Our experiment showed that the proposed method works well at some bigger intersection points in Gangnam. Our system scored 75% sensitivity and 78% specificity according to the test data. We believe that more GPS trajectory data would make our system more reliable and applicable in a practice.

A Study on Synthetic Flight Vehicle Trajectory Data Generation Using Time-series Generative Adversarial Network and Its Application to Trajectory Prediction of Flight Vehicles (시계열 생성적 적대 신경망을 이용한 비행체 궤적 합성 데이터 생성 및 비행체 궤적 예측에서의 활용에 관한 연구)

  • Park, In Hee;Lee, Chang Jin;Jung, Chanho
    • Journal of IKEEE
    • /
    • v.25 no.4
    • /
    • pp.766-769
    • /
    • 2021
  • In order to perform tasks such as design, control, optimization, and prediction of flight vehicle trajectories based on machine learning techniques including deep learning, a certain amount of flight vehicle trajectory data is required. However, there are cases in which it is difficult to secure more than a certain amount of flight vehicle trajectory data for various reasons. In such cases, synthetic data generation could be one way to make machine learning possible. In this paper, to explore this possibility, we generated and evaluated synthetic flight vehicle trajectory data using time-series generative adversarial neural network. In addition, various ablation studies (comparative experiments) were performed to explore the possibility of using synthetic data in the aircraft trajectory prediction task. The experimental results presented in this paper are expected to be of practical help to researchers who want to conduct research on the possibility of using synthetic data in the generation of synthetic flight vehicle trajectory data and the work related to flight vehicle trajectories.

다목적 실용위성 5호의 지상궤적 획득 및 유지를 위한 궤도조정 분석

  • Lee, Byeong-Seon;Hwang, Yu-Ra;Jeong, Ok-Cheol;Yun, Jae-Cheol
    • Bulletin of the Korean Space Science Society
    • /
    • 2011.04a
    • /
    • pp.25.1-25.1
    • /
    • 2011
  • 다목적 실용위성 5호는 국내 최초로 합성 개구면 레이더(SAR)를 장착한 지구 관측위성으로서 2011년 중반에 러시아의 Dnepr 로켓에 의해 발사되어 평균 고도 550 km의 태양동기 여명궤도에서 운용될 예정이다. 위성은 28일을 주기로 지구를 421회 공전하는 반복 지상궤적을 가지며 인터페로메트리 레이더 영상의 획득을 위해 위성이 지구적도 상공을 통과할 때 기준경도로부터 ${\pm}2$ km 이내로 지상궤적이 유지될 수 있도록 궤도조정을 수행한다. 위성은 궤도에 투입된 후 2개월 이내에 정상적인 지상궤적을 획득하고 몽골에 설치된 레이더 반사판을 이용하여 4개월에 걸친 검보정을 수행한 후에 정상적인 운용에 들어가게 된다. 이 연구에서는 위성이 발사체와 분리된 이후 정상적인 지상궤적을 획득하는데 걸리는 시간을 분석하고 위성의 지상궤적을 기준 경도로부터 ${\pm}2$ km 이내로 유지시키기 위한 궤도조정에 필요한 조정주기와 연료소모량을 분석한다.

  • PDF