• 대한전자공학회논문지
• /
• 제27권3호
• /
• pp.47-53
• /
• 1990

곡선의 다각형 근사화 방법은 화상분석 또는 데이타 압축등에 많이 사용된다. 다각형 근사화 방법으로, 적은 break point수를 갖고, Sequential Process로 결과를 얻을 수 있는 Cone intersection 방법이 있다. 여기서는 화소간의 거리가 일정한 디지탈 곡선의 경우, 종래의 cone intersection 방법을 정수계산을 이용하여 속도를 향상시키는 방법을 제안한다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.61-66
• /
• 1996

In this paper, an efficient contour coding algorithm incorporating polygonal approximation and discrete sine transform is introduced. Contour information is inevitable in content based coding, and polygonal approximation method is widely used to compress the contour information. However polygonal approximation method is not suitable when fine contour is needed. We show that the error signal of polygonal approximation can be efficiently represented using DST, that is, the contour information can be represented accurately with polygons and DST coefficients. With this contour coding scheme, the required bits to represent a contour can be reduced by about 40-50% with virtually no degradation compared to the existing chain coding method.

• 대한산업공학회지
• /
• 제42권2호
• /
• pp.86-95
• /
• 2016

We propose a new approach to the stochastic version of Lanchester model. Commonly used approach to stochastic Lanchester model is through the Markov-chain method. The Markov-chain approach, however, is not appropriate to high dimensional heterogeneous force case because of large computational cost. In this paper, we propose an approximation method of stochastic Lanchester model. By matching the first and the second moments, the distribution of each unit strength can be approximated with multivariate normal distribution. We evaluate an approximation of discrete Markov-chain model by measuring Kullback-Leibler divergence. We confirmed high accuracy of approximation method, and also the accuracy and low computational cost are maintained under high dimensional heterogeneous force case.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권3호
• /
• pp.180-193
• /
• 2023

Approximating the implied volatilities and estimating the model parameters are important topics in quantitative finance. This study proposes an approximation formula for short-maturity near-the-money implied volatilities in stochastic volatility models. A general second-order nonlinear PDE for implied volatility is derived in terms of time-to-maturity and log-moneyness from the Feyman-Kac formula. Using regularity conditions and the Taylor expansion, an approximation formula for implied volatility is obtained for short-maturity nearthe-money call options in two stochastic volatility models: Heston model and SABR model. In addition, we proposed a novel numerical method to estimate model parameters. This method reduces the number of model parameters that should be estimated. Generating sample data on log-moneyness, time-to-maturity, and implied volatility, we estimate the model parameters fitting the sample data in the above two models. Our method provides parameter estimates that are close to true values.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.227-245
• /
• 2011

In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

• Journal of the Korean Statistical Society
• /
• 제19권2호
• /
• pp.160-170
• /
• 1990

A new approximation method is proposed for the ARL of CUSUM chart which is based on the log probability ratio statistic. This method uses the condition of before-stopping time to derive the expectation of excess over boundaries. The proposed method is compared to some other approximation methods in normal and exponential cases.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.467-482
• /
• 2000

Testing equality of two and k distributions has long been an interesting issue in statistical inference. To overcome the sparseness of data points in high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained, some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation for the statistics the based on Number theoretic method is applied. Several simulation experiments are performed.

• 전기학회논문지
• /
• 제67권7호
• /
• pp.898-902
• /
• 2018

A novel heart beat interval estimation algorithm is presented based on parabola approximation method. This paper presented a two-step processing scheme; a first stage is finding R-peak in the Electrocardiogram (ECG) by Shannon energy envelope estimator and a secondary stage is computing the interpolated peak location by parabola approximation. Experimental results show that the proposed algorithm performs better than with the previous method using low sampled ECG signals.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.319-328
• /
• 2004

In this paper we investigate the qualitative behaviour of numerical approximation to a class delay differential equation. We consider the numerical solution of the delay differential equations undergoing a Hopf bifurcation. We prove the numerical approximation of delay differential equation had a Hopf bifurcation point if the true solution does.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.191-207
• /
• 2007

Based on a mixed Galerkin approximation, we construct the fully discrete approximations of $U_y$ as well as U to a single-phase quasilinear Stefan problem with a forcing term in non-divergence form. We prove the optimal convergence of approximation to the solution {U, S} and the superconvergence of approximation to $U_y$.