• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.337-346
• /
• 2006

In order to analyze the behavior of moving objects, a measure for determining the similarity of trajectories needs to be defined. Although research has been conducted that retrieved similar trajectories of moving objects in Euclidean space, very little research has been conducted on moving objects in the space defined by road networks. In terms of real applications, most moving objects are located in road network space rather than in Euclidean space. In similarity measure between trajectories, however, previous methods were based on Euclidean distance and only considered spatial similarity. In this paper, we define similarity measure based on POI and TOI in road network space. With this definition, we present methods to retrieve similar trajectories using spatio-temporal similarity between trajectories. We show clustering results for similar trajectories. Experimental results show that similar trajectories searched by each method and consistency rate between each method for the searched trajectories.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.287-296
• /
• 2004

Recently, various location-based services are becoming very popular in mobile environments. In this paper, we propose a new concept of a frequent item set, called “associative class set”, for supporting the location-based service which uses a large quantity of a spatial database in mobile computing environments, and then present a new method for efficiently generating the associative class set. The associative class set is generated with considering the temporal relation of queries, the spatial distance of required objects, and access patterns of users. The result of our research can play a fundamental role in efficiently supporting location-based services and in overcoming the limitation of mobile environments. The associative class set can be applied by a recommendation system of a geographic information system in mobile computing environments, mobile advertisement, city development planning, and client cache police of mobile users.

• Korean Journal of Cognitive Science
• /
• v.33 no.2
• /
• pp.109-133
• /
• 2022

Episodic memory consists of a core event and the associated contexts. Although the role of the hippocampus and its neighboring regions in contextual representations during encoding has become increasingly evident, it remains unclear how these regions handle various context-specific information other than spatio-temporal contexts. Using high-resolution functional MRI, we explored the patterns of the medial temporal lobe (MTL) and cortical regions' involvement during the encoding of various types of contextual information (i.e., journalism principle 5W1H): "Who did it?," "Why did it happen?," "What happened?," "When did it happen?," "Where did it happen?," and "How did it happen?" Participants answered six different contextual questions while looking at simple experimental events consisting of two faces with one object on the screen. The MTL was divided to sub-regions by hierarchical clustering from resting-state data. General linear model analyses revealed a stronger activation of MTL sub-regions, the prefrontal lobe (PFC), and the inferior parietal lobule (IPL) during social (Who), behavioral (How), and intentional (Why) contextual processing when compared with spatio-temporal (Where/When) contextual processing. To further investigate the functional networks involved in contextual encoding dissociation, a multivariate pattern analysis was conducted with features selected as the task-based connectivity links between the hippocampal subfields and PFC/IPL. Each social, behavioral, and intentional contextual processing was individually and successfully classified from spatio-temporal contextual processing, respectively. Thus, specific contexts in episodic memory, namely social, behavior, and intention, involve distinct functional connectivity patterns that are distinct from those for spatio-temporal contextual memory.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.2
• /
• pp.44-54
• /
• 2005

In this study the tidal area in Seo han bay, North Korea was detected and extracted by using various satellite images (ASTER, KOMPSAT EOC, Landsat TM/ETM+) and GIS spatial analysis. Especially, the micro-landform was classified through the spectral characteristic of each satellite image and the change of tidal flat size was detected on passing year. For this, the spectral characteristics of eight tidal flat area in Korea, which are called as Seo han bay, Gwang ryang bay, Hae iu bay, Gang hwa bay, A san bay, Garorim bay, Jul po bay and Soon chun bay, were analyzed by using multi band of multi spectral satellite images such as Landsat TM/ETM+. Moreover, the micro-landform tidal flat in Seo han bay, North Korea was extracted by using ISODATA clustering based on the result of spectral characteristic. In addition, in order to detect the change of tidal flat size on passing years, the ancient topography map (1918-1920) was constructed as GIS DB. Also, the tidal flat distribution map based on the temporal satellite images were constructed to detect the tidal flat size for recent years. Through this, the efficient band to classify the micro-landform and detect its boundary was clarified and one possibility of KOMPSAT EOC application could be also introduced by extracting the spatial information of tidal flat efficiently.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.107-114
• /
• 2002

