무작위 데이터 근사화를 위한 유계오차 B-스플라인 근사법

This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications