• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.11a
• /
• pp.169-174
• /
• 2005

위치기반서비스(LBS)에서는 사람, 차량과 같은 이동체의 위치 정보를 획득하며, 이동객체 DBMS의 개발로 이동체가 움직인 궤적 정보를 효율적으로 저장 관리할 수 있다. 이동객체 DBMS에 저장된 이동체가 실제 움직인 과거 궤적정보는 다양한 형태로 가공되어 활용이 가능하다. 본 논문에서는 이동체의 과거 궤적정보를 이용하여 경로 안내를 위한 경로 산출 방법에 대하여 제안한다. 기존의 경로 안내는 교통정보 수집 장치를 통해 획득한 교통 정보를 이용하여 경로를 산출하는 방식이 많이 사용되고 있어, 교통 정보가 없는 곳에서는 단순 초행길 안내 수준이다. 그러나, 본 논문에서 제안하는 방법은 고비용이 소요되는 교통정보수집장치가 없는 곳에 대해서도 과거 차량의 움직인 궤적정보를 이용하여 보다 효율적인 경로 안내를 할 수 있는 장점이 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.418-421
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.99-110
• /
• 2009

Currently, there are many applications being developed based on sensor network technology. A tracking method for moving objects in sensor network is one of the main issue of this field. There is a little research on this issue, but most of the existing work has two problems. The first problem is a communication overhead for visiting sensor nodes many times to track a moving object. The second problem is an disability for dealing with many moving objects at a time. To resolve the problems, we, in this paper, propose a signature-based tracking method using efficient data aggregation for moving objects, called SigMO-TRK. For this, we first design a local routing hierarchy tree to aggregate moving objects' trajectories efficiently by using a space filtering technique. Secondly, we do the tracking of all trajectories of moving objects by using signature in a efficient way, our approach generates signatures to method. In addition, by extending the SigMO-TRK, we can retrieve the similar trajectories of moving objects for given a query. Finally, by using the TOSSIM simulator, we show that our signature-based tracking method outperforms the existing tracking method in terms of energy efficiency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.73-76
• /
• 2004

이동 객체 데이터베이스 시스템에서 시공간 조인은 이동 객체들의 결합을 위한 중요한 연산이다. 시공간 조인 연산의 실행 시간은 이동 객체의 수가 증가함에 따라 기하급수적으로 증가한다. 그러므로 효과적인 시공간 조인 연산이 필수적이다. 본 논문에서는 처음으로 이동 객체의 궤적에 대한 정보를 잘 유지하고 있는 시공간 색인인 TB-Tree를 이용한 시공간 조인에 대한 알고리즘들을 제시하고 구현한 알고리즘에 대한 실험 결과를 제시한다. 먼저 기본적인 알고리즘과 CPU의 실행 성능 향상을 위한 알고리즘을 기술하고 이동 객체 생성기를 통해 생성된 데이터 집합에 대한 실험을 실시한 결과를 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.913-924
• /
• 2000

This paper proposes an efficient descriptor for objects motion trajectory and a video retrieval algorithm based on objects motion trajectory. The algorithm describes parameters with coefficients of 2-order polynomial for objects motion trajectory after segmentation of the object from the scene. The algorithm also identifies types, intervals, and magnitude of global motion caused by camera motion and indexes them with 6-affine parameters. This paper implements content-based video retrieval using similarity-match between indexed parameters and queried ones for objects motion trajectory. The proposed algorithm will support not only faster retrieval for general videos but efficient operation for unmanned video surveillance system.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.497-501
• /
• 2009

'Digilog Book' integrates advantages of existing paper book and immersive digital contents in augmented reality environment, which enables users to feel physical touch and get additional multisensory feedback. As a high level authoring user interface, 'ARtalet' provides an intuitive way to make Digilog Book through 3D user interface in augmented reality environment. This paper mentions trajectory inserting and editing methods of 3D objects, then combining method of the trajectory. 3D object is selected by camera tracked prop, and then transformation matrix relative to book plane is stored in real time based on timeframe. The saved trajectory is managed as templates, and user can make various compositions of trajectories. We expect that suggested methods can enhance interest of readers.

• Journal of the Korea Convergence Society
• /
• v.10 no.4
• /
• pp.33-38
• /
• 2019

Recently, to support location-based services, there have been many researches which consider the spatial network. For this, there are many experimental data for data processing on the road network. However, the data to process the trajectory of moving objects are not suitable. Therefore, we propose index structure to process the trajectory data on the road network and the trajectory data generation algorithm. In addition, to prove efficiency of our index structure and algorithm, we show that edge-based trajectory data are generated through the proposed algorithm using the map data of San Francisco Bay.

• Spatial Information Research
• /
• v.16 no.3
• /
• pp.291-301
• /
• 2008

While most GIS are based on Euclidean space, cellular space can be used as an alternative type of space for a large number of GIS applications. In order to analyze the pattern of moving objects in cellular space, we need new definitions of similarity between their trajectories since the trajectory in cellular space significantly differs from those in Euclidean space. In this paper, we study the properties of moving objects in cellular space. Based on these observations, we propose several similarity measures between trajectories in cellular space. We analyze the difference of the proposed measures by experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.110-116
• /
• 2013

With the recent development of wireless network technologies, there have been increasing usage of variouse position base servies. Position based services basically collect position information of moving object for the utilization of them in real life. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. In the paper, we consider volume of Extended Minimum Bounding Rectangles(EMBR) to be determined by average size of range queries. We proposed the methode that split efficiently moving object with long distance between location, and split moving object for decrease searching space an Estimated-Split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.317-326
• /
• 2009

Recently, there have been many research efforts proposed on trajectory information. Most of them mainly focus their attention on those objects moving in Euclidean space. Many real-world applications such as telematics, however, deal with objects that move only over road networks, which are highly restricted for movement. Thus, the existing methods targeting Euclidean space cannot be directly applied to the road network space. This paper proposes a new clustering scheme for a large volume of trajectory information of objects moving over road networks. To the end, we first define a trajectory on a road network as a sequence of road segments a moving object has passed by. Next, we propose a similarity measurement scheme that judges the degree of similarity by considering the total length of matched road segments. Based on such similarity measurement, we propose a new clustering algorithm for trajectories by modifying and adjusting the FastMap and hierarchical clustering schemes. To evaluate the performance of the proposed clustering scheme, we also develop a trajectory generator considering the observation that most objects tend to move from the starting point to the destination point along their shortest path, and perform a variety of experiments using the trajectories thus generated. The performance result shows that our scheme has the accuracy of over 95% in comparison with that judged by human beings.