• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.105-114
• /
• 2009

Recently, location-based services which provides k nearest POIs, e.g., gas stations, restaurants and banks, are essential such applications as telematics, ITS(Intelligent Transport Systems) and kiosk. For this, the Voronoi Diagram k-NN(Nearest Neighbor) search algorithm has been proposed. It retrieves k-NNs by using a file storing pre-computed network distances of POIs in Voronoi diagram. However, this algorithm causes the cost problem when expanding a Voronoi diagram. Therefore, in this paper, we propose an algorithm which generates a matrix of the shortest distance between border points of a Voronoi diagram. The shortest distance is measured each border point to all of the rest border points of a Voronoi Diagram. To retrieve desired k nearest POIs, we also propose a k-NN search algorithm using the matrix of the shortest distance. The proposed algorithms can m inim ize the cost of expanding the Voronoi diagram by accessing the pre-computed matrix of the shortest distances between border points. In addition, we show that the proposed algorithm has better performance in terms of retrieval time, compared with existing works.

• Spatial Information Research
• /
• v.16 no.1
• /
• pp.65-77
• /
• 2008

There have been many studies and technologies that define a current location of a moving vehicle with GPS(Global Positioning System). However, the navigation system with GPS has troubles to search an optimized route considering data such as realtime parking status and road conditions. Moreover, the GPS systems show malfunction in the downtown with very tall buildings, underground parking lot and the inside of buildings. On the contrary, the RFID systems are able to reflect real-time status of parking lots and roads in the downtown. This paper proposes a system of guiding path for parking lots to consider real-time constraints based on RFID. The results obtained from the implemented system show smooth guiding of a new route after immediately sensoring the change of the information of parking lots and roads: if a parking lot that a vehicle is heading to is fully occupied, the system re-searches a new route for a neighbor parking lot and immediately transfers it to customer's mobile, and if the designated route is under construction, the system guides a detour path. The proposed method will be useful for advanced integrated parking control system.

• Journal of Korean Association for Spatial Structures
• /
• v.5 no.3 s.17
• /
• pp.75-82
• /
• 2005

The conceptual structural design consists of selecting structural material and form of the building, producing a preliminary dimensional layout. The information such as height of the building use, typical live load, wind velocity, design acceleration, maximum lateral deflection, span, story height is a important factor in conceptual design phase. In this case, the knowledge solutions for past similar problems cam be used in the process of defining and finding a solution to the design problems. In this paper, the conceptual structural design method using case-based reasoning which is intended to assist engineers in the conceptual phase of the structural design of tall buildings is introduced. Inductive retrieval method and nearest-neighbor retrieval method are used for selecting structural system and similar design case, respectively.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.209-212
• /
• 2007

Digital images are corrupted by noises, during signal acquisition and transmission. Amount those noises, additive white Gaussian noise (AWGN) and impulse noise are most representative. The conventional image restoration algorithms are mostly taken in simple noise environment, but they didn't perform very well in tempter noises environment. So a modified image restoration algorithm, which can remove complex noises by using the intensity differences and spatial distances between center pixel and its neighbor pixels as parameters, is proposed in this paper. Simulation results demonstrate that the proposed algorithm can't only remove AWGN and impulse noise separately, but also performs well in preserving details of images as edge.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.7
• /
• pp.769-774
• /
• 2015

Sensor network as an infrastructure of IoT(Internet of Things) has reliability issue because sensor nodes have limited memory as well as bounded battery. To improve the reliability of network, this paper proposes a data distribution scheme. The proposed algorithm distributes the data which each sensor node periodically produces into neighbor nodes that have enough memory as well as battery. This distribution process goes on more than 1 hop for overcoming unexpected spatial crash. Through simulation, we have confirmed that the proposed scheme can improve the resilience of IoT without affecting the life time of sensor network.

• Ocean and Polar Research
• /
• v.36 no.2
• /
• pp.189-197
• /
• 2014

