• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.441-452
• /
• 2002

If continuous moving objects are managed by conventional database, it is not possible for them to store all position information changed over time in the database. Therefore, a time period of regular rate is determined and position information of moving objects are discretely stored in the system for every time period. However, if continuous moving objects are managed as discrete model, we will have problems which cannot properly answer to the query about uncertain past or future position information. To solve this problem, in this paper, we propose the method and algorithm which use the history information stored in the same database, to estimate the past or future location of moving objects. The cubic spline interpolation is used to estimate the past location and the mean movement value of the history information is used to predict the future location of moving objects. Finally, from the location estimation experimentation of using virtual trajectory and location sample, we proved that the proposed cubic spline function has less error than the linear function.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.5
• /
• pp.1-16
• /
• 2016

In this paper, we propose and efficient curve reconstruction method based on the classical least-square fitting scheme. Specifically, given planar sample points equipped with normals, we reconstruct the objective curve as the zero set of a hierarchical implicit ZP(Zwart-Powell)-spline that can recover large holes of dataset without loosing the fine details. As regularizers, we adopted two: a Tikhonov regularizer to reduce the singularity of the linear system and a discrete Laplacian operator to smooth out the isocurves. Benchmark tests with quantitative measurements are done and our method shows much better quality than polynomial methods. Compared with the hierarchical bi-quadratic spline for datasets with holes, our method results in compatible quality but with less than 90% computational overhead.

• Ocean and Polar Research
• /
• v.29 no.4
• /
• pp.303-310
• /
• 2007

2-D wavelet analysis is applied to bathymetric data from the KR1 area of Korea Deepsea Mining Area. The wavelet analysis is one of the quantitative methods to analyze the topography. The wavelet allows us to create filters to select for topography in a continuous variety of shapes, sizes, and orientation. The 2-D Linear B-spline filter, 100 BS and 100 NF, is convolved with bathymetric data to identify the location of abyssal hills and abyssal troughs in bathymetry. In addition, the 2-D derivative of Cubic B-spline filter, 60 BS and 60 NF, is applied to bathymetric data to find the slope of abyssal hill in bathymetry. These filters were rotated $5^{\circ}$ counterclockwise from NS to match the dominant orientation of seafloor lineament. Both filters result in good match with abyssal hills, troughs, and slopes. This method can apply to fault, fold, and other lineament structures description with variable size. The result of application shows that wavelet analysis of bathymetric data could be used with fundamental data of geophysical analysis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.681-683
• /
• 2017

In the digital information age, image processing is essential for various digital devices such as smart phones, cameras, and TVs. However, degradation occurs in analyzing, recognizing, and processing image data, and salt & pepper noise occurs. Therefore, in this paper, we applied linear interpolation method, newton interpolation method, lagrange interpolation method, and spline interpolation method to the image damaged by salt & pepper noise in order to find more effective interpolation method in salt & pepper noise environment, The methods were compared using the PSNR (peak signal to noise ratio).

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.1
• /
• pp.78-86
• /
• 1998

This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.216-221
• /
• 2008

Shape design optimization for linear elasticity problem is performed using isogeometric analysis method. In many design optimization problems for real engineering models, initial raw data usually comes from CAD modeler. Then designer should convert this CAD data into finite element mesh data because conventional design optimization tools are generally based on finite element analysis. During this conversion there is some numerical error due to a geometry approximation, which causes accuracy problems in not only response analysis but also design sensitivity analysis. As a remedy of this phenomenon, the isogeometric analysis method is one of the promising approaches of shape design optimization. The main idea of isogeometric analysis is that the basis functions used in analysis is exactly same as ones which represent the geometry, and this geometrically exact model can be used shape sensitivity analysis and design optimization as well. In shape design sensitivity point of view, precise shape sensitivity is very essential for gradient-based optimization. In conventional finite element based optimization, higher order information such as normal vector and curvature term is inaccurate or even missing due to the use of linear interpolation functions. On the other hands, B-spline basis functions have sufficient continuity and their derivatives are smooth enough. Therefore normal vector and curvature terms can be exactly evaluated, which eventually yields precise optimal shapes. In this article, isogeometric analysis method is utilized for the shape design optimization. By virtue of B-spline basis function, an exact geometry can be handled without finite element meshes. Moreover, initial CAD data are used throughout the optimization process, including response analysis, shape sensitivity analysis, design parameterization and shape optimization, without subsequent communication with CAD description.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.150-153
• /
• 1997

In this paper, a control and data analysis S/W of a dedicated measuring machine for cams is developed. A rotary encoder is employed to measure the angular displacement of the motor, and a linear scale does the linear displacement of the prove. The design and measuring data are interpolated by cubic spline curves respectively to compute the error which is defined by the maximum distance between two curves. Further, optimization module to find the exact error is also developed to remove the error occurred due initial measuring position. The developed system takes only 6 minutes to measure the cam and to analyze the measuring data while the CMM takes about 1 hours even with a skilled operator.

• Structural Engineering and Mechanics
• /
• v.33 no.5
• /
• pp.543-560
• /
• 2009

The rotating Rayleigh-Timoshenko beam element based on B-spline wavelet on the interval (BSWI) is constructed to discrete short shaft and stiffness disc. The crack is represented by non-dimensional linear spring using linear fracture mechanics theory. The wavelet-based finite element model of rotor system is constructed to solve the first three natural frequencies functions of normalized crack location and depth. The normalized crack location, normalized crack depth and the first three natural frequencies are then employed as the training samples to achieve the neural networks for crack diagnosis. Measured natural frequencies are served as inputs of the trained neural networks and the normalized crack location and depth can be identified. The experimental results of fatigue crack in short shaft is also given.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.113-120
• /
• 1998

Calculation of intersection points by two curves is fundamental to computer aided geometric design. Bezier clipping is one of the well-known curve intersection algorithms. However, this algorithm is only applicable to Bezier curve representation. Therefore, the NURBS curves that can represent free from curves and conics must be decomposed into constituent Bezier curves to find the intersections using Bezier clipping. And the respective pairs of decomposed Bezier curves are considered to find the intersection points so that the computational overhead increases very sharply. In this study, extended Bezier clipping which uses the linear precision of B-spline curve and Grevill's abscissa can find the intersection points of two NURBS curves without initial decomposition. Especially the extended algorithm is more efficient than Bezier clipping when the number of intersection points is small and the curves are composed of many Bezier curve segments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.12
• /
• pp.1750-1754
• /
• 2013

A variable bit rate speech coder is presented. The coder is based on the observation that a speech signal can be viewed as a combination of piecewise linear signals in a short time period. The encoder detects the sample points where the slope of the signal changes, which are called the inflection points in this paper. The coder transmits the location and value for the detected inflection sample, but only the location information for the noninflection samples. In the decoder, the noninflection samples are estimated with interpolation of the received information. Several factors affecting the performance of the coder have been tested through simulation. Simulation results show that the linear interpolation produces 1 ~ 5 dB improvement over the cubic spline interpolation. And the -law companding does not provide any benefit when it is applied before the inflection detection. With low threshold values in the inflection point detection, the coder shows better MOS and more than 16 dB improvement in SNR compared to the continuously variable slope delta modulation (CVSDM).