• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 1997년도 추계 학술대회논문집
• /
• pp.73-80
• /
• 1997

Objective of the present study is to examine the convergence characteristics of the various multi-stage Runge-Kutta methods in solving the incompressible Navier-Stokes equations of a time-marching from casted by the artificial compressibility method. Convergence characteristics are examined over 2-stage, 4-stage and hybrid type (using 4-, 3-, 2-stages sequentially) Runge-Kutta methods for a laminar lid-driven cavity flow, and also for a turbulent bump channel flow using Chien's low-Reynolds number turbulence model. Efforts are made to establish a stable and fast convergent multi-stage Runge-Kutta method with minimal artificial dissipations.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1129-1144
• /
• 2020

The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

• 융합신호처리학회논문지
• /
• 제12권4호
• /
• pp.267-273
• /
• 2011

본 논문은 자기공명 뇌영상을 대상으로 뇌종양 영역을 자동으로 분할하기 위한 방법을 제안한다. 정상적인 뇌영상은 좌우로 대칭인 특징을 지니는 반면에 종양이 존재하는 뇌영상은 종양세포와 부종 및 괴사로 인해 비대칭적인 특징을 가진다. 본 논문에서는 이러한 대칭성을 뇌영상내에 종양영역의 존재 유무를 판별할 수 있는 기준으로 이용한다. 대칭성 분석을 위해서 뇌영역의 윤곽선 정보를 이용해 중심축을 생성하였으며 이는 사전정보를 이용하지 않고 영상의 자체 정보만을 해석해서 중심축을 추출할 수 있다는 점에서 기존의 영상 정합을 통해 해부학적 위치 정보를 추출하고 이를 이용하여 중심축을 찾는 방법과 구별된다. 자기공명 영상에서 정상뇌의 조직은 크게 3가지 클러스터로 분할되며 각 클러스터가 포함하는 영역은 백질과 회백질영역을 포함하는 뇌 실질영역, 뇌척수액(csf)영역, 두개골, 지방 및 뇌막 영역 등으로 나뉜다. 종양이 포함된 영상은 종양과 부종 및 괴사 영역이 추가적으로 존재하며 이는 클러스터링을 이용한 분할을 통해서 구분될 수 있다. 분할된 종양 영역의 중심점은 다음 슬라이스의 종양 영역의 경계를 검출하기 위한 레벨셋 알고리즘에 적용되어 전체 볼륨의 종양 영역의 경계선을 추출하기 위한 초기 시드로 이용된다. 본 논문에서는 3차원 볼륨의 영상(슬라이스)중에서 종양 영역이 존재하는 슬라이스의 종양 영역을 분할하여 이후의 슬라이스에서는 분할작업을 수행하지 않고 영역의 경계선만 추출한다. 자카드 지수와 처리 시간의 비교 분석을 통해 기존의 방법과 비슷한 성능과 빠른 속도로 종양 영역을 분할할 수 있다는 것을 보인다.

• 한국화재소방학회논문지
• /
• 제11권4호
• /
• pp.3-14
• /
• 1997

The smoke filling process for the atrium space containing a fire source is simulated using two types of deterministic fire model : Zone model and Field model. The zone model used is the CFAST(version 1.6) model developed at the Building and Fire Research Laboratories, NIST in the USA. The field model is a self-developed frie field model based on Computational Fluid Dynamic (CFD) theories. This article is focused on finding out the smoke movement and temperature distribution in atrium space which is cubic in shape. For solving the liked set of velocity and pressure equation, the PISO algorithm, which strengthened the velocity-pressure coupling, was used. Since PISO algorithm is a time-marching procedure, computing time si very fast. A computational procedure for predicting velocity and temperature distribution in fire-induced flow is based on the solution, in finite volume method and non-staggered grid system, of 3-dimensional equations for the conservation of mass, momentum, energy, species and so forth. The fire model i.e Zone model and Field model predicted similar results for clear heights and the smoke layer temperature.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.