• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권4호
• /
• pp.257-265
• /
• 2009

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권2호
• /
• pp.151-161
• /
• 2016

In this paper, we present a $C^3$ quartic B-spline approximation of circular arcs. The Hausdorff distance between the $C^3$ quartic B-spline curve and the circular arc is obtained in closed form. Using this error analysis, we show that the approximation order of our approximation method is six. For a given circular arc and error tolerance we find the $C^3$ quartic B-spline curve having the minimum number of control points within the tolerance. The algorithm yielding the $C^3$ quartic B-spline approximation of a circular arc is also presented.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.679-682
• /
• 1988

From the viewpoint of general recognition system, B-spline is introduced for the approximation and recognition of human profile contours. Profile contour is approximated to the cublic B-spline curve by least square fitting so that B-Spline nodes nearly correspond with the curvature extrema of the contour. This method is designed for the spline to be good features in recognition, and also showed good approximation compared with the variants of B-spline appraximation.

• 한국CDE학회논문집
• /
• 제11권1호
• /
• pp.1-10
• /
• 2006

This paper addresses B-spline curve approximation of a set of ordered points to a specified toterance. The important issue in this problem is to reduce the number of control points while keeping the desired accuracy in the resulting B-spline curve. In this paper we propose a new method for error-bounded B-spline curve approximation based on adaptive selection of dominant points. The method first selects from the given points initial dominant points that govern the overall shape of the point set. It then computes a knot vector using the dominant points and performs B-spline curve fitting to all the given points. If the fitted B-spline curve cannot approximate the points within the tolerance, the method selects more points as dominant points and repeats the curve fitting process. The knots are determined in each step by averaging the parameters of the dominant points. The resulting curve is a piecewise B-spline curve of order (degree+1) p with $C^{(p-2)}$ continuity at each knot. The shape index of a point set is introduced to facilitate the dominant point selection during the iterative curve fitting process. Compared with previous methods for error-bounded B-spline curve approximation, the proposed method requires much less control points to approximate the given point set with the desired shape fidelity. Some experimental results demonstrate its usefulness and quality.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.157-169
• /
• 2006

We study properties concerning approximation of fuzzy-number-valued functions by fuzzy B-spline series. Error bounds in approximation by fuzzy B-spine series are obtained in terms of the modulus of continuity. Particularly simple error bounds are obtained for fuzzy splines of Schoenberg type. We compare fuzzy B-spline series with existing fuzzy concepts of splines.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권1호
• /
• pp.81-98
• /
• 1999

In spite of the well developed theory and the practical use of the univariate B-spline, the theory of multivariate B-spline is very new and waits its practical use. We compare in this article the multivariate B-spline approximation with the polynomial approximation for the surface fitting. The graphical and numerical comparisons show that the multivariate B-spline approximation gives much better fitting than the polynomial one, especially for the surfaces which vary very rapidly.

• 한국지능시스템학회논문지
• /
• 제21권5호
• /
• pp.653-659
• /
• 2011

심전도 신호는 일반적으로 200Hz 이상의 주파수로 표본화 하므로 장시간의 심전도 신호를 획득할 경우 데이터가 방대해진다. 이러한 신호를 저장 및 전송하기 위해서는 효율적인 신호 압축을 필요로 한다. 본 논문에서는 B-spline 근사화를 이용하여 심전도 신호를 압축하는 방법을 제안한다. B-spline 곡선의 국부적 제어성(local controllability) 특성으로 인하여 원신호를 부분적으로 근사화할 수 있으며, 이를 통하여 방대한 심전도 신호를 압축할 수 있다. 따라서 본 논문에서는 응용수학의 근사이론 및 기하학적 모델링에 널리 사용되고 있는 비균일 B-spline 근사화 기법으로 효율적인 압축 방안을 제시한다. 제안한 알고리즘의 유효성을 확인하기 위해 실제 심전도 임상 데이터인 MIT-BIH 데이터베이스를 이용하여 실험을 수행하며, 그 결과로부터 제안한 기법을 이용한 B-spline 근사화 압축 방법의 효용성을 입증한다.

• 대한조선학회논문집
• /
• 제35권4호
• /
• pp.118-125
• /
• 1998

본 연구는 B-spline 근사법과 유전자 알고리즘을 이용하여 기하학적 경계 조건-양끝점의 위치 벡터 및 접선 벡터-을 만족하는 혼합 곡선 근사법에 의한 선형 표현을 내용으로 한다. B-spline 근사법을 이용하여 선형을 표현하고, 이들 곡선을 제어하는 조정점들이 기하학적 경계조건을 만족하도록 유전자 알고리즘으로 조정한다. 이 방법은 선형 생성시 순정 작업을 동시에 수행하므로 효율적인 선형 설계를 가능하게 한다.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.741-754
• /
• 2002

In this paper we present an error bound for cubic spline approximation of conic section curve. We compare it to the error bound proposed by Floater [1]. The error estimating function proposed in this paper is sharper than Floater's at the mid-point of parameter, which means the overall error bound is sharper than Floater's if the estimating function has the maximum at the midpoint.

• 호남수학학술지
• /
• 제35권4호
• /
• pp.729-738
• /
• 2013

In this paper, we investigate a localized approximation of a continuously differentiable function by neural networks. To do this, we first approximate a continuously differentiable function by B-spline functions and then approximate B-spline functions by neural networks. Our proofs are constructive and we give numerical results to support our theory.