• Journal of the Korean Geographical Society
• /
• v.39 no.5 s.104
• /
• pp.804-818
• /
• 2004

As spatial data resources become more abundant, the potential for conflict among them increases. Those conflicts can exist between two or many spatial datasets covering the same area and categories. Therefore, it becomes increasingly important to be able to effectively relate these spatial data sources with others then create new spatial datasets with matching geometry and topology. One extensive spatial dataset is US Census Bureau's TIGER file, which includes census tracts, block groups, and blocks. At present, however, census maps often carry information that conflicts with municipally-maintained detailed spatial information. Therefore, in order to fully utilize census maps and their valuable demographic and economic information, the locational information of the census maps must be reconciled with the more accurate municipally-maintained reference maps and imagery. This paper formulates a conceptual framework and two map models of map conflation to make geometrically and topologically consistent source maps according to the reference maps. The first model is based on the cell model of map in which a map is a cell complex consisting of 0-cells, 1-cells, and 2-cells. The second map model is based on a different set of primitive objects that remain homeomorphic even after map generalization. A new hierarchical based map conflation is also presented to be incorporated with physical, logical, and mathematical boundary and to reduce the complexity and computational load. Map conflation principles with iteration are formulated and census maps are used as a conflation example. They consist of attribute embedding, find meaning node, cartographic 0-cell match, cartographic 1-cell match, and map transformation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.141-142
• /
• 2012

본 논문에서는 시각 기반 증강현실 분야에서 추적 및 맵 구성이 단일 카메라로 구현이 가능한 PTAM의 효율적인 구현 및 응용 방법을 제시한다. 구현된 PTAM 시스템을 응용한 점진적 맵 생성 및 증강 공간 구성 시스템에 대해서도 설명한다. 구현에 있어서는 DirectX API에 기반을 두어 그래픽 하드웨어 가속 기능을 활용한다. 또한 구현된 PTAM 시스템에서의 상호작용이 가능한 응용 프로그램의 구성과 실험 결과를 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.798-801
• /
• 2014

여행 정보 시스템(ATIS), 교통 관리 시스템 (ITS) 등 궤적 기반 서비스에서, 서비스 품질을 향상시키기 위해서는 주어진 궤적 질의에 대한 정확한 주행시간을 예측하는 것이 필수적이다. 이를 위한 대표적인 공간 데이터 분석 기법으로는 데이터 분류에서 높은 정확도를 보장하는 규칙 기반 분류화 기법이 존재한다. 그러나 기존 규칙 기반 분류화 기법은 단일 컴퓨터 환경만을 고려하기 때문에, 대용량 공간 데이터 처리에 적합하지 않은 문제점이 존재한다. 이를 해결하기 위해, 본 연구에서는 맵리듀스 환경에서 규칙 기반 분류화를 이용한 궤적 데이터 주행 시간 예측 알고리즘을 개발하고자 한다. 제안하는 알고리즘은 첫째, 맵리듀스를 이용하여 대용량 공간 데이터를 병렬적으로 분석함으로써, 활용도 높은 궤적 데이터 규칙을 생성한다. 이를 통해 대용량 공간 데이터 기반의 규칙 생성 시간을 감소시킨다. 둘째, 그리드 구조 기반의 지도 데이터 분할을 통해, 사용자 질의처리 시 탐색 성능을 향상시킨다. 즉, 주행 시간 예측을 위한 규칙 그룹을 탐색 시 질의를 포함하는 그리드 셀만을 탐색하기 때문에, 질의처리 성능이 향상된다. 마지막으로 맵리듀스 구조에 적합한 질의처리 알고리즘을 설계하여, 효율적인 병렬 질의처리를 지원한다. 이를 위해 맵 함수에서는 선정된 그리드 셀에 대해, 질의에 포함된 도로 구간에서의 주행 시간을 병렬적으로 측정한다. 아울러 리듀스 함수에서는 출발 시간 및 구간별 주행 시간을 바탕으로 맵 함수의 결과를 병합함으로써, 최종 결과를 생성한다. 이를 통해 공간 빅데이터 분석을 통한 주행 시간 예측 기법의 처리 시간 및 결과 정확도를 향상시킨다.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.53-62
• /
• 2007

