• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.47-53
• /
• 1990

Polygonal approximation of digital curves is useful for the image analysis or data compression. There are methods of polygonal approximation using cone intersection using cone intersection which have relatively smaller number of break points and are executed in sequential process. Here a method of polygonal approximation is proposed, which is modified from Sklansky and Gonzales' method, and improves the speed by using integer operations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.52
• /
• pp.181-189
• /
• 1999

사건 가지 상의 파라메터 추정을 위한 베이지안 접근방식이 제시된다. 먼저 일반적인 사건 가지를 따라 발생하는 사고를 예측하기 위한 모형에 대해 설명한다. 이 경우 이론적으로 베이지안 기법을 적용하는 방법에 대해 논하고 실제로 문제를 풀 경우에 발생하는 다차원 수치적분 문제를 다룬다. 감마 분포와 베타분포가 이용될 경우 위 문제를 쉽게 해결할 수 있는 근사적 방법에 대해 연구한다. 또한 사건가지상의 여러 경로가 같은 수준의 사고로 분류 될 수 있는 경우에 대해서도 위와 같은 방법에 관한 연구를 한다. 결과적으로 한 사고율이 여러 개의 파라메터의 함수로 표현되어 다차원의 수치적분이 요구되는 경우 이를 쉽게 해결 할 수 있는 근사적인 방법이 제시되어 베이지안 기법의 적용이 용이해 질 수 있다.

• Korean Journal of Optics and Photonics
• /
• v.17 no.4
• /
• pp.359-365
• /
• 2006

Wave-front error(WFE) is the main parameter that determines the optical performance of the opto-mechanical system. In the development of opto-mechanics, WFE due to the main loading conditions are set to the important specifications. The deformation of the optical surface can be exactly calculated thanks to the evolution of numerical methods such as the finite element method(FEM). To calculate WFE from the deformation results of FEM, another approximation of the optical surface deformation is required. It needs to construct additional grid or element mesh. To construct additional mesh is troublesomeand leads to transformation error. In this work, the moving least-squares approximation is used to reconstruct wave front error It has the advantage of accurate approximation with only nodal data. There is no need to construct additional mesh for approximation. The proposed method is applied to the examples of GOCI scan mirror in various loading conditions. The validity is demonstrated through examples.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.5
• /
• pp.98-106
• /
• 1998

This paper proposes an efficient learning algorithm for improving the training performance of the neural network. The proposed method improves the training performance by applying the backpropagation algorithm of a global optimization method which is a hybrid of a stochastic approximation and a conjugate gradient method. The approximate initial point for f a ~gtl obal optimization is estimated first by applying the stochastic approximation, and then the conjugate gradient method, which is the fast gradient descent method, is applied for a high speed optimization. The proposed method has been applied to the parity checking and the pattern classification, and the simulation results show that the performance of the proposed method is superior to those of the conventional backpropagation and the backpropagation algorithm which is a hyhrid of the stochastic approximation and steepest descent method.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.18-27
• /
• 2002

A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.545-557
• /
• 2001

In this paper we propose a hierarchical classification algorithm based on rough membership function which can reason a new object approximately. We use the fuzzy reasoning method that substitutes fuzzy membership value for linguistic uncertainty and reason approximately based on the composition of membership values of conditional sttributes Here we use the rough membership function instead of the fuzzy membership function It can reduce the process that the fuzzy algorithm using fuzzy membership function produces fuzzy rules In addition, we transform the information system to the understandable minimal decision information system In order to do we, study the discretization of continuous valued attributes and propose the discretization algorithm based on the rough membership function and the entropy of the information theory The test shows a good partition that produce the smaller decision system We experimented the IRIS data etc. using our proposed algorithm The experimental results with IRIS data shows 96%~98% rate of classification.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.1
• /
• pp.173-180
• /
• 2022

Approximate Computing is a promising method for designing hardware-efficient computing systems. Approximate multiplication is one of key operations used in approximate computing methods for high performance and low power computing. An approximate 4-2 compressor can implement hardware-efficient circuits for approximate multiplication. In this paper, we propose an approximate multiplier with low area and low power characteristics. The proposed approximate multiplier architecture is segmented into three portions; an exact region, an approximate region, and a constant correction region. Partial product reduction in the approximation region are simplified using a new 4:2 approximate compressor, and the error due to approximation is compensated using a simple error correction scheme. Constant correction region uses a constant calculated with probabilistic analysis for reducing error. Experimental results of 8×8 multiplier show that the proposed design requires less area, and consumes less power than conventional 4-2 compressor-based approximate multiplier.

• Journal of Korea Water Resources Association
• /
• v.41 no.1
• /
• pp.49-63
• /
• 2008

The Bayesian MCMC(Bayesian Markov Chain Monte Carlo) and the MLE(Maximum Likelihood Estimation) methods using a quadratic approximation are applied to perform the at-site low flow frequency analysis at the 4 stage stations (Nakdong, Waegwan, Goryeonggyo, and Jindong). Using the results of two types of the estimation method, the frequency curves including uncertainty are plotted. Eight case studies using the synthetic flow data with a sample size of 100, generated from 2-parmeter Weibull distribution are performed to compare with the results of analysis using the MLE and the Bayesian MCMC. The Bayesian MCMC and the MLE are applied to 36 years of gauged data to validate the efficiency of the developed scheme. These examples illustrate the advantages of the Bayesian MCMC and the limitations of the MLE based on a quadratic approximation. From the point of view of uncertainty analysis, the Bayesian MCMC is more effective than the MLE using a quadratic approximation when the sample size is small. In particular, the Bayesian MCMC is a more attractive method than MLE based on a quadratic approximation because the sample size of low flow at the site of interest is mostly not enough to perform the low flow frequency analysis.

• Computational Structural Engineering
• /
• v.7 no.1
• /
• pp.109-116
• /
• 1994

In this paper, various reliability analysis methods for calculating a probability of failure are investigated for their accuracy and efficiency. Crude Monte Carlo method is used as a basis for the comparison of various numerical results. For the sampling methods, Importance Sampling method and Directional Simulation method are considered for overcoming a drawback of Crude Monte Carlo method. For the approximate methods, conventional Rackwitz-Fiessler method. 3-parameter Chen-Lind method, and Rosenblatt transformation method are compared on the basis of First order reliability method. As a Second-order reliability method, Curvature-Fitting paraboloid method, Point-fitting paraboloid method, and Log-likelihood function method are explored in order to verify the accuracy of the reliability calculation results. These methods mentioned above would have some difficulty unless the limit state equation is expressed explicitly in terms of random design variables. Thus, there is a need to develop some general reliability methods for the case where an implicit limit state equation is given. For this purpose, Response surface method is used where the limit state equation is approximated by regression analysis of the response surface outcomes resulted from the structural analysis. From the application of these various reliability methods to three examples, it is found that Directional Simulation method and Response Surface method are very efficient and recommendable for the general reliability analysis problem cases.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.302-305
• /
• 2000

본 논문은 데이터베이스에 존재하는 데이터 값들 사이의 유사성에 관한 지식을 이용하여 사용자가 요구한 정확한 답뿐 아니라 그와 유사한 답까지 제공해 줄 수 있는 근사적 질의처리 기법을 제시한다. 이를 위하여, 계량적인 방법에 해당하는 퍼지 관계와 비계량적인 방법에 해당하는 데이터 추상화를 하나로 통합한 유사성 표현 프레임웍을 제시하고 그를 이용한 지식 베이스를 설계한다.