• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.37-48
• /
• 2010

In this paper, we analyze the shortcomings of the previous declustering methods, which are based on grid-like partitioning and a mapping function from a cell to a disk number, for high-dimensional space and propose a solution. The problems arise from the fact that the number of splitting is small(for the most part, binary-partitioning is sufficient), and the side length of a range query whose selectivity is small is quite large. To solve this problem, we propose a mathematical model to estimate the performance of a grid-like partitioning method. With the proposed estimation model, we can choose a good grid-like partitioning method among the possible schemes and this results in overall improvement in declustering performance. Several experimental results show that we can improve the performance of a previous declustering method up to 2.7 times.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Journal of KIBIM
• /
• v.10 no.4
• /
• pp.32-39
• /
• 2020

In recent years, the construction industry is getting bigger and more complex, so it is becoming difficult to acquire point cloud data for construction equipments and workers. Point cloud data is measured using a drone and MMS(Mobile Mapping System), and the collected point cloud data is used to create a 3D digital map. In particular, the construction site is located at outdoors and there are many irregular terrains, making it difficult to collect point cloud data. For these reasons, adopting a noise reduction algorithm suitable for the characteristics of the construction industry can affect the improvement of the analysis accuracy of digital maps. This is related to various environments and variables of the construction site. Therefore, this study reviewed and analyzed the existing research and techniques on the noise reduction algorithm. And based on the results of literature review, performance evaluation of major noise reduction algorithms was conducted for digital maps of construction sites. As a result of the performance evaluation in this study, the voxel grid algorithm showed relatively less execution time than the statistical outlier removal algorithm. In addition, analysis results in slope, space, and earth walls of the construction site digital map showed that the voxel grid algorithm was relatively superior to the statistical outlier removal algorithm and that the noise removal performance of voxel grid algorithm was superior and the object preservation ability was also superior. In the future, based on the results reviewed through the performance evaluation of the noise reduction algorithm of this study, we will develop a noise reduction algorithm for 3D point cloud data that reflects the characteristics of the construction site.

• Journal of the Korean Geographical Society
• /
• v.46 no.1
• /
• pp.67-80
• /
• 2011

Choropleth mapping of population distribution is based on the assumption that people are uniformly distributed throughout each enumeration unit. Dasymetric mapping technique improves choropleth mapping by refining spatially aggregated data with residential information. Further, pycnophylactic interpolation can upgrade dasymetric mapping by considering population distribution of neighboring areas, while preserving the volumes of original units. This study proposed a combined solution of dasymetric mapping and pycnophylactic interpolation to improve the accuracy of population density distribution. Specifically, the dasymetric method accounts for the spatial distribution of population within each census unit, while pycnophylactic interpolation considers population distribution of neighboring area. This technique is demonstrated with 1990 census data of the Athens, GA. with land use land cover information derived from remotely-sensed imagery for the areal extent of populated areas. The results are evaluated by comparison between original population counts of smaller census units (census block groups) and population counts of the grid map built from larger units (census tracts) aggregated to the same areal units. The estimated populations indicate a satisfactory level of accuracy. Population distribution acquired by the suggested method can be re-aggregated to any type of geographic boundaries such as electoral boundaries, school districts, and even watershed for a variety of applications.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2007.06a
• /
• pp.203-208
• /
• 2007

Due to the long tectonic history and the very complex geologic formations in Korea, the anisotropic characteristics of subsurface material may often change very greatly and locally. The algorithms for the travel time computation commonly used, however, may not give sufficiently precise results particularly for the complex and strong anisotropic model, since they are based on the two-dimensional (2D) earth and/or weak anisotropy assumptions. This study is intended to develope a three-dimensional (3D) modeling algorithm to precisely calculate the first arrival time in the complex anisotropic media. We assume 3D TTI (tilted transversely isotropy) medium having the arbitrary symmetry axis. The algorithm includes the 2D non-linear interpolation scheme to calculate the traveltimes inside the grid and the 3D traveltime mapping to fill the 3D model with first arrival times. The weak anisotropy assumption, moreover, can be overcome through devising a numerical approach of the steepest descent method in the calculation of minimum traveltime, instead of using approximate solution.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.11 no.2
• /
• pp.72-78
• /
• 2009

