• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.669-684
• /
• 1999

We are interested in the problem of fitting a curve to a set of points in the plane in such a way that the sum of the squares of the orthogonal distances to given data points ins minimized. In[1] the prob-lem of fitting circles and ellipses was considered and numerically solved with general purpose methods. Especially in [2] H. Spath proposed a special purpose algorithm (Spath's ODF) for parabolas y-b=$c($\chi$-a)^2$ and for rotated ones. In this paper we present another parabola fitting algorithm which is slightly different from Spath's ODF. Our algorithm is mainly based on the steepest descent provedure with the view of en-suring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• 대한조선학회논문집
• /
• 제46권1호
• /
• pp.87-95
• /
• 2009

The applicability of optimization techniques for hull surface fitting has been important in the ship design process. In this research, the Genetic Algorithm has been used as a searching technique for solving surface fitting problem and minimizing errors between B-spline surface and the ship's offset data. The encoded design variables are the location of the vertex points and parametric values. The sufficient accuracy in surface fitting implies not only various techniques for computer-aided design, but also the future production design.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권1호
• /
• pp.37-49
• /
• 2004

We are interested in the problem of fitting a sphere to a set of data points in the three dimensional Euclidean space. In Spath [6] a descent algorithm already have been given to find the sphere of best fit in least squares sense of minimizing the orthogonal distances to the given data points. In this paper we present another new algorithm which computes a parametric represented sphere in order to minimize the sum of the squares of the distances to the given points. For any choice of initial approximations our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 제37회 하계학술대회 논문집 A
• /
• pp.14-15
• /
• 2006

A saturation of magnetic flux in the core may occur when a large primary current flows when the iron-cored current transformer is used. This saturation makes the distorted secondary current of the CT. the distorted secondary current may cause the mal-operation or operation time delay of protective relays. CT compensation algorithm using The LSQ(Least Square) fitting method has a problem. It needs to acquire enough data for executing this algorithm without an error. In this paper, an enhanced algorithm using interpolation based LSQ(Least Square) Fitting Method is proposed. The Lagrange Interpolation Method is used for the interpolation and CT is simulated by EMTP. The results show that the proposed algorithm can accurately compensate a distorted secondary current more than existing Algorithm when the saturation severely occurs.

• Communications for Statistical Applications and Methods
• /
• 제27권2호
• /
• pp.255-268
• /
• 2020

A mixture of multivariate canonical fundamental skew t-distribution (CFUST) has been of interest in various fields. In particular, interest in the unsupervised learning society is noteworthy. However, fitting the model via EM algorithm suffers from significant processing time. The main cause is due to the calculation of many multivariate t-cdfs (cumulative distribution functions) in E-step. In this article, we provide an approximate, but fast calculation method for the in univariate fashion, which is the product of successively conditional univariate t-cdfs with Taylor's first order approximation. By replacing all multivariate t-cdfs in E-step with the proposed approximate versions, we obtain the admissible results of fitting the model, where it gives 85% reduction time for the 5 dimensional skewness case of the Australian Institution Sport data set. For this approach, discussions about rough properties, advantages and limits are also presented.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.570-575
• /
• 2002

This paper presents a new circular curve fitting approach of articulated manipulators, based on pseudoinverses. The paper aims at gaining the interpolation of circle from n data points, under the condition that the fitted circle should pass both a start point and an end point. In this paper, two algorithms of circular interpolation are presented. Prior to circular interpolation, are a spherical fitting should be performed, using least squares. In the first algorithm, the relationship between point data and normal vector on the sphere is used. In the second algorithm. the equation of plane which can be obtained from 3 points, i.e., a start point, an end point, and center of a sphere. The proposed algorithms are show to be efficient by using MATLAB-based simulation.

• 한국자기공명학회논문지
• /
• 제9권2호
• /
• pp.93-102
• /
• 2005

Purpose: To develop an advanced non-linear curve fitting (NLCF) algorithm for dynamic susceptibility contrast study of brain. Materials and Methods: The first pass effects give rise to spuriously high estimates of $K^{trans}$ in voxels with large vascular components. An explicit threshold value has been used to reject voxels. Results: By using this non-linear curve fitting algorithm, the blood perfusion and the volume estimation were accurately evaluated in T2*-weighted dynamic contrast enhanced (DCE)-MR images. From the recalculated each parameters, perfusion weighted image were outlined by using modified non-linear curve fitting algorithm. This results were improved estimation of T2*-weighted dynamic series. Conclusion: The present study demonstrated an improvement of an estimation of kinetic parameters from dynamic contrast-enhanced (DCE) T2*-weighted magnetic resonance imaging data, using contrast agents. The advanced kinetic models include the relation of volume transfer constant $K^{trans}\;(min^{-1})$ and the volume of extravascular extracellular space (EES) per unit volume of tissue $\nu_e$.

• 대한의용생체공학회:의공학회지
• /
• 제42권4호
• /
• pp.159-166
• /
• 2021

In order to analyze cell images, accurate segmentation of each cell is indispensable. However, the reality is that accurate cell image segmentation is not easy due to various noises, dense cells, and inconsistent shape of cells. Therefore, in this paper, we propose an algorithm that combines marker-based watershed segmentation and ellipse fitting method for glioblastoma cell segmentation. In the proposed algorithm, in order to solve the over-segmentation problem of the existing watershed method, the marker-based watershed technique is primarily performed through "seeding using local minima". In addition, as a second process, the concave point search using ellipse fitting for final segmentation based on the connection line between the concave points has been performed. To evaluate the performance of the proposed algorithm, we compared three algorithms with other algorithms along with the calculation of segmentation accuracy, and we applied the algorithm to other cell image data to check the generalization and propose a solution.

• 한국공작기계학회논문집
• /
• 제12권2호
• /
• pp.79-85
• /
• 2003

An algorithm for fitting with Least Square is a traditional and an effective method in processing with experimental data. Due to the lack of definite representation, it is difficult to fit measured data with free curves or surfaces. B-Spline is usefully utilized to express free curves and surfaces with a few parameters. This paper presents the combination of these two techniques to process the point data measured from CMM and other similar instruments. This research shows tests and comparison of the simulation results from two techniques.

• Journal of Information Processing Systems
• /
• 제16권3호
• /
• pp.557-571
• /
• 2020

The existing methods for detection of fire smoke in a video easily lead to misjudgment of cloud, fog and moving distractors, such as a moving person, a moving vehicle and other non-smoke moving objects. Therefore, an algorithm for detection of fire smoke in a video based on wavelet energy slope fitting is proposed in this paper. The change in wavelet energy of the moving target foreground is used as the basis, and a time window of 40 continuous frames is set to fit the wavelet energy slope of the suspected area in every 20 frames, thus establishing a wavelet-energy-based smoke judgment criterion. The experimental data show that the algorithm described in this paper not only can detect smoke more quickly and more accurately, but also can effectively avoid the distraction of cloud, fog and moving object and prevent false alarm.