• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.4
• /
• pp.388-393
• /
• 2019

As a fiiting method to data with outliers, RANSAC(RANdom SAmple Consensus) based algorithm is widely used in fitting of line, circle, ellipse, etc. CUDA is currently most widely used GPU with massive parallel processing capability. This paper proposes an efficient CUDA implementation of multiple planes fitting using RANSAC with 3d points data, of which one set of 3d points is used for one plane fitting. The performance of the proposed algorithm is demonstrated compared with CPU implementation using both artificially generated data and real 3d heights data of a PCB. The speed-up of the algorithm over CPU seems to be higher in data with lower inlier ratio, more planes to fit, and more points per plane fitting. This method can be easily applied to a wide variety of other fitting applications.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.4
• /
• pp.1-11
• /
• 2012

This paper is the study on the development of a torque precision measuring system using the curve fitting algorithm. This system can be divided into the hardware part and the software part. The hardware part consists of the main base board, the DAQ(Data Aquisition) board and Calibration parts. The software part consists of the software filter module and the curve fitting algorithm module. We have tested the torque transducer including the strain gauge for 200 Nm range and have analyzed the data acquired with the curve fitting algorithm by using this system. The DAQ board converts the electric signal induced by the transducer to the digital value precisely by using the shunt calibration procedure. The main board including the curve fitting algorithm calculates the exact digital torque value by using the digital value from the DAQ board. In this study, we confirmed that the result of the appropriate high-order power-series polynomial function is more accurate than the result of the low-order power-series polynomial through the system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.768-776
• /
• 2011

This paper considers a data fitting problem for rational function models using the LM (Levenberg-Marquardt) optimization method. Rational function models have various merits on representing a wide range of shapes and modeling complicated structures by polynomials of low degrees in both the numerator and denominator. However, rational functions are nonlinear in the parameter vector, thereby requiring nonlinear optimization methods to solve the fitting problem. In this paper, we propose a data fitting method for rational function models based on the LM algorithm which is renowned as an effective nonlinear optimization technique. Simulations show that the fitting results are robust against the measurement noises and uncertainties. The effectiveness of the proposed method is further demonstrated by the real application to a 3D depth camera calibration problem.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.479-481
• /
• 1998

Noise가 있는 data에서 shape나 parameter를 찾았을 때 일반적으로 Hough transform이나 regression을 적용한다. Hough transform은 parameter space의 차수가 커지면 memory 문제가 존재하며, regression 모델은 한 개의 변수를 다른 변수의 함수로 가정하여 error를 최소화하여 데이터중 1 set의 parameter만 존재한다는 가정을 하여야 하는 문제점이 있다. 본 논문에서는 이러한 두 방법의 단점들을 보완하며, Fuzzy개념을 도입한 data fitting 방법을 제안하였다. 이 문제는 genetic algorithm을 도입하여 data를 Fuzzy membership을 갖는 것으로 가정한 최적화 문제로 해결하였다. 직선과 평면에 대한 실험 결과를 보인다.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.42-47
• /
• 2001

In this paper, we present a curve fitting algorithm using a ball curve. Our algorithm is recursive method for fitting, which is not a traditional ball function but a continuous ball function. This algorithm consists of two steps. The first step, it is classified the composite corner points to joint points until selected from the given data set. The second step is the curve fitting. The basis function for curve fitting is use to ball function. Also, the weighted least square method, to insert knot, is an efficient method for piecewise ball curve and ball curve segments will be smoothly connected at all composit points. The proposed algorithm will be applied to represent image representation, like fonts, digital image and GIS.

• Communications of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.915-938
• /
• 2022

We are interested in the problem of fitting a parabola to a set of data points in ℝ³. It can be usually solved by minimizing the geometric distances from the fitted parabola to the given data points. In this paper, a parabola fitting algorithm will be proposed in such a way that the sum of the squares of the geometric distances is minimized in ℝ³. Our algorithm is mainly based on the steepest descent technique which determines an adequate number λ such that h(λ) = Q(u - λ𝛁Q(u)) < Q(u). Some numerical examples are given to test our algorithm.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.121-142
• /
• 2002

We are interested in the curve fitting problems in such a way that the sum of the squares of the orthogonal distances to the given data points is minimized. Especially, the fitting an ellipse to the given data points is a problem that arises in many application areas, e.g. computer graphics, coordinate metrology, etc. In [1] the problem of fitting ellipses was considered and numerically solved with general purpose methods. In this paper we present another new ellipse fitting algorithm. Our algorithm if mainly based on the steepest descent procedure with the view of ensuring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.1029-1047
• /
• 2019

We are interested in the problem of determining the best fitted circle to a set of data points in space. This can be usually obtained by minimizing the geometric distances or various approximate algebraic distances from the fitted circle to the given data points. In this paper, we propose an algorithm in such a way that the sum of the squares of the geometric distances is minimized in ${\mathbb{R}}^3$. Our algorithm is mainly based on the steepest descent method with a view of ensuring the convergence of the corresponding objective function Q(u) to a local minimum. Numerical examples are given.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.96-98
• /
• 2005

In this paper, an algorithm to compensate the distorted signals due to Current Transformer(CT) saturation is suggested, First, DWT which can be easily realized by filter banks in real-time applications is used to detect a start point and an end point of the saturation. Secondly, For enough Datas those need to use the least-square curve fitting method, the distorted current signal is compensated by the AR(autoregressive) model using the data during the previous healthy section until pick point of Saturation. Thirdly, the least-square curve fitting method is used to restore the distorted section of the secondary current. Finaly, this algorithm had a Hadware test using DSP board(TMS320C32) with Doble test device. DWT has superior detection accuracy and the proposed compensation algorithm which shows very stable features under various levels of remanent flux in the CT core is also satisfactory. And this algorithm is more correct than a previous algorithm which is only using the LSQ fitting method. Also it can be used as a MU involving the compensation function that acquires the second data from CT and PT.