The demand for rainfall data in gridded digital formats has increased in recent years due to the close linkage between hydrological models and decision support systems using the geographic information system. One of the most widely used tools for digital rainfall mapping is the PRISM (parameter-elevation regressions on independent slopes model) which uses point data (rain gauge stations), a digital elevation model (DEM), and other spatial datasets to generate repeatable estimates of monthly and annual precipitation. In the PRISM, rain gauge stations are assigned with weights that account for other climatically important factors besides elevation, and aspects and the topographic exposure are simulated by dividing the terrain into topographic facets. The size of facet or grid cell resolution is determined by the density of rain gauge stations and a $5{\times}5km$ grid cell is considered as the lowest limit under the situation in Korea. The PRISM algorithms using a 270m DEM for South Korea were implemented in a script language environment (Python) and relevant weights for each 270m grid cell were derived from the monthly data from 432 official rain gauge stations. Weighted monthly precipitation data from at least 5 nearby stations for each grid cell were regressed to the elevation and the selected linear regression equations with the 270m DEM were used to generate a digital precipitation map of South Korea at 270m resolution. Among 1.25 million grid cells, precipitation estimates at 166 cells, where the measurements were made by the Korea Water Corporation rain gauge network, were extracted and the monthly estimation errors were evaluated. An average of 10% reduction in the root mean square error (RMSE) was found for any months with more than 100mm monthly precipitation compared to the RMSE associated with the original 5km PRISM estimates. This modified PRISM may be used for rainfall mapping in rainy season (May to September) at much higher spatial resolution than the original PRISM without losing the data accuracy.

• The Journal of Korea Robotics Society
• /
• v.9 no.3
• /
• pp.154-159
• /
• 2014

The Global Positioning System (GPS) is widely used to aid the navigation of aerial vehicles. However, the GPS cannot be used indoors, so alternative navigation methods are needed to be developed for micro aerial vehicles (MAVs) flying in GPS-denied environments. In this paper, a real-time three-dimensional (3-D) indoor navigation system and closed-loop control of a quad-rotor aerial vehicle equipped with an inertial measurement unit (IMU) and a low-cost light detection and ranging (LIDAR) is presented. In order to estimate the pose of the vehicle equipped with the two-dimensional LIDAR, an octree-based grid map and Monte-Carlo Localization (MCL) are adopted. The navigation results using the MCL are then evaluated by making a comparison with a motion capture system. Finally, the results are used for closed-loop control in order to validate its positioning accuracy during procedures for stable hovering and waypoint-following.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.841-849
• /
• 2008

Natural disaster such as inundation due to the typhoon induced storm-surge has inflicted severe losses on the coastal area. The problem of global warming and sea surface rising has issued and thus influences the increase of frequency and potential power of storm-surge. What we can do is to make intelligent effort to predict and prevent the losses through the early warning and prevention activity from the accurate prediction and forecasting about the time-varying storm-surge height and its arriving time resulted from the numerical simulation with sea observations. In this paper, we developed the web service based GIS-Enabled storm-surge visualization system to predict and prevent the storm-surge disasters. Moreover. for more accurate topography around coastal area and fine-grid storm-surge numerical model, we have accomplished GIS-based coastal mapping through LiDAR measurement.

• The Journal of the Korea Contents Association
• /
• v.19 no.3
• /
• pp.72-79
• /
• 2019

Autonomous locomotion has two essential functionalities: mapping builds and updates maps by uncertain position information and measured sensor inputs, and localization is to find the positional information with the inaccurate map and the sensor information. In addition, obstacle detection, avoidance, and path designs are necessarily required for autonomous locomotion by combining the probabilistic methods based on uncertain locations. The sensory inputs, which are measured by a metric-based scanner, have difficulties of distinguishing moving obstacles like humans from static objects like walls in given environments. This paper proposes the low resolution grid map combined with reinforcement learning, which is compared with the conventional recognition method for detecting static and moving objects to generate obstacle avoiding path. Finally, the proposed method is verified with experimental results.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.76-83
• /
• 1996

A three dimensional FE mesh generation scheme based on mapping approach is proposed in this study. A volume in Eucledian space is represented by composite hyperpatches which are piecewise cubic functions in parameters u, v, w. A key idea in the proposed approach is that I sampled grid data points lying only on the boundary surfaces are needed for the shape representation. Inner points which are necessary to form a hyperpatch are internally generated by Coons patches. This approach is most appropriate for the shapes which are compositions of hexahedronlike shapes and also severely curved.