• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.535-537
• /
• 2001

3D MMORPG(Massive Multi-play Outline Role Playing Game) 게임은 넓은 3차원원지형을 실시간으로 표현되어야 하며, 많은 어려움이 따른다. 본 논문에서는 이러한 지형 처리를 위하여 메쉬나 버텍스, 혹은 폴리곤으로 사실적인 지형처리와 렌드링 속도 향상을 위하여 3차원 폴리곤을 동적으로 생성시키는 방법을 이용하려고 한다. 넓은 지형을 처리하기 위해서는 전체를 한번에 표현하기보다는 페이지 단위로 처리하기 위하여 격자화된 타일로 이루어진 맵으로 처리할 수 있다. Height field 처리 기법은 일정한 영역을 페이지 단위로 구분하고 처리할 수 있다. 옥트리를 이용하여 공간을 입체적인 컬링 방법으로 분할하고, 이를 세부 수준으로 나누어 처리하기 위해 CLOD(Continuous Level of Detail) 개념을 적용할 수 있다. 거리의 변화에 따라 지명을 표현하는 vertex들을 병합 또는 삭제함으로써 그 표현의 정도를 동적으로 달리 할 수 있는 CLOD를 이용하여 카메라의 위치와 방향에 따라 적절한 폴리곤을 생성해 낼 수 있다. 본 논문은 3 차원의 넓은 외부 지형을 실시간으로 처리할 경우 발생되는 그래픽 문제를 해결하기 위해 사용되는 방법 중에서 대표적인 방법을 통하여 효율적인 처리 기법을 제시하려 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.333-335
• /
• 2012

고명암 대비(High Dynamic Range)영상을 일반 디스플레이 장치로 표현하기 위한 톤 매핑 기법을 제안한다. 제안하는 방식은 주성분분석(Principle Component Analysis)을 통해 구한 휘도채널을 양방향필터를 이용하여 기본 영상과 디테일 영상으로 분리한다. 기본영상은 동적영역분할과 재분배를 수행하고, 기본영상의 밝기값과 향상된 밝기값을 이용하여 후광현상을 제거한다. 실험 결과에서 제안하는 기법은 저명암대비 영상에서 명암비 향상과 동시에 디테일이 보존되는 것을 확인할 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.942-948
• /
• 2016

WSN based on wireless sensor nodes, Sensor nodes can not be reassigned and recharged if they once placed. Each sensor node comes into being involved to a communication network with its limited energy. But the existing proposed clustering techniques, being applied to WSN environment with irregular dispersion of sensor nodes, have the network reliability issues which bring about a communication interruption with the local node feature of unbalanced distribution in WSN. Therefore, the communications participation of the sensor nodes in the suggested algorithm is extended by 25% as the sensor field divided in the light of the non-uniformed distribution of sensor nodes and a static or a dynamic clustering algorithm adopted according to its partition of sensor node density in WSN. And the entire network life cycle was extended by 14% to ensure the reliability of the network.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.1 s.71
• /
• pp.39-46
• /
• 2006

This paper analyzes the continuous Galerkin method for the space-time discretization of wave equation. The method of space-time finite elements enables the simple solution than the usual finite element analysis with discretization in space only. We present a discretization technique in which finite element approximations are used in time and space simultaneously for a relatively large time period called a time slab. The weighted residual process is used to formulate a finite element method for a space-time domain. Instability is caused by a too large time step in successive time steps. A stability problem is described and some investigations for chosen types of rectangular space-time finite elements are carried out. Some numerical examples prove the efficiency of the described method under determined limitations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-17
• /
• 2005

The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.83-92
• /
• 2009

In this paper, an extended snake algorithm using color variance energy is proposed for segmenting an interest object in color image. General snake algorithm makes use of energy in image to segment images into a interesting area and background. There are many kinds of energy that can be used by the snake algorithm. The efficiency of the snake algorithm is depend on what kind of energy is used. A general snake algorithm based on active contour model uses the intensity value as an image energy that can be implemented and analyzed easily. But it is sensitive to noises because the image gradient uses a differential operator to get its image energy. And it is difficult for the general snake algorithm to be applied on the complex image background. Therefore, the proposed snake algorithm efficiently segment an interest object on the color image by adding a color variance of the segmented area to the image energy. This paper executed various experiments to segment an interest object on color images with simple or complex background for verifying the performance of the proposed extended snake algorithm. It shows improved accuracy performance about 12.42 %.

