• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.357-365
• /
• 2005

We present a B-spline fitting method based on genetic algorithm for the extraction of object contours from the complex image sequence, where objects with similar shape and intensity are adjacent each other. The proposed algorithm solves common malfitting problem of the existing B-spline fitting methods including snakes. Classical snake algorithms have not been successful in such an image sequence due to the difficulty in initialization and existence of multiple extrema. We propose a B-spline fitting method using a genetic algorithm with a new initial population generation and fitting function, that are designed to take advantage of the contour of the previous slice. The test results show that the proposed method extracts contour of individual object successfully from the complex image sequence. We validate the algorithm by false-positive/negative errors and relative amounts of agreements.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.2
• /
• pp.138-142
• /
• 2014

This research presents an A* based algorithm which can be applied to Unmanned Ground Vehicle self-navigation in order to make the driving path smoother. Based on the grid map, A* algorithm generated the path by using straight lines. However, in this situation, the knee points, which are the connection points when vehicle changed orientation, are created. These points make Unmanned Ground Vehicle continuous navigation unsuitable. Therefore, in this paper, B-spline curve function is applied to transform the path transfer into curve type. And because the location of the control point has influenced the B-spline curve, the optimal control selection algorithm is proposed. Also, the optimal path tracking speed can be calculated through the curvature radius of the B-spline curve. Finally, based on this algorithm, a path created program is applied to the path results of the A* algorithm and this B-spline curve algorithm. After that, the final path results are compared through the simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.433-436
• /
• 2012

Today due to the development of technology, 3D graphics have become an essential element of the game graphic. When game companies create a game using 3D graphics, game users can enjoy a better game graphics like photo-realistic live action than 2D game graphics. And because the game companies have many advantages in creating games which are easy to deal with many basic effects and special effects, in video game business field, 3D game have become the mainstream. This paper will inquire the characteristics of 2D spline which is basic to various kinds of 3D modeling necessary to making 3D game graphics, compare and analyze the merits and demerits of each kind of spline and find out its development history.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.19 no.9
• /
• pp.15-23
• /
• 2020

Spline is a machine component using transmits rotating energy with grooves on internal of boss and external periphery of shaft. Internal spline is generally produced by machining process. However, to reduce manufacturing cost and save time, plastic deformation process such as backward extrusion is gradually adapted for spline production. In plastic deformation process, forming load, stress on tools and flow flaws should be taken into account to have sound products. For this purpose, kinematically admissible velocity fields for Upper Bound Method in backward extrusion of internal spline has been suggested, then forming load and relative pressure have been calculated. Internal spline forming experiments have been con-ucted under hydraulic press and the calculated forming load well predicts the load of experiment.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.366-371
• /
• 2007

In many CAD systems, NURBS has been employed to construct exact geometries. Recently, NURBS finite element analysis methods were proposed by some authors for convenient connection between CAD and finite element analysis. Additional advantages of NURBS FEA, such as exact geometry and no mesh generation, are obtained. However, NURBS is inefficient in local refinement and merging patches. For refinement of local region in interest, additional control points should be inserted into the entire row or column which contains the local region. There is another inefficiency of NURBS during merging patches into a large structure due to propagation of control points. In order to overcome these inefficiencies of NURBS, T-spline was proposed by Sederberg. In this work, T-spline based finite element method is proposed for efficient local refinement and merging patches. At first, accuracy and efficiency of NURBS FEA is verified and efficiency of T-spline FEA is verified by comparing with NURBS FEA.

• Smart Structures and Systems
• /
• v.33 no.3
• /
• pp.201-215
• /
• 2024

Spline chirplet transform and local maximum synchrosqueezing are introduced to present a novel structural instantaneous frequency (IF) identification method named local maximum synchrosqueezing spline chirplet transform (LMSSSCT). Namely spline chirplet transform (SCT), a transform is firstly introduced based on classic chirplet transform and spline interpolated kernel function. Applying SCT in association with local maximum synchrosqueezing, the LMSSSCT is then proposed. The index of accuracy and Rényi entropy show that LMSSSCT outperforms the other time-frequency analysis (TFA) methods in processing analytical signals, especially in the presence of noise. Numerical examples of a Duffing nonlinear system with single degree of freedom and a two-layer shear frame structure with time-varying stiffness are used to verify the effectiveness of structural IF identification. Moreover, a nonlinear supported beam structure test is conducted and the LMSSSCT is utilized for structural IF identification. Numerical simulation and experimental results demonstrate that the presented LMSSSCT can effectively identify the IFs of nonlinear structures and time-varying structures with good accuracy and stability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1026-1039
• /
• 2014

We present a new method for generating sweep surfaces using bivariate B-spline motion. The sweep surface is defined as the trace of a single point under bivariate B-spline motion. Direct manipulation of the sweep surface is achieved by controlling its motion components while producing various editing effects. We demonstrate the effectiveness of our technique by modeling and deforming various three-dimensional shapes.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.659-662
• /
• 2000

다양한 보간 기법을 정리해 보고 이를 통해서 기존의 보간 기법의 한계를 고찰해 본다. 보간의 효율성과 보간 결과 영상의 화질과는 Trade off 관계가 있으며, 이를 적절한 수준에서 결정하는 것은 중요한 문제이다. 본 논문에서는 Quadratic B-spline을 기저 함수로 하는 윤곽보존형 보간 필터를 사용한 영상확대 알고리즘을 제안한다. Unser의 Cardinal Cubic spline함수에 비해 적은 하드웨어만으로도 이상적인 저역 통과 필터의 특성을 가지며, 입력영상의 윤곽의 방향성을 고려한 적응적인 보간 기법의 적용으로 화질이 우수한 영상확대 알고리즘을 제안한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.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.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.525-538
• /
• 1996

In the course of working on the preconditioning of $C^1$-bicubic collocation method, one has to deal with the $C^1$-bicubic splines. In this paper we are concerned with $C^1$-bicubic spline interpolant for a given function. We construct a basis for the space of $C^1$-bicubic splines for a given partition and find the $C^1$-bicubic spline interpolant for a given function defined on a set.