• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.191-209
• /
• 2008

In this paper, we model grain boundary evolution based on a multiple level set method. Grain boundary migration under a curvature-induced driving force is considered and the level set method is employed to deal with the resulting topological changes of grain structures. The complexity of using a level set method for modeling grain structure evolution is due to its N-phase nature and the associated geometry compatibility constraint. We employ a multiple level set method with a predictor-multicorrectors approach to reduce the gaps in the triple junctions down to the grid resolution level. A ghost cell approach for imposing periodic boundary conditions is introduced without solving a constrained problem with a Lagrange multiplier method or a penalty method. Numerical results for both uniform and random grain structures evolution are presented and the results are compared with the solutions based on a front tracking approach (Chen and Kotta et al. 2004b).

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.568-571
• /
• 2008

The computation of moving interface by the level set method typically requires reinitializations of level set function. An inaccurate estimation of level set function ${\phi}$ results in incorrect free-surface capturing and thus errors such as mass gain/loss. Therefore, accurate and robust reinitialization process is essential to the free-surface flows. In the present paper, we pursue further development of the reinitialization process, which evaluates directly level set function ${\phi}$ using a normal vector in the interface without solving the re-distancing equation of hyperbolic type. The Taylor-Galerkin approximation and P1P1splitting FEM are adopted to discretize advection equation of the level set function and the Navier-Stokes equation, respectively. Advection equation of free surface and re-initialization process are validated with benchmark problems, i.e., a broken dam flow and time-reversed single vortex flow. The simulation results are in good agreement with the existing results.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.32 no.10
• /
• pp.754-760
• /
• 2008

Computation of moving interface by the level set method typically requires the reinitialization of level set function. An inaccurate estimation of level set function $\phi$ results in incorrect free-surface capturing and thus errors such as mass gain/loss. Therefore, an accurate and robust reinitialization process is essential to the simulation of free-surface flows. In the present paper, we pursue further development of the reinitialization process, which evaluates level set function directly using a normal vector on the interface without solving there-distancing equation of hyperbolic type. The Taylor-Galerkin approximation and P1P1 splitting/SUPG (Streamline Upwind Petrov-Galerkin) FEM are adopted to discretize advection equation of the level set function and the incompressible Navier-Stokes equation, respectively. Advection equation and re-initialization process of free surface capturing are validated with benchmark problems, i.e., a broken dam flow and timereversed single vortex flow. The simulation results are in good agreement with the existing results.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3E
• /
• pp.118-135
• /
• 2009

The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.354-359
• /
• 2007

A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, an inner-front creation algorithm is proposed, in which the sizes, positions, and number of new inner-fronts during the optimization process can be globally and consistently identified. To update the level set function during the optimization process, the least-squares finite element method is employed. As demonstrative examples for the flexibility and usefulness of the proposed method, the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

• 한국전산유체공학회:학술대회논문집
• /
• 2011.05a
• /
• pp.10-13
• /
• 2011

A level set method is proposed to simulate the incompressible two-phase flow considering the effect of surface tension. For reinitialization of level set junction, a direct approach method is employed, instead of solving hyperbolic type equation. A mixed element is adopted, so that the continuity mid Navier-Stokes equations are solved by using the quadratic elements (six-node triangular element mid nine-node quadrilateral element), mid the level set function is solved by using the linear elements (three-node triangular element mid four-node quadrilateral element). In order to verify the accuracy mid robustness of the codes, the present methods are applied to a few benchmark problems. It is confirmed that the present results are in good qualitative mid quantitative agreements with the existing studies.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.86-92
• /
• 2015

A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.157-162
• /
• 2007

A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, in this regard, an inner-front creation algorithm is proposed. in which the sizes. shapes. positions, and number of new inner-fronts during the optimization process can be globally and consistently identified by considering both the value of a given criterion for inner-front creation and the occupied volume (area) of material domain. To facilitate the inner-front creation process, the inner-front creation map which corresponds to the discrete valued criterion of inner-front creation is applied to the level set function. In order to regularize the design domain during the optimization process, the edge smoothing is carried out by solving the edge smoothing partial differential equation (PDE). Updating the level set function during the optimization process, in the present work, the least-squares finite element method (LSFEM) is employed. As demonstrative examples for the flexibility and usefulness of the proposed method. the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.17 no.3
• /
• pp.158-165
• /
• 2005

In order to analyze incompressible two-phase flow, Level Set method was applied on pseudo-compressibility formulation. Level Set function is defined as a signed distance function from the phase interface, and gives the information of the each phase location and the geometric data to the flow. In this study, Level Set function transport equation was coupled with flow conservation equations, and owing to pseudo-compressibility technique we could solve the resultant vector equation iteratively. Two-phase flow analysis code was developed on general curvilinear coordinate, and numerical tests of bubble dynamics and surging wave problems demonstrate its capability successfully.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.6 s.237
• /
• pp.703-710
• /
• 2005

A finite element discretization of the advection and redistancing equations of level set method has been studied. It has been shown that Galerkin spatial discretization combined with Crank-Nicolson temporal discretization of the advection equation of level set yields a good result and that consistent streamline upwind Petrov-Galerkin(CSUPG) discretization of the redistancing equation gives satisfactory solutions for two test problems while the solutions of streamline upwind Petrov-Galerkin(SUPG) discretization are dissipated by the numerical diffusion added for the stability of a hyperbolic system. Furthermore, it has been found that the solutions obtained by CSUPG method are comparable to those by second order ENO method.