The pearl-spot damsel, Chromis notata, is one of the important fishery species in Korea. While C. notata has been commonly harvested in southern Korea, the increasing number of C. notata in higher latitudes has crucial ecological, economic and evolutionary implications under conditions where the climate is rapidly changing. Here we examined the morphological and genetic characteristics of C. notata to assess patterns of geographical variations among the groups from three different sites. The groups were clearly distinguishable in the analysis of morphological characteristics. On the other hand, the groups were genetically indistinguishable. All individuals fell within a single clade in the neighbor-joining tree but appeared scattered in the haplotype network. Several haplotypes are shared among the sampling sites (Jejudo-Ulleungdo; Hap 9, Wangdolcho-Ulleungdo; Hap 28, Hap 33, Hap 34). Although control region markers did not elucidate the spatial patterns in genetic characteristics, Wangdolcho and Ulleungdo groups appear to exhibit a more robust gene flow between the two groups than with Jejudo group. Integrative approaches such as those combining morphological and genetic analyses minimize potential errors caused by limited perspectives of each analysis and can provide useful information for discovering functional DNA regions attributable to morphological characteristics expressions.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.10 no.6
• /
• pp.120-129
• /
• 2007

Rapid urbanization has transformed the spatial pattern of urban land use or cover. This paper concentrates that changed characteristics of landscape structure in the Tancheon Watershed, from 1995 to 2003 were investigated using land cover map. We used FRAGSTATS software to calculate landscape indices to characterize the landscape structure. We found that built up area has been increased rapidly during the study period, while cultivated area and forest area have been decreased rapidly in the same period. From 1995 to 2003, built up area was increased from 19.73% to 39.62% and cultivated area and forest area was decreased 17.60% to 5.97% and 58.31% to 49.41%. Number of patches, mean euclidean nearest-neighbor distance, contagion index, Shannon's diversity index increased considerably from 1995 to 2003, also suggesting the landscape in the study area became more fragmented and heterogeneous. but because of continuously fragmentation, landscape became homogeneity. The study demonstrates that landscape metrics can be a useful indicator in landscape monitoring and landscape assessment.

• Journal of Korea Game Society
• /
• v.11 no.5
• /
• pp.23-30
• /
• 2011

Flocking behaviors are frequently used in games and computer graphics for realistic simulation of massive crowds. Since simulation of massive crowds in real time is a computationally intensive task, there were many researches on efficient algorithm. In this paper, we find experimentally the fact that there are unnecessary computations in the previous efficient flocking algorithm, and propose a noble algorithm that overcomes the weakness of the previous algorithm with a simple heuristic. A number of experiments were conducted to evaluate the performance of the proposed algorithm. The experimental results showed that the proposed algorithm outperformed the previous efficient algorithm by about 21% on average.

• Korean Journal of Remote Sensing
• /
• v.25 no.3
• /
• pp.295-309
• /
• 2009

In this study, an iterative maximum a posteriori (MAP) approach using a Bayesian model of Markovrandom field (MRF) was proposed for despeckling images that contains speckle. Image process is assumed to combine the random fields associated with the observed intensity process and the image texture process respectively. The objective measure for determining the optimal restoration of this "double compound stochastic" image process is based on Bayes' theorem, and the MAP estimation employs the Point-Jacobian iteration to obtain the optimal solution. In the proposed algorithm, MRF is used to quantify the spatial interaction probabilistically, that is, to provide a type of prior information on the image texture and the neighbor window of any size is defined for contextual information on a local region. However, the window of a certain size would result in using wrong information for the estimation from adjacent regions with different characteristics at the pixels close to or on boundary. To overcome this problem, the new method is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The proximity to boundary is estimated using a non-uniformity measurement based on standard deviation of local region. The new scheme has been extensively evaluated using simulation data, and the experimental results show a considerable improvement in despeckling the images that contain speckle.