• 제목/요약/키워드: Fitting algorithm

Search Result 475, Processing Time 0.083 seconds

Curve Fitting with Recursive Ball Curve (Ball 곡선을 이용한 Fitting 알고리즘)

  • Lee, A-Ri;Choe, Yeong-Geun
    • 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.

  • PDF

Study on Torque precision measuring System using Curve Fitting Algorithm (커브피팅 알고리즘이 적용된 토크 정밀 측정 시스템 개발에 관한 연구)

  • Lee, Ki Won;Ha, Jae Seung;Kang, Seung Soo
    • 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.

Performance of covariance matrix fitting-based direction-of-arrival estimation algorithm using compressed sensing in the frequency domain (주파수 영역에서 공분산 행렬 fitting 기반 압축센싱 도래각 추정 알고리즘의 성능)

  • Zhang, Xueyang;Paik, Ji Woong;Hong, Wooyoung;Ahn, Jae-Kyun;Kim, Seongil;Lee, Joon-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.6
    • /
    • pp.394-400
    • /
    • 2017
  • This paper shows the extension of SpSF (Sparse Spectrum Fitting) algorithm, which is one of covariance matrix fitting-based DOA (Direction-of-Arrival) estimation algorithms, from the time domain to the frequency domain, and presents that SpSF can be implemented in the frequency domain. The superiority of the SpSF algorithm has been demonstrated by comparing DOA estimation performance with the performance of Conventional DOA estimation algorithm in the frequency domain for sinusoidal incident signals.

Efficient CUDA Implementation of Multiple Planes Fitting Using RANSAC (RANSAC을 이용한 다중 평면 피팅의 효율적인 CUDA 구현)

  • Cho, Tai-Hoon
    • 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.

Precise Edge Detection Method Using Sigmoid Function in Blurry and Noisy Image for TFT-LCD 2D Critical Dimension Measurement

  • Lee, Seung Woo;Lee, Sin Yong;Pahk, Heui Jae
    • Current Optics and Photonics
    • /
    • v.2 no.1
    • /
    • pp.69-78
    • /
    • 2018
  • This paper presents a precise edge detection algorithm for the critical dimension (CD) measurement of a Thin-Film Transistor Liquid-Crystal Display (TFT-LCD) pattern. The sigmoid surface function is proposed to model the blurred step edge. This model can simultaneously find the position and geometry of the edge precisely. The nonlinear least squares fitting method (Levenberg-Marquardt method) is used to model the image intensity distribution into the proposed sigmoid blurred edge model. The suggested algorithm is verified by comparing the CD measurement repeatability from high-magnified blurry and noisy TFT-LCD images with those from the previous Laplacian of Gaussian (LoG) based sub-pixel edge detection algorithm and error function fitting method. The proposed fitting-based edge detection algorithm produces more precise results than the previous method. The suggested algorithm can be applied to in-line precision CD measurement for high-resolution display devices.

Genetic Algorithm based B-spline Fitting for Contour Extraction from a Sequence of Images (연속 영상에서의 경계추출을 위한 유전자 알고리즘 기반의 B-spline 적합)

  • Heo Hoon;Lee JeongHeon;Chae OkSam
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.5
    • /
    • pp.357-365
    • /
    • 2005
  • We present a B-spline fitting method based on genetic algorithm for the extraction of object contours from the complex image sequence, where objects with similar shape and intensity are adjacent each other. The proposed algorithm solves common malfitting problem of the existing B-spline fitting methods including snakes. Classical snake algorithms have not been successful in such an image sequence due to the difficulty in initialization and existence of multiple extrema. We propose a B-spline fitting method using a genetic algorithm with a new initial population generation and fitting function, that are designed to take advantage of the contour of the previous slice. The test results show that the proposed method extracts contour of individual object successfully from the complex image sequence. We validate the algorithm by false-positive/negative errors and relative amounts of agreements.

A FITTING OF PARABOLAS WITH MINIMIZING THE ORTHOGONAL DISTANCE

  • Kim, Ik-Sung
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.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.

A Data Fitting Technique for Rational Function Models Using the LM Optimization Algorithm (LM 최적화 알고리즘을 이용한 유리함수 모델의 데이터 피팅)

  • Park, Jae-Han;Bae, Ji-Hun;Baeg, Moon-Hong
    • 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.

B-spline Surface Fitting using Genetic Algorithm (유전자 알고리즘을 이용한 B-spline 곡면 피팅)

  • Le, Tat-Hien;Kim, Dong-Joon;Min, Kyong-Cheol;Pyo, Sang-Woo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.46 no.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.