• Title/Summary/Keyword: B-Spline Function

Search Result 112, Processing Time 0.022 seconds

Genetic Algorithm based B-spline Fitting for Contour Extraction from a Sequence of Images (연속 영상에서의 경계추출을 위한 유전자 알고리즘 기반의 B-spline 적합)

  • Heo Hoon;Lee JeongHeon;Chae OkSam
    • 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.

Spline function solution for the ultimate strength of member structures

  • Zhang, Qi-Lin;Shen, Zu-Yan
    • Structural Engineering and Mechanics
    • /
    • v.2 no.2
    • /
    • pp.185-196
    • /
    • 1994
  • In this paper a spline function solution for the ultimate strength of steel members and member structures is derived based on total Lagrangian formulation. The displacements of members along longitudinal and transverse directions are interpolated by one-order B spline functions and three-order hybrid spline functions respectively. Equilibrium equations are established according to the principle of virtual work. All initial imperfections of members and effects of loading, unloading and reloading of material are taken into account. The influence of the instability of members on structural behavior can be included in analyses. Numerical examples show that the method of this paper can satisfactorily analyze the elasto-plastic large deflection problems of planar steel member and member structures.

Fuzzy System Representation of the Spline Interpolation for differentiable functions

  • Moon, Byung-Soo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.358-363
    • /
    • 1998
  • An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.

  • PDF

Analysis of Shell Structures using the Spline Finite Strip Method (Spline 유한대판법을 사용한 쉘 구조물의 해석)

  • 최창근;홍현석
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.10a
    • /
    • pp.19-26
    • /
    • 1998
  • The isoparametric spline finite strip method for degenerated shells is presented. In the formulation, both the geometry and the displacement field are represented by uniform cubic B-spline curves. Spline shell strip is degenerated stress-resultant shell with 6 dof at each node;and the penalty function method is used to incorporated the six dof,

  • PDF

A B-spline based Branch & Bound Algorithm for Global Optimization (전역 최적화를 위한 B-스플라인 기반의 Branch & Bound알고리즘)

  • Park, Sang-Kun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.24-32
    • /
    • 2010
  • This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

SPLINE HAZARD RATE ESTIMATION USING CENSORED DATA

  • Na, Myung Hwan
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.2
    • /
    • pp.99-106
    • /
    • 1999
  • In this paper, the spline hazard rate model to the randomly censored data is introduced. The unknown hazard rate function is expressed as a linear combination of B-splines which is constrained to be linear(or constant) in tails. We determine the coefficients of the linear combination by maximizing the likelihood function. The number of knots are determined by Bayesian Information Criterion. Examples using simulated data are used to illustrate the performance of this method under presenting the random censoring.

  • PDF

An O(h6 ) Quinltic Spline Interpolation for Quintic Spline Collocation Method

  • Chung, Seiyoung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.7 no.1
    • /
    • pp.237-242
    • /
    • 1994
  • An quintic spline interpolate to a function in $C^{10}$[a, b] and its O($h^6$) error behavior are presented when its fourth derivative satisfies some kind of end conditions. The O($h^6$) relations between its derivatives up to fourth order and the m-th derivatives of the given function are also given at the nodes.

  • PDF

Application of the B-Spline Based High Order Panel Method to the Floating Body Dynamics (B 스플라인 고차 패널법을 적용한 부유체 운동해석)

  • Ahn, Byoung-Kwon;Lew, Jae-Moon;Lee, Hyun-Yup;Lee, Chang-Sup
    • Journal of Ocean Engineering and Technology
    • /
    • v.22 no.5
    • /
    • pp.25-30
    • /
    • 2008
  • A B-spline based high order panel method was developed for the motion of bodies in an ideal fluid, either of infinite extent or with a free boundarysurface. In this method, both the geometry and the potential are represented by the B-spline, which guarantees more accurate results than most potential based low order methods. In the present work, we applied this B-spline based high order method to the radiation problem of floating bodies. The boundary condition on the free surface was satisfied by adopting a Kelvin-type Green function and irregular frequencies were removed by placing additional control points on the free surface surrounding the body. The numerical results were validated by comparison with existing numerical and experimental results.

A Performance Comparison of Sampling Rate Conversion Algorithms for Audio Signal (오디오 신호를 위한 표본화율 변환 알고리듬 성능 비교)

  • Lee Yong-Hee;Kim Rin-Chul
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.384-390
    • /
    • 2004
  • In this paper we compare the performance of 4 different algorithms for converting the sampling frequency of an audio from 44.1KHz to 48KHz. The algorithms considered here include the basic polyphase method. sine function based method. multi-stage method. and B-spline based method. For a fair comparison, the sampling rate converters using the 4 algorithms are redesigned under a high fidelity condition. Then, their H/W complexities are compared in terms of the computational complexity and the memory size. As a result, it is shown that the basic polyphase method and sine function based method outperform the other two in terms of the computational complexity, while the B-spline based method requires less memory than the others.