In these days, rapid advances of the computer system and the high speed network have made the multimedia services popularized among various applications and services in the internet. Internet live broadcasting, a part of multimedia services, makes it possible to provide not only existing broadcasting services including audio and video but also interactive communications which also expand application scopes by freeing from both temporal and spatial limitation. In the Paper, an interned Personal-live broadcasting server system is developed by allowing individual users to actively create or join live-broadcasting services with such basic multimedia devices as a PC camera and a sound card. As the number of broadcasters and participants increases, concurrent multiple channels are established and groups are to be expanded. The system should also guarantee High Availability (HA) for continuous services even in the presence of partial failure of the cluster. Furthermore, a transmission mode switching is supported to consider network environments in the user system.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.157-157
• /
• 1999

Researches on the gesture recognition have become a very interesting topic in the computer vision area, Gesture recognition from visual images has a number of potential applicationssuch as HCI (Human Computer Interaction), VR(Virtual Reality), machine vision. To overcome thetechnical barriers in visual processing, conventional approaches have employed cumbersome devicessuch as datagloves or color marked gloves. In this research, we capture gesture images without usingexternal devices and generate a gesture trajectery composed of point-tokens. The trajectory Is spottedusing phase-based velocity constraints and recognized using the discrete left-right HMM. Inputvectors to the HMM are obtained by using the LBG clustering algorithm on a polar-coordinate spacewhere point-tokens on the Cartesian space .are converted. A gesture vocabulary is composed oftwenty-two dynamic hand gestures for editing drawing elements. In our experiment, one hundred dataper gesture are collected from twenty persons, Fifty data are used for training and another fifty datafor recognition experiment. The recognition result shows about 95% recognition rate and also thepossibility that these results can be applied to several potential systems operated by gestures. Thedeveloped system is running in real time for editing basic graphic primitives in the hardwareenvironments of a Pentium-pro (200 MHz), a Matrox Meteor graphic board and a CCD camera, anda Window95 and Visual C++ software environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.35-38
• /
• 2009

The paper presents an effective method to detect fire in video surveillance and monitoring system. The main contribution of this work is that we successfully use the Hidden Markov Models in the process of detecting the fire with a few preprocessing steps. First, the moving pixels detected from image difference, the color values obtained from the fire flames, and their pixels clustering are applied to obtain the image regions labeled as fire candidates; secondly, utilizing massive training data, including fire videos and non-fire videos, creates the Hidden Markov Models of fire and non-fire, which are used to make the final decision that whether the frame of the real-time video has fire or not in both temporal and spatial analysis. Experimental results demonstrate that it is not only robust but also has a very low false alarm rate, furthermore, on the ground that the HMM training which takes up the most time of our whole procedure is off-line calculated, the real-time detection and alarm can be well implemented when compared with the other existing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.141-148
• /
• 2011

Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.3
• /
• pp.39-53
• /
• 2014

The Korean population is aging rapidly and a disproportionate share of older people(aged 65 and older) lives in rural areas. The rural population is aging more rapidly than the population in urban area. However, the majority of studies on aging population focuses on an urban area rather than a rural area. Rural areas have been alienated from the priority of the national policy. For these reasons, this study is to show the level of population aging and to analyze the spatial spillover patterns of aging population in rural areas for the establishment of localized policy on population aging. The main findings of this study can be summarized as follows. First, the level of population aging varies in different localities such as socio-economic and locational characteristics. Secondly, there are distinct differences between hot spot region(clustering of high aging index) and cold spot region(clustering of low aging index) in spatio-temporal spillover patterns. This study intends to suggest an useful information to establish the area-specific policy on aging population through the results of analysis.

• Journal of Korean Society of Forest Science
• /
• v.83 no.4
• /
• pp.441-449
• /
• 1994

The two reflective channels(red and near infrared spectrum) of advanced very high resolution radiometer(AVHRR) data were used to classify primary vegetation cover types in the Korean Peninsula. From the NOAA-11 satellite data archive of 1991, 27 daytime scenes of relatively minimum cloud coverage were obtained. After the initial radiometric calibration, normalized difference vegetation index(NDVI) was calculated for each of the 27 data sets. Four or five daily NDVI data were then overlaid for each of the six months starting from February to November and the maximum value of NDVI was retained for every pixel location to make a monthly composite. The six bands of monthly NDVI composite were nearly cloud free and used for the computer classification of vegetation cover. Based on the temporal signatures of different vegetation cover types, which were generated by an unsupervised block clustering algorithm, every pixel was classified into one of the six cover type categories. The classification result was evaluated by both qualitative interpretation and quantitative comparison with existing forest statistics. Considering frequent data acquisition, low data cost and volume, and large area coverage, it is believed that AVHRR data are effective for vegetation cover type mapping at regional scale.