• Journal of the Korean Society of Safety
• /
• v.21 no.2 s.74
• /
• pp.143-149
• /
• 2006

This paper deals with the space-time finite element analysis of two-dimensional vibration problem with a single variable. The method of space-time finite elements enables the simpler solution than the usual finite element analysis with discretization in space only. We present a discretization technique in which finite element approximations are used in time and space simultaneously for a relatively large time period. The weighted residual process is used to formulate a finite element method for a space-time domain. A stability problem is described and some investigations for chosen type of rectangular space-time finite elements are carried out. Instability is caused by a too large time step of successive time steps in the traditional time-dependent problems. It has been shown that the numerical stability of time-stepping on the larger time steps is quite good. The unstructured space-time finite element not only overcomes the shortcomings of the stability in the traditional numerical methods, but it is also endowed with the features of an effective computational technique. Some numerical examples have been presented to illustrate the efficiency of the described method.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.99-111
• /
• 2009

In wireless sensor networks, various schemes have been proposed to store and process sensed data efficiently. A Data-Centric Storage(DCS) scheme assigns distributed data regions to sensors and stores sensed data to the sensor which is responsible for the data region overlapping the data. The DCS schemes have been proposed to reduce the communication cost for transmitting data and process exact queries and range queries efficiently. Recently, KDDCS that readjusts the distributed data regions dynamically to sensors based on K-D tree was proposed to overcome the storage hot-spots. However, the existing DCS schemes including KDDCS suffer from Query Hot-Spots that are formed if the query regions are not uniformly distributed. As a result, it causes reducing the life time of the sensor network. In this paper, we propose a new DCS scheme, called TPDCS(Time-Parameterized DCS), that avoids the problems of storage hot-spots and query hot-spots. To decentralize the skewed. data and queries, the data regions are assigned by a time dimension as well as data dimensions in our proposed scheme. Therefore, TPDCS extends the life time of sensor networks. It is shown through various experiments that our scheme outperform the existing schemes.

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

최근 대용량 데이터에 대한 효율적인 데이터 분석 기법이 활발히 연구되고 있다. 대표적인 기법으로는 맵리듀스 환경에서 보로노이 다이어그램을 이용한 k 최근접점 조인(VkNN-join) 알고리즘이 존재한다. VkNN-join 알고리즘은 부분집합 Ri에 연관된 부분집합 Sj만을 후보탐색 영역으로 선정하여 질의를 처리하기 때문에 질의처리 시간을 감소시킨다. 그러나 VkNN-join은 색인 구축 비용이 높으며, kNN 연산 오버헤드가 큰 문제점이 존재한다. 이를 해결하기 위해, 본 논문에서는 대용량 데이터 분석을 위한 맵리듀스 기반 kNN join 질의처리 알고리즘을 제안한다. 제안하는 알고리즘은 시드 기반의 동적 분할을 통해 색인구조 구축비용을 감소시킨다. 또한 시드 간 평균 거리를 기반으로 후보 영역을 선정함으로써, 연산 오버헤드를 감소시킨다. 아울러, 성능 평가를 통해 제안하는 기법이 질의처리 시간 측면에서 기존 기법에 비해 우수함을 나타낸다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.68-77
• /
• 2006

In accommodating the asymmetric traffic for future wireless multimedia services, the dynamic time division duplexing (D-TDD) scheme is considered as one of the key solutions. With the D-TDD mode, however, the inter-BS and inter-MS interference is inevitable during the cross time slot (CTS) period, and this interference seriously degrades the system performance. To mitigate such interference, we propose a region and time partitioning D-TDD architecture for OFDM systems. Each time slot in the CTS period is split into several minislots, and then each cell is divided into as many regions as the number of minislots per time slot. We then assign the minislots only to the users in its predefined corresponding region. On top of such architecture which inherently separates the interfering entities farther from each other, we design a robust time slot allocation scheme so that the inter-cell interference can be minimized. By the computer simulation, it has been verified that the proposed scheme outperforms the conventional time slot allocation methods in both the outage probability and the bandwidth efficiency.