• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.427-439
• /
• 2006

The SBF (Simple Boundary Follower) is a boundary-following algorithm, and is used mainly for image recognition and presentation. The SBF is very popular because of its simplicity and efficiency in tracing the boundary of an object from an acquired binary image; however, it does have two drawbacks. First, the SBF cannot consistently process inner or inner-outer corners according to the follower's position and direction. Second, the SBF requires movement operations for the non-boundary pixels that are connected to boundary pixels. The MSBF (Modified Simple Boundary Follower) has a diagonal detour step for preventing inner-outer corner inconsistency, but is still inconsistent with inner-corners and still requires extra movement operations on non-boundary pixels. In this paper, we propose the ISBF (Improved Simple Boundary Follower), which solves the inconsistencies and reduces the extra operations. In addition, we have classified the tour maps by paths from a current boundary pixel to the next boundary pixel and have analyzed SBF, MSBF, and ISBF. We have determined that the ISBF has no inconsistency issues and reduces the overall number of operations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.431-436
• /
• 2006

외곽선 추적 알고리즘은 영상 인식 및 표현에 있어서 물체의 기본 성질을 파악하는데 중요하다. 따라서 많은 알고리즘들이 연구되어 왔으며, 이중에는 간단한 경계선 추적자 알고리즘(SBF: Simple Boundary Follower)이다. 이외에도 수정된 간단한 경계선 추적자 알고리즘 (MSBF: Modified Simple Boundary Follower), 개선된 간단한 경계선 추적자 알고리즘(ISBF: Improved Simple Boundary Follower), 무어-네이버 추적 알고리즘(MNT: Moore-Neighbor Tracer), 방사형 탐색 알고리즘(RSA: Radial Sweep Algorithm), 그리고 Theo Pavlidis 알고리즘(TPA)이 있다. 이러한 알고리즘들은 추적 경로 특성들이 다르며 각기 장점과 제약성이 있다.외곽선 알고리즘들의 제약성은 크게 두 가지로 나눌 수 있다. 하나는 알고리즘 특성에 따라 외곽선 픽셀간 인접 형태에 따라 추적하지 못하는 경우가 존재할 수 있다는 것이다. 또 다른 하나는 외곽선 추적 알고리즘의 시작과 종료 조건에 따라서 특정 위치 픽셀들을 찾지 못하는 경우도 존재한다는 점이다. 본 논문에서는 이러한 문제점들을 중심으로 외곽선 추적 알고리즘들의 성능을 분석하였다. 또한, ISBF의 시작 조건과 TPA의 인너코너 추적을 개선하는 기법들을 제안하여 이를 해결토록 하였다. 실험 결과 제안한 기법들은 외곽선 추적 성능을 개선하는데 효과적이었다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.5
• /
• pp.1-8
• /
• 2018

This paper proposes a simple encryption technology for space-time block coding algorithm. Space-time block coding algorithm uses two antennas in transmitting data which consists of original data and transformed data for the purpose of combining in the receiver. This kind of two transmission antenna data could be exchanged and transmitted on each other's antenna individually, which can be used as a simple encryption algorithm. Encryption timing control informations should be shared between transmitter and receiver beforehand. It is shown that the proposed architecture can give performance enhancement compared with no encryption cases.

• Journal of the Korea Society for Simulation
• /
• v.32 no.1
• /
• pp.23-34
• /
• 2023

The purpose of this paper is to review global stochastic optimization algorithms(GSOA) in case binary response experimentation is used and to compare the performances of them. GSOAs utilise estimator of probability of success $\^p$ instead of population probability of success p, since p is unknown and only known by its estimator which has stochastic characteristics. Hill climbing algorithm algorithm, simple random search, random search with random restart, random optimization, simulated annealing and particle swarm algorithm as a population based algorithm are considered as global stochastic optimization algorithms. For the purpose of comparing the algorithms, two types of test functions(one is simple uni-modal the other is complex multi-modal) are proposed and Monte Carlo simulation study is done to measure the performances of the algorithms. All algorithms show similar performances for simple test function. Less greedy algorithms such as Random optimization with Random Restart and Simulated Annealing, Particle Swarm Optimization(PSO) based on population show much better performances for complex multi-modal function.

