• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.1013-1022
• /
• 2003

This paper implemented the real-time object tracking algorithm that extracts and tracks the moving object adaptively to input frame sequence by using non-parametric image processing method and Kalman filter-based dynamic AR(2) process method. By applying non-parametric image processing to input frames, the moving object was extracted from the background adaptively to diverse environmental conditions. And the movement of object was able to be adaptively estimated and tracked by modeling the various movement of object as dynamic AR(2) process and estimating based on the Kalman filter the parameters of AR(2) process dynamically changing along time. The experiments of the implemented object tracking system showed that the proposed method tracked the moving object as more approximately as the estimation error became about l/2.5∼1/50 of one of the traditional tracking method based on linear Kalman filter.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2002

In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.179-186
• /
• 2008

The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.2D
• /
• pp.113-118
• /
• 2010

This paper presents an analysis of the instability phenomenon on motorways, with the aim of arriving at the definition of a control strategy suitable for keeping the flow stable. By using some results of the motorway reliability theory, a relationship and some flow characteristics is obtained, which shows that the existence of a reliability threshold critical for flow stability. The macroscopic flow characteristics corresponding to this threshold are very different in different situations, so that this control of flow stability requires the analysis of speed and density microscopic process surveyed on a cross section of the motorway carriage ways to be controlled. A method is presented, based on integrated moving average(IMA) analysis in real time of these processes, by which it is possible to detect the approach of instability before its effects become manifest, and to single out the proper control strategy in different situations.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.84-97
• /
• 2007

Selectivity estimation techniques in query optimization have been used in commercial databases and histograms are popularly used for the selectivity estimation. Recently, the techniques for spatio-temporal databases have been restricted to existing temporal and spatial databases. In addition, the selectivity estimation techniques focused on time-series data such as moving objects. It is also impossible to estimate selectivity for range queries with a time interval. Therefore, we construct two histograms, CMH (current multidimensional histogram) and PMH (past multidimensional histogram), to estimate the selectivity of multidimensional sequence data in spatio-temporal databases and propose effective selectivity estimation methods using the histograms. Furthermore, we solve a problem about the range query using our proposed histograms. We evaluated the effectiveness of histograms for range queries with a time interval through various experimental results.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.381-392
• /
• 2002

This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searches for the (sub)sequences whose shapes are similar to that of a given query sequence regardless of their actual element values. In this paper, we propose an effective and efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval based on the similarity model, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup up to around 66 times compared with the sequential scan method.

• Cartoon and Animation Studies
• /
• s.46
• /
• pp.107-128
• /
• 2017

Time is an indispensable element in creating a story. This makes comics artists use various time techniques such as prolepsis, summary, ellipsis and flashback to increase immersion in story when they create comics. This is intended to make a study on retrospective structure among various temporal structures. Retrospective structure means progress in different time sequence, and increases immersion by making readers become strained or relaxed. Besides, retrospective structure plays a role of increasing or decreasing the pace of story. The person who systematically put the retrospective structure into shape is $G\acute{e}rard$ Genette. He in his book "Narrative Discourse" classified retrospective structure into three types. These are made up of structure of analepse externes, analepse internes and analepse mixted. This makes a study on retrospective structure in narrative comics based on $G\acute{e}rard$ Genette's retrospective structure. To this end, Kang Full's webtoon was analyzed. The reason to analyze Kang Full's is that this work has storyline where things happening in parental generation is interwined with things in offspring generation, accordingly this is work suitable for studying the retrospective structure. This study is intended to examine whether three retrospective structures suggested by $G\acute{e}rard$ Genette are actually used through an analysis of , and as a result, it is intended to prove the fact that retrospective structure has an effect on immersion in work.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.470-473
• /
• 1990

In this thesis, the recognition method of the movement of an 3D object is presented. The information about the movement of a 3D object is used to recognize the object. There are 2 kinds of movements which are translation and rotation. A difference picture is obtained from a sequence of images of a moving object or a scene which is taken by a monocular stationary observer. The 3D movement of an object is recognized by the Artificial Neural Network(ANN) using the difference picture.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.520-522
• /
• 2004

In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. Sonar ranger is useful to get obstacle information and RAS may be a good solution for path planning.