• 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.

• 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 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.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.93-100
• /
• 2001

The three dimensional(3D) reconstruction from two dimensional(2D) image data is using in many fields such as RPD(Rapid Product Development) and reverse engineering. In this paper, the main step of 3D reconstruction is comprised of two steps : image processing step and B-spline surface approximation step. In the image processing step, feature points of each cross-section are obtained by means of several image processing technologies. In the B-spline surface approximation step, using the data of feature points obtained in the image processing step, the control points of B-spline surface are obtained, which are used for IGES file of 3D CAD model.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.10 no.1
• /
• pp.31-45
• /
• 2006

Recently advanced device and sophisticated manufacture process by high-density, high-integration require critical inspection criteria in SMT(surface mounting technologies). Especially for solder paste which come out over 60% of inferior goods of all product, 3-dimensional inspection replaces 2-D inspection as a effectiveness substitute of this trend. Therefore this paper proposes a fast 3-D inspection system and measurement algorithm automatically inspecting 3-D solder paste of PCB in SMT assembly line. The proposed method generates 3-D surface of data using B-spline algorithm and then extracts to inspect the pad.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.50-55
• /
• 2002

The standard approach of image resampling is to fit the original image with continuous model and resample the function at a desired rate. We used the B-spline function as the continuous model because it oscillates less than the others. The main purpose of this paper is the derivation of a nonuniform optimal resampling algorithm. To derive it, needing approximation can be computed in three steps: 1) determining the I-spline coefficients by matrix inverse process, 2) obtaining the transformed-spline coefficients by the optimal resampling algorithm derived from the orthogonal projection theorem, 3) converting of the result back into the signal domain by indirect B-spline transformation. With these methods, we can use B-spline in the non-uniform resampling, which is proved to be a good kernel in uniform resampling, and can also verify the applicability from our experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.1-6
• /
• 2001

In this paper, the problem of removing the interior knots from a B-spline is discussed. We present a new strategy for reducing the number of knots for splines. The method is the efficient for the visualization implementations and easy-to-use algorithms, and we need not to determine the knot sequence that will be removed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.492-495
• /
• 2001

In order to utilize a parallel machine tool for CAM system, the development of adequate interpolator is necessary. This paper presents a quintic B-spline interpolator with algorithm of limiting maximum interpolation error. The favored property of near arc-length parametrization in the curve representation is used in the implementation of the reference command generation. Then, this interpolator is applied to cubic parallel manipulator to show its validity.

• The Korean Journal of Applied Statistics
• /
• v.4 no.2
• /
• pp.171-178
• /
• 1991

For the polynomial spline regression with fixed knots, some properties of the D-optimal design are discussed. Also the D-optimal design for some cases are found analytically by using a normalized B-spline basis for $S(P_m : k : \Delta)$. Based on the Kiefer-Wolfowitz equivalence theorem, the D-optimal design for some cases are found by numerical methods.