• Journal of computational fluids engineering
• /
• v.13 no.4
• /
• pp.86-95
• /
• 2008

For analyses of multi-phase flows in a water-cooled nuclear power plant, a three-dimensional SIMPLE-algorithm based hydrodynamic solver CUPID-S has been developed. As governing equations, it adopts a two-fluid three-field model for the two-phase flows. The three fields represent a continuous liquid, a dispersed droplets, and a vapour field. The governing equations are discretized by a finite volume method on an unstructured grid to handle the geometrical complexity of the nuclear reactors. The phasic momentum equations are coupled and solved with a sparse block Gauss-Seidel matrix solver to increase a numerical stability. The pressure correction equation derived by summing the phasic volume fraction equations is applied on the unstructured mesh in the context of a cell-centered co-located scheme. This paper presents the numerical method and the preliminary results of the calculations.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.184-190
• /
• 2000

A well-known pressure correction method, a SIMPLE algorithm is extended to treat compressible flows. Collocated grids are used and density is linked to pressure via an equation of state. The influence of pressure on density in the case of compressible flows is implicitly incorporated into the extended SIMPLE algorithm. The first-order Upwind and high-order Quick scheme are compared with respect to an accuracy and convergence time at all speeds. The extended method is verified on a number of test cases and the results we compared with other numerical results available in the literature. The calculated results show that the Quick scheme improves accuracy at all speed and also reduces the calculation time at supersonic flows, compared with the Upwind scheme.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.71-78
• /
• 2008

For analyses of multi-phase flows in a water-cooled nuclear power plant, a three-dimensional SIMPLE-algorithm based hydrodynamic solver CUPID-S has been developed. As governing equations, it adopts a two-fluid three-field model for the two-phase flows. The three fields represent a continuous liquid, a dispersed droplets, and a vapour field. The governing equations are discretized by a finite volume method on an unstructured grid to handle the geometrical complexity of the nuclear reactors. The phasic momentum equations are coupled and solved with a sparse block Gauss-Seidel matrix solver to increase a numerical stability. The pressure correction equation derived by summing the phasic volume fraction equations is applied on the unstructured mesh in the context of a cell-centered co-located scheme. This paper presents the numerical method and the preliminary results of the calculations.

• Journal of computational fluids engineering
• /
• v.5 no.2
• /
• pp.1-8
• /
• 2000

A well-known pressure correction method, a SIMPLE algorithm, is extended to treat compressible flows. Collocated grids are used and density is linked to pressure via an equation of state. The influence of pressure on density in the case of compressible flows is implicitly incorporated into the extended SIMPLE algorithm. The first-order Upwind and high-order Quick scheme are compared with respect to an accuracy and convergence time at all speeds. The extended method is verified on a number of test cases and the results are compared with other numerical results available in the literature. The calculated results show that the Quick scheme improves accuracy at all speed and also reduces the calculation time at supersonic flows, compared with the Upwind scheme.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.71-78
• /
• 2008

For analyses of multi-phase flows in a water-cooled nuclear power plant, a three-dimensional SIMPLE-algorithm based hydrodynamic solver CUPID-S has been developed. As governing equations, it adopts a two-fluid three-field model for the two-phase flows. The three fields represent a continuous liquid, a dispersed droplets, and a vapour field. The governing equations are discretized by a finite volume method on an unstructured grid to handle the geometrical complexity of the nuclear reactors. The phasic momentum equations are coupled and solved with a sparse block Gauss-Seidel matrix solver to increase a numerical stability. The pressure correction equation derived by summing the phasic volume fraction equations is applied on the unstructured mesh in the context of a cell-centered co-located scheme. This paper presents the numerical method and the preliminary results of the calculations.

• Journal of Korean Association for Spatial Structures
• /
• v.8 no.3
• /
• pp.75-82
• /
• 2008

In this study, the modified genetic algorithm, D-GA, is proposed. D-GA is a hybrid genetic algorithm combined a simple genetic algorithm and the local search algorithm using direction vectors. Also, two types of direction vectors, learning direction vector and random direction vector, are defined without the sensitivity analysis. The accuracy of D-GA is compared with that of simple genetic algorithm. It is demonstrated that the proposed approach can be an effective optimization technique through a minimum weight structural optimization of ten bar truss.