Although radiosity can represent diffuse reflections of the object surfaces by modeling energy exchange in 3D space, there are some restrictions for real-time applications because of its computation loads. Therefore, GPU(Graphics Processing Unit) based radiosity algorithms have been presented actively to improve its rendering performance. We implement the progressive refinement radiosity on GPU by G. Coombe in 3D scene that is constructed with HDR(High Dynamic Range) radiance map. This radiosity method can generate a photo-realistic rendering image in 3D space, where the synthetic objects were illuminated by the environmental light sources. In the simulation results, the rendering performance is analyzed according to the resolution of the texel in the environmental map and mipmaping. In addition, we compare the rendering results by our method with those by the incremental radiosity.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.7
• /
• pp.350-356
• /
• 2017

With increasing attention to real-time body detection, active research is being conducted on human body detection based on skin color. Despite this, most existing skin detection methods utilize static skin color models and have detection rates in images, in which colors are distorted. This study proposed a method of detecting the skin region using a fuzzy classification of the gradient map, saturation, and Cb and Cr in the YCbCr space. The proposed method, first, creates a gradient map, followed by a saturation map, CbCR map, fuzzy classification, and skin region binarization in that order. The focus of this method is to rigorously detect human skin regardless of the lighting, race, age, and individual differences, using features other than color. On the other hand,the borders between these features and non-skin regions are unclear. To solve this problem, the membership functions were defined by analyzing the relationship between the gradient, saturation, and color features and generate 108 fuzzy rules. The detection accuracy of the proposed method was 86.35%, which is 2~5% better than the conventional method.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.692-702
• /
• 2008

Path planning is gaining more weight in computer games and virtual reality as the number of self-moving characters increases. In the roadmap approach, the map of possible paths is built in advance to plan paths for a character, whose advantage is to provide high-quality paths. On the other hand, a disadvantage is that the road map doesn't reflect properties of characters such as their sizes because they move on the same map once the road map is constructed. In this paper we propose an efficient method to build a different road map for each character so that it can use its own map for path-planning. This method is efficient because the whole map is built once by applying the Visibility Graph regardless of the number of characters and walkable paths are incrementally inserted according to the sizes of characters. The effects of using separate roadmaps are demonstrated through simulations and the trade-offs accompanied with these effects are analyzed.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.515-522
• /
• 2001

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Map(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented about k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.471-482
• /
• 2006

In this paper, we propose a new scheme to generate multi-view images utilizing depth map decomposition and adaptive edge smoothing. After carrying out smooth filtering based on an adaptive window size to regions of edges in the depth map, we decompose the smoothed depth map into four types of images: regular mesh, object boundary, feature point, and number-of-layer images. Then, we generate 3-D scenes from the decomposed images using a 3-D mesh triangulation technique. Finally, we extract multi-view images from the reconstructed 3-D scenes by changing the position of a virtual camera in the 3-D space. Experimental results show that our scheme generates multi-view images successfully by minimizing a rubber-sheet problem using edge smoothing, and renders consecutive 3-D scenes in real time through information decomposition of depth maps. In addition, the proposed scheme can be used for 3-D applications that need the depth information, such as depth keying, since we can preserve the depth data unlike the previous unsymmetric filtering method.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.916-926
• /
• 2011

It is well known that high-resolution 3D movie contents frequently do not deliver the identical 3D perception to low-resolution 3D images. For solving this problem, we propose a novel method that produces a new stereoscopic image based on depth map transformation using the spatial complexity of an image. After analyzing the depth map histogram, the depth map is decomposed into multiple depth planes that are transformed based upon the spatial complexity. The transformed depth planes are composited into a new depth map. Experimental results demonstrate that the lower the spatial complexity is, the higher the perceived video quality and depth perception are. As well, visual fatigue test showed that the stereoscopic images deliver less visual fatigue.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.213-222
• /
• 2003

Most existing algorithms adopt the forward mapping method that is based on vector representation. Problem of existing algorithms Is the exponential increase of memory usage with number of layers. This degrades the accuracy of the boundary pattern representation. Our method uses bitmap representation and does not require any additional post-processing for conversion of vector-form results to bitmap-form. A new and efficient algorithm is presented in this paper for the generation of hyperbolic patterns by means of backward mapping methods.