• Title/Summary/Keyword: 스테판 문제

Search Result 3, Processing Time 0.018 seconds

A Numerical Study on the Phase-change Heat transfer problem in Cryosurgery (냉동수술시 수반되는 상변화 열전달 문제에 대한 수치해석적 연구)

  • 김동혁
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.20 no.3
    • /
    • pp.162-170
    • /
    • 1996
  • A numerical study on the Stefan problem occurred in cryosurgery is performed. Crank-Nicholson type finite difference algorithm based on the enthaly method is adapted to solve the phase change problem in this study. As it is a moving boundary problem, special emphasis is put on the estimation of the freezing front location. Two cases selected here are freezings of human tissue by disk type cryoprobe and by hemispherical one. In both cases, the heat flows are considered to be one dimensional. The calculated results using enthalpy method are compared with those using the program TRUMP and with Neumann's solution. These results agree guite well with each other. While it is pretty difficult to get accurate freezing front location by TRUMP due to the so- called "phase change knee" occured during the phase change, the algorithm based on the enthalpy method is proved to be very powerful to cope with this kind of problem.f problem.

  • PDF

Study on the Phase Interface Tracking Numerical Schemes by Level Set Method (Level Set 방법에 의한 상경계 추적 수치기법 연구)

  • Kim, Won-Kap;Chung, Jae-Dong
    • Proceedings of the SAREK Conference
    • /
    • 2006.06a
    • /
    • pp.116-121
    • /
    • 2006
  • Numerical simulations for dendritic growth of crystals are conducted in this study by the level set method. The effect of order of difference is tested for reinitialization error in simple problems and authors founded in case of 1st order of difference that very fine grids have to be used to minimize the error and higher order of difference is desirable to minimize the reinitialization error The 2nd and 4th order Runge-Kutta scheme in time and 3rd and 5th order of WENO schemes with Godunov scheme are applied for space discretization. Numerical results are compared with the analytical theory, phase-field method and other researcher's level set method.

  • PDF

Hierarchical Feature Based Block Motion Estimation for Ultrasound Image Sequences (초음파 영상을 위한 계층적 특징점 기반 블록 움직임 추출)

  • Kim, Baek-Sop;Shin, Seong-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.402-410
    • /
    • 2006
  • This paper presents a method for feature based block motion estimation that uses multi -resolution image sequences to obtain the panoramic images in the continuous ultrasound image sequences. In the conventional block motion estimation method, the centers of motion estimation blocks are set at the predetermined and equally spaced locations. This requires the large blocks to include at least one feature, which inevitably requires long estimation time. In this paper, we propose an adaptive method which locates the center of the motion estimation blocks at the feature points. This make it possible to reduce the block size while keeping the motion estimation accuracy The Harris-Stephen corner detector is used to get the feature points. The comer points tend to group together, which cause the error in the global motion estimation. In order to distribute the feature points as evenly as Possible, the image is firstly divided into regular subregions, and a strongest corner point is selected as a feature in each subregion. The ultrasound Images contain speckle patterns and noise. In order to reduce the noise artifact and reduce the computational time, the proposed method use the multi-resolution image sequences. The first algorithm estimates the motion in the smoothed low resolution image, and the estimated motion is prolongated to the next higher resolution image. By this way the size of search region can be reduced in the higher resolution image. Experiments were performed on three types of ultrasound image sequences. These were shown that the proposed method reduces both the computational time (from 77ms to 44ms) and the displaced frame difference (from 66.02 to 58.08).