• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2669-2688
• /
• 2016

An efficient and effective unsupervised single moving object detection framework is presented in this paper. Given the sparsely labelled trajectory points, we adopt a coarse-to-fine strategy to detect and segment the foreground from the background. The superpixel level coarse segmentation reduces the complexity of subsequent processing, and the pixel level refinement improves the segmentation accuracy. A distance measurement is devised in the coarse segmentation stage to measure the similarities between generated superpixels, which can then be used for clustering. Moreover, a Quadmap is introduced to facilitate the refinement in the fine segmentation stage. According to the experiments, our algorithm is effective and efficient, and favorable results can be achieved compared with state-of-the-art methods.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.67-79
• /
• 2005

For tracing tag locations, the trajectories should be modeled and indexed in a radio frequency identification (RFID) system. The trajectory of a tag is represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as intervals and new index scheme called the Interval R-tree. We also propose new insert and split algorithms to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with the R-tree and the R*-tree. Our experiments show that the new index scheme outperforms the other two in processing queries of tags on various datasets.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.177-180
• /
• 2006

In this paper we proposed a method of automatic point segmentation acquired by 2D laser scanner to recognize moving objects. Recently, Laser scanner is noticed as a new method in the field of close range 3D modeling. But the majority of the researches are pointed on precise 3D modeling of static objects using expensive 3D laser scanner. 2D laser scanner is relatively cheap and can obtain 2D coordinate information of moving object's surface or can be utilized as 3D laser scanner by rotating the system body. In these reasons, some researches are in progress, which are adopting 2D laser scanner to robot control systems or detection of objects moving along linear trajectory. In our study, we automatically segmented point data of 2D laser scanner thus we could recognize each of the object passing through a section.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.878-881
• /
• 2008

To index the object's trajectory is an important aspect in moving object database management. This paper implements an optimizing index structure named Rend 3D R-tree based on 3D R-Tree. This paper demonstrates the time period update method to reconstruct the MBR for the moving objects in order to decrease the dead space that is produced in the closed time dimension of the 3D R-tree, then a rend method is introduced for indexing both current data and history data. The result of experiments illustrates that given methods outperforms 3D R-Tree and LUR tree in query processes.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.101-110
• /
• 2006

ADevelopment of various geographic observations, GPS, and Wireless Communication technologies make it easy to control many moving objects and to build an intelligent transport system and transport vehicle management system. However it is difficult to make a suitable system in the real world with a variety of tests to evaluate the performance fairly because real vehicle data are not enough as evaluating and testing the transport plan in the system. Therefore some moving object data generator would be used in most researches. However they can not generate vehicle trajectory according to a user scenario defined to be applied to transport plan, because the existing data generators consider only a gauss distribution, road network. In this paper we design and implement a vehicle data generator for creating vehicle trajectory data based on the user-defined scenario. The designed data generator could make the vehicle location depending on user's transport plan. Besides we store the scenario as patterns and reutilize the used scenario.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1828-1831
• /
• 1997

this paper, to represent the robot motion approximately in space, delas with algorithm for position recognition of space robot, target and obstacle with vision system in 2-D. And also there are algorithms for precise distance-measuring and calibration usign laser displacement system, and for trajectory selection for optimizing moving to object, and for robot locomtion with air-thrust valve. And the software synthesizing of these algorithms hleps operator to realize the situation certainly and perform the job without any difficulty.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.72-75
• /
• 2005

Uncertainty of objects in Moving Object Database is a coherent property. It has been discussed in a lot of researches on modelling and query processing. The previous studies assume that uncertain future time is determined through utilizing recent speed and direction of vehicles. This method is simple and useful for estimating the time of the near future location. However, it is not appropriate when we estimate the time of the far future location. Therefore, in this paper, we propose a concept of planned route. It is used to estimate uncertain future time, which has to be located at a given point. If the route of an object is planned beforehand its locations are uncertainly distributed near that route. By a simple projection operation, the probability that a location lies in the planned route is increased. Moreover, we identify the future time of an object based on the speed for passing the route, which is offered via a website.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.142-148
• /
• 2014

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 1st order moment of moving objects. The center points of each object are managed by linked list. The descriptor includes the 1st order coordinates of moving object belong to neighbor of the pre-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.