• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Journal of Korean Society of Water and Wastewater
• /
• v.37 no.5
• /
• pp.261-269
• /
• 2023

In light of recent social concerns related to issues such as water supply pipe deterioration leading to problems like leaks and degraded water quality, the significance of maintenance efforts to enhance water source quality and ensure a stable water supply has grown substantially. In this study, scan statistic was applied to analyze water quality complaints and water leakage accidents from 2015 to 2021 to present a reasonable method to identify areas requiring improvement in water management. SaTScan, a spatio-temporal statistical analysis program, and ArcGIS were used for spatial information analysis, and clusters with high relative risk (RR) were determined using the maximum log-likelihood ratio, relative risk, and Monte Carlo hypothesis test for I city, the target area. Specifically, in the case of water quality complaints, the analysis results were compared by distinguishing cases occurring before and after the onset of "red water." The period between 2015 and 2019 revealed that preceding the occurrence of red water, the leak cluster at location L2 posed a significantly higher risk (RR: 2.45) than other regions. As for water quality complaints, cluster C2 exhibited a notably elevated RR (RR: 2.21) and appeared concentrated in areas D and S, respectively. On the other hand, post-red water incidents of water quality complaints were predominantly concentrated in area S. The analysis found that the locations of complaint clusters were similar to those of red water incidents. Of these, cluster C7 exhibited a substantial RR of 4.58, signifying more than a twofold increase compared to pre-incident levels. A kernel density map analysis was performed using GIS to identify priority areas for waterworks management based on the central location of clusters and complaint cluster RR data.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.67-78
• /
• 2008

With the rapid development of wireless communication and mobile equipment, many applications for location-based services have been emerging. Moving objects such as vehicles and ships change their positions over time. Moving objects have their moving path, called the trajectory, because they move continuously. To monitor the trajectory of moving objects in a large scale database system, an efficient Indexing scheme to processed queries related to trajectories is required. In this paper, we focus on the issues of minimizing the dead space of index structures. The Minimum Bounding Boxes (MBBs) of non-leaf nodes in trajectory-preserving indexing schemes have large amounts of dead space since trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. In this thesis, we propose entry relocating techniques to reduce dead space and overlaps in non-leaf nodes. we present performance studies that compare the proposed index schemes with the TB-tree and the R*-tree under a varying set of spatio-temporal queries.

• Journal of Environmental Science International
• /
• v.23 no.4
• /
• pp.625-635
• /
• 2014

Temporal variation of groundwater levels in Jeju Island reveals time-delaying and dispersive process of recharge, mainly caused by the hydrogeological feature that thickness of the unsaturated zone is highly variable. Most groundwater flow models have limitations on delineating temporal variation of recharge, although it is a major component of the groundwater flow system. A new mathematical model was developed to generate time series of recharge from precipitation data. The model uses a convolution technique to simulate the time-delaying and dispersive process of recharge. The vertical velocity and the dispersivity are two parameters determining the time series of recharge for a given thickness of the unsaturated zone. The model determines two parameters by correlating the generated recharge time series with measured groundwater levels. The model was applied to observation wells of Jeju Island, and revealed distinctive variations of recharge depending on location of wells. The suggested model demonstrated capability of the convolution method in dealing with recharge undergoing the time-delaying and dispersive process. Therefore, it can be used in many groundwater flow models for generating a time series of recharge.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.9-17
• /
• 2006

Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.361-364
• /
• 2007

A small sized device with computing, communicating, sensing capability is changing our life. It will be deployed in the world and acquire a lot of data from the world. It is used for various applications such as military surveillance, environmental monitoring, structure health monitoring, building management, asset tracking, etc. In this paper we focus on USN middleware for asset tracking. A mobile asset is moving here and there within a specific area. The USN middleware tracks the mobile assets in real-time by using sensor nodes and notify their current positions to a user. To achieve the goal, the USN middleware provides some features related to the positions of mobile assets.. They are storing location data by using 3D indexing method, retrieving them by using spatio-temporal query, making trace of an asset, and retrieving the history data of an asset. In the paper, we developed USN middleware to adapt the requirements of asset tracking. It can help users increase the efficiency of their business related to mobile assets and make a valuable decision.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.371-384
• /
• 2019

