• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.653-659
• /
• 2011

In general, electrocardiogram(ECG) signals are sampled with a frequency over 200Hz and stored for a long time. It is required to compress data efficiently for storing and transmitting them. In this paper, a method for compression of ECG data is proposed, using by Non Uniform B-spline approximation, which has been widely used to approximation theory of applied mathematics and geometric modeling. ECG signals are compressed and reconstructed using B-spline basis function which curve has local controllability and control a shape and curve in part. The proposed method selected additional knot with each step for minimizing reconstruction error and reduced time complexity. It is established that the proposed method using B-spline approximation has good compression ratio and reconstruct besides preserving all feature point of ECG signals, through the experimental results from MIT-BIH Arrhythmia database.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.4
• /
• pp.118-125
• /
• 1998

This paper presents the hybrid curve approximation with geometric boundary conditions as position vector and tangent vector of start and end point using a B-spline approximation and a genetic algorithm First, H-spline approximation generates control points to fit B-spline curries through specified data points. Second, these control points are modified by genetic algorithm(with floating point representation) under geometric boundary conditions. This method would be able to execute the efficient design work without fairing.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.8
• /
• pp.921-931
• /
• 2011

This paper presents a data-fitting technique in which a B-spline hypervolume is used to approximate a given data set of scattered data samples. We describe the implementation of the data structure of a B-spline hypervolume, and we measure its memory size to show that the representation is compact. The proposed technique includes two algorithms. One is for the determination of the knot vectors of a B-spline hypervolume. The other is for the control points, which are determined by solving a linear least-squares minimization problem where the solution is independent of the data-set complexity. The proposed approach is demonstrated with various data-set configurations to reveal its performance in terms of approximation accuracy, memory use, and running time. In addition, we compare our approach with existing methods and present unconstrained optimization examples to show the potential for various applications.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.35-44
• /
• 2005

The degree reduction of B-splines is necessary in exchanging parametric curves and surfaces of the different geometric modeling systems because some systems limit the supported maximal degree. In this paper, We provide an our experimental results in approximate conversion for B-splines apply to degree reduction. We utilize the existing Bezier degree reduction methods, and analyze the methods. Also, knot removal algorithm is used to reduce data in the degree reduction Process.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1271-1283
• /
• 2007

To detect defect of FPD(flat panel displays) is very difficult due to uneven illumination on FPD panel image. This paper presents a method to detect various types of defects using the approximated image of the uneven illumination by B-spline. To construct a approximated surface, corresponding to uneven illumination background intensity, while reducing random noises and small defect signal, only the lowest smooth subband is used by wavelet decomposition, resulting in reducing the computation time of taking B-spline approximation and enhancing detection accuracy. The approximated image in lowest LL subband is expanded as the same size as original one by wavelet reconstruction, and the difference between original image and reconstructed one becomes a flat image of compensating the uneven illumination background. A simple binary thresholding is then used to separate the defective regions from the subtracted image. Finally, blob analysis as post-processing is carried out to get rid of false defects. For applying in-line system, the wavelet transform by lifting based fast algorithm is implemented to deal with a huge size data such as film and the processing time is highly reduced.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.4
• /
• pp.282-293
• /
• 2012

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.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.5 s.98
• /
• pp.160-168
• /
• 1999

This paper describes one method of reverse engineering that machines a free form shape without descriptive model. A portable five-axes 3D CMM was used to digitize point data from physical model. After approximation by rational B-spline curve from digitized point data of a geometric shape, a surface was constructed by the skinning method of the cross-sectional design technique. Since a surface patch was segmented by fifteen part, surface merging was also implemented to assure the surface boundary continuity. Finally, composite surface was transferred to commercial CAD/CAM system through IFES translation in order to machine the modeled geometric shape.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.33-42
• /
• 2011

We present a new technique for removing interior knots of parametric B-spline curves. An initial curve is constructed by continuous $L_{\infty}$ approximation proposed by Eck and Hadenfeld. We employ Hausdorff distance to measure the shape difference between the original curve and the initial one. The final curve is obtained by minimizing their Hausdorff distance. We demonstrate the effectiveness of our technique with experimental results on various types of planar and spatial curves.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.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 computational fluids engineering
• /
• v.3 no.2
• /
• pp.1-8
• /
• 1998

We make use of cubic B-spline interpolation function in two cases: heat conduction and fluid flow problems. Cubic B-spline test function is employed because it is superior to approximation of linear and non-linear problems. We investigated the accuracy of the numerical formulation and focused on the position of the breakpoints within the computational domain. When the domain is divided by partitions of equal space, the results show poor accuracy. For the case of a heat conduction problem this partition can not reflect the temperature gradient which is rapidly changed near the wall. To correct the problem, we have more grid points near the wall or the region which has a rapid change of variables. When we applied the unequally spaced breakpoints, the results show high accuracy. Based on the comparison of the linear problem, we extended to the highly non-linear fluid flow problems.