• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.4
• /
• pp.348-359
• /
• 1989

The multitree pattern recognition algorithm proposed by [1] and [2] is modified in order to improve its performance. The basic idea of the multitree pattern classification algorithm is that the binary dceision tree used to classify an unknow pattern is constructed for each feature and that at each stage, classification rule decides whether to classify the unknown pattern or to extract the feature value according to the feature ordet. So the feature ordering needed in the calssification procedure is simple and the number of features used in the classification procedure is small compared with other classification algorithms. Thus the algorithm can be easily applied to real pattern recognition problems even when the number of features and that of the classes are very large. In this paper, the wighting factor assignment scheme in the decision procedure is modified and various classification rules are proposed by means of the weighting factor. And the branch and bound method is applied to feature subset selection and feature ordering. Several experimental results show that the performance of the multitree pattern classification algorithm is improved by the proposed scheme.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.499-505
• /
• 2011

In this paper, we proposed an adaptive fuzzy sliding mode control for nonlinear systems without parameter projection method. By modifying the controller structure, the parameters of the estimated input gain function are guaranteed not being identically zero and it is shown that the control scheme will not cause any implementation problem even if the estimated value of input gain function is zero at any moment during on-line operations. Except for the input gain function which an approximate estimate for its lower bound is needed, the proposed control scheme does not assume a priori the exact values of the bounding parameters. Based on Lyapunov synthesis methods, the overall control system guarantees that the tracking error asymptotically converges to zero and that all signals involved in controller are uniformly bounded. This can be illustrated by the simulation results for an inverted pendulum system.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.133-142
• /
• 2019

In physics-based character animation, trajectory optimization has been widely adopted for automatic motion synthesis, through the prediction of an optimal sequence of future states of the character based on its system dynamics model. In general, the system dynamics model is neither in a closed form nor differentiable when it handles the contact dynamics between a character and the environment with rigid body collisions. Employing smoothed contact dynamics, researchers have suggested efficient trajectory optimization techniques based on numerical differentiation of the resulting system dynamics. However, the numerical derivative of the system dynamics model could be inaccurate unlike its analytical counterpart, which may affect the stability of trajectory optimization. In this paper, we propose a novel method to derive the closed-form derivative for the system dynamics by properly approximating the contact model. Based on the resulting derivatives of the system dynamics model, we also present a model predictive control (MPC)-based motion synthesis framework to robustly control the motion of a biped character according to on-line user input without any example motion data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1117-1122
• /
• 2019

In this paper, a power allocation scheme is proposed to improve the fairness of user data rates in downlink non-orthogonal multiple access systems with one base station and two users. In particular, the power allocation scheme is presented to maximize the fairness of average user data rates assuming independent Rayleigh fading channels, where the fairness maximization is achieved when the average user data rates are equal. For the fairness evaluation, hence approximate expressions for the average user data rates and the average sum date rate of the proposed scheme are provided by using high signal-to-noise ratio approximation. Through simulation investigation, the derived approximate expressions for the average data rates are verified, and it is shown that the proposed scheme is superior to the conventional power allocation schemes in terms of the fairness of the average user data rates.

• Journal of KSNVE
• /
• v.7 no.1
• /
• pp.135-142
• /
• 1997

This paper presents a digital modeling technique of the distributed system. The basic idea of the proposed technique is to discretize a continuous system with respect to the spatial coordinates using bilinear method. The response of the discretized system is analyzed by Laplace transform and z-transform. The computational results in torsional shaft and Timoshenko beam using the proposed technique are compared with the exact solutions and the results of finite element method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.122-128
• /
• 2002

푸리에 변환을 사용하는 제1세대 웨이블릿은 정규화된 그리드에서만 적용되는 반면 리프팅 스킴을 사용한 제2세대 웨이블릿은 불규칙한 그리드를 처리할 수 있다. 본 논문에서는 제2세대 웨이블릿 생성 도구인 리프팅 스킴을 사용하여 압축된 적은 데이터를 사용한 근사치 영상을 생성하는 방법으로 부분 복원과 공간 복원 알고리즘과 리프팅 스킴을 이용한 에지 검출 기법이 제안되었다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.186-200
• /
• 2010

In order to render global illumination realistically, we need to accurately compute the direct and indirect illumination that represents the light information incoming through complex light paths. In this process, the indirect illumination at given point is greatly affected by surrounding geometries. Harmonic mean distance is a mathematical tool which is often used as a metric indicating the distance from a surface point to its visible objects in 3D space, and plays a key role in such advanced global illumination algorithms as irradiance/radiance caching and ambient occlusion. In this paper, we analyze the accuracy of harmonic mean distance estimated against various environments in the final gathering and photon mapping methods. Based on the experimental results, we discuss our experiences and future directions that may help develop an effective harmonic mean distance computation method in the future.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.4
• /
• pp.493-499
• /
• 2007

The Taylor expansion expresses a differentiable function and its coefficients provide good approximations for the given function and its derivatives. In this study, m-th order Taylor Polynomial is constructed and the coefficients are computed by the Moving Least Squares method. The coefficients are applied to the governing partial differential equation for solid problems including crack problems. The discrete system of difference equations are set up based on the concept of point collocation. The developed method effectively overcomes the shortcomings of the finite difference method which is dependent of the grid structure and has no approximation function, and the Galerkin-based meshfree method which involves time-consuming integration of weak form and differentiation of the shape function and cumbersome treatment of essential boundary.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.71-72
• /
• 2014

최근 들어 드라마나 영화 속 인물 들의 얼굴을 다른 얼굴로 교체하고자 하는 시도들이 주목을 받고 있고, 사용자들의 관심 또한 증가하고 있다. 이러한 연구는 오래 전부터 많이 연구되어 왔으나, 조명 변화에 강인한 피부 톤 변환 문제는 여전히 주요 이슈로 자리하고 있다. 본 논문에서는 히스토그램 명세화 기법을 응용하여 피부 톤을 자연스럽게 변환 시켜줄 수 있는 기법을 제안한다. 두 얼굴 영상의 R, G, B 채널에 대한 히스토그램을 각각 생성하고 이들을 누적분포함수로 각각 변환한다. 변환된 누적분포함수들을 이용하여 두 얼굴 영상의 히스토그램을 근사 시킬 수 있는 변환 표를 생성하고 이를 이용하여 얼굴 영상의 피부 톤을 변환시킨다. 조명 변화로 인해 발생하는 전반사 영역은 선형 보간 법을 사용하여 제거한다. 실험 결과, 제안하는 방법이 조명 변화에 적응적으로 대처하면서 자연스럽게 피부 톤을 변환 시켜줄 수 있음을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.8
• /
• pp.99-104
• /
• 2004

This paper proposes a new error pattern ROM (EP-ROM) compression method for continuousdata. The EP-ROM reduces the ROM size by dividing the continuous data into coarse values and their errors and by storing the indices of error patterns instead of the non. This method significantly reduces the ROM size by exploiting the characteristic that the errors for continuous data possess the same patterns. The experiment results show that the EP-ROM achieves 60∼77% ROM size reductions for various continuous data.