Motion perception has been tremendously improved in neuroscience and computer vision. The baseline motion perception model is mediated by the dorsal visual pathway involving the cortex areas the primary visual cortex (V1) and the middle temporal (V5 or MT) visual area. However, few works have been done on the extension of neural models to improve the efficacy and robustness of motion perception of real sequences. To overcome shortcomings in situations, such as varying illumination and large displacement, an adaptive V1-MT motion perception (Ad-V1MTMP) algorithm enriched to deal with real sequences is proposed and analyzed. First, the total variation semi-norm model based on Gabor functions (TV-Gabor) for structure-texture decomposition is performed to manage the illumination and color changes. And then, we study the impact of image local context, which is processed in extra-striate visual areas II (V2), on spatial motion integration by MT neurons, and propose a V1-V2 method to extract the image contrast information at a given location. Furthermore, we take feedback inputs from V2 into account during the polling stage. To use the algorithm on natural scenes, finally, multi-scale approach has been used to handle the frequency range, and adaptive pyramidal decomposition and decomposed spatio-temporal filters have been used to diminish computational cost. Theoretical analysis and experimental results suggest the new Ad-V1MTMP algorithm which mimics human primary motion pathway has universal, effective and robust performance.

• Journal of Korea Water Resources Association
• /
• v.49 no.6
• /
• pp.469-480
• /
• 2016

The present study aims to develop a real-time surface image velocimeter (SIV) using an Android smartphone. It can measure river surface velocity by using its built-in sensors and processors. At first the SIV system figures out the location of the site using the GPS of the phone. It also measures the angles (pitch and roll) of the device by using its orientation sensors to determine the coordinate transform from the real world coordinates to image coordinates. The only parameter to be entered is the height of the phone from the water surface. After setting, the camera of the phone takes a series of images. With the help of OpenCV, and open source computer vision library, we split the frames of the video and analyzed the image frames to get the water surface velocity field. The image processing algorithm, similar to the traditional STIV (Spatio-Temporal Image Velocimeter), was based on a correlation analysis of spatio-temporal images. The SIV system can measure instantaneous velocity field (1 second averaged velocity field) once every 11 seconds. Averaging this instantaneous velocity measurement for sufficient amount of time, we can get an average velocity field. A series of tests performed in an experimental flume showed that the measurement system developed was greatly effective and convenient. The measured results by the system showed a maximum error of 13.9 % and average error less than 10 %, when we compared with the measurements by a traditional propeller velocimeter.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.3
• /
• pp.150-162
• /
• 2011

For the period between 1991 and 2009, the annual average of 448 forest fires occurred in Korea. Above all, approximately 94% of the total fires frequently occurred during the spring and fall seasons. Therefore, we need to minimize the damage of forest fire and manage them systematically. In this study, we analyzed the spatio-temporal distribution patterns for the frequency of forest fire occurrences by each city and gun during dry season between 1990s and 2000s using GIS. Then we compared to analyze the frequency of forest fire occurrence by ten-day intervals in 2000s with that in 1990s. As a result of analysis, early April showed the highest frequency of forest fire occurrence in both 1990s and 2000s. Compared to the 1990s and 2000s, the regional change of forest fire showed the most frequent fire events around Chungcheong province. Especially extra 27 fires increased in Daejeon city, and the second most frequent fire had more than 10 fires in Jeolla province and Incheon. However, the number of fire frequency decreased by 12 fires at the end of April in Hongcheon-gun(the province of Gangwon). This is the largest drop over the study period. We consider that this paper will utilize usefully to establish regional counterplan for forest fire prevention by understanding regional forest fire patterns from seasonal change.