• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2003년도 International Meeting on Information Display
• /
• pp.122-125
• /
• 2003

We describe a new method to initialize the raster and convergence of a flat intelligent tracking (F!T) tube. By splitting up the initialization algorithm into three parts, it can comply with the variety of boundary conditions that are stated for a consumer product. Experiments on raster initialization have shown that the new algorithm speeds up the initialization by one order of magnitude.

• ETRI Journal
• /
• 제36권3호
• /
• pp.407-417
• /
• 2014

A new-generation video coding standard, named High Efficiency Video Coding (HEVC), has recently been developed by JCT-VC. This new standard provides a significant improvement in picture quality, especially for high-resolution videos. However, one the most important challenges in HEVC is time complexity. A quadtree-based structure is created for the encoding and decoding processes and the rate-distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. This provides a high encoding quality, but also causes computational complexity. We focus on a reduction scheme of the computational complexity and propose a new approach that can terminate the quadtree-based structure early, based on the RD costs of the parent and current levels. Our proposed algorithm is compared with HEVC Test Model version 10.0 software and a previously proposed algorithm. Experimental results show that our algorithm provides a significant time reduction for encoding, with only a small loss in video quality.

• 대한기계학회논문집
• /
• 제18권3호
• /
• pp.653-661
• /
• 1994

In this paper the CSCM type upwind flux difference splitting Navier-Stokes method has been applied to study the ARL-SL19 supersonic/transonic compressor cascade flow. H-type grid was chosen for its simplicity in applying cyclic tridiagonal matrix algorithm along with conventional slip/no-slip boundary conditions. The thin-layer algebraic model of Baldwin-Lomax was employed for the calculation of turbulent flows. The test case inlet Mach No. was 1.612 and inlet/exit pressure ratio($P_2/P_1$) was 2.15. The results were compared with experimental results from current method were compared well in suction surface with the experiments and other computational results; however, not well in pressure surface. It might be due to the complex flowfields such as shock/boundary layer interaction, turbulence, and flow separation, etc. In the future, a proper turbulence modelling and adaptive grid system will be studied to improve the solution quality.

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

The thin-layer Navier-Stokes equations are solved for the hypersonic flow over blunt cone configurations with applications to laminar as well as turbulent flows. The equations are expressed in the forms of flux-vector splitting and explicit algorithm. The upwind schemes of Steger-Warming and van Leer are investigated in their ability to accurately predict the heating loads along the surface of the body. A comparison with the second order extensions of these schemes is made and a hybrid scheme incorporating a combination of central differencing and flux-vector-splitting is presented. This scheme is also investigated in its ability to accurately predict heat transfer distributions.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2006년도 정기 학술대회 논문집
• /
• pp.389-394
• /
• 2006

Fully flexible cell preserves Hamiltonian in structure, so the symplectic time integrator is applied to the equations of motion. Primarily, generalized leapfrog time integration (GLF) is applicable, but the equations of motion by GLF have some of implicit formulas. The implicit formulas give rise to a complicate calculation for coding and need an iteration process. In this paper, the time integration formulas are obtained for the fully flexible cell molecular dynamics simulation by using the splitting time integration. It separates flexible cell Hamiltonian into terms corresponding to each of Hamiltonian term, so the simple and completely explicit recursion formula was obtained. The explicit formulas are easy to implementation for coding and may be reduced the integration time because they are not need iteration process. We are going to compare the resulting splitting time integration with the implicit generalized leapfrog time integration.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 2002년도 하계학술발표대회 논문집 제21권 1호
• /
• pp.259-262
• /
• 2002

벡터양자화에서 주어진 학습벡터를 가장 잘 대표할 수 있는 코드벡터의 집합인 코드북을 구하는 것은 가장 중요한 문제이다. 이러한 코드북을 구하는 알고리즘 중에서 가장 대표적인 방법은 K-means 알고리즘으로 그 성능이 초기 코드북에 크게 의존한다는 문제점을 가지고 있어 여러 가지 초기 코드북을 설계하는 알고리즘이 제안되어 왔다. 본 논문에서는 splitting 방법을 이용한 수정된 초기 코드북 생성 알고리즘을 제안하고자 한다. 제안된 방법에서는 기존외 splitting 방법을 적용하여 초기 코드북을 생성하되, 미소분리 과정 시 학습벡터의 수렴 빈도가 가장 낮은 코드벡터를 제거하고 수렴 빈도가 가장 높은 코드벡터를 미소분리 하여 수렴 빈도가 가장 낮은 코드벡터와 대체해가며 초기 코드북을 설계 한다. 제안된 방법의 적용온 기존 방법에서 MSE(mean square error)의 감소율이 가장 작은 미소분리 과정에서 시작하여 원하는 코드북 크기를 얻을 때까지 반복한다. 제안된 방법으로 생성된 초기 코드북을 사용하여 K-means 알고리즘을 수행한 결과 기존의 splitting 방법으로 생성된 초기 코드북을 사용한 경우보다 코드북의 성능이 향상되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권12호
• /
• pp.3855-3867
• /
• 2022

Name separation (splitting full names into surnames and given names) is not a tedious task in a multiethnic country because the procedure for splitting surnames and given names is ethnicity-specific. Malaysia has multiple main ethnic groups; therefore, separating Malaysian full names into surnames and given names proves a challenge. In this study, we develop a two-phase framework for Malaysian name separation using deep learning. In the initial phase, we predict the ethnicity of full names. We propose a recurrent neural network with long short-term memory network-based model with character embeddings for prediction. Based on the predicted ethnicity, we use a rule-based algorithm for splitting full names into surnames and given names in the second phase. We evaluate the performance of the proposed model against various machine learning models and demonstrate that it outperforms them by an average of 9%. Moreover, transfer learning and fine-tuning of the proposed model with an additional dataset results in an improvement of up to 7% on average.

• 한국항공우주학회지
• /
• 제40권1호
• /
• pp.23-34
• /
• 2012

우주 발사체는 치밀한 비행 계획에 따라 사전에 결정된 경로를 비행하도록 설계된다. 그러나 비정상으로 추력이 종료되거나 계획된 비행경로를 이탈한 경우, 또는 자유 낙하 중인 대기권 재진입 발사체에 대한 추적 과정에서 추적 센서의 측정이 불가하게 된 경우 등에는 별도의 추적 장비를 이용한 추적 또는 신속한 낙하지점 추정이 필요하다. 본 논문에서는 클러터 환경에서 무추력 탄도 비행 중인 발사체에 대한 위치 정보를 획득하고 트랙을 생성 및 유지하기 위하여 Integrated Track Splitting(ITS) 알고리듬과 Extended Kalman Filter(EKF)를 결합한 ITS-EKF 알고리듬 적용을 제안한다. 따라서 대기권 재진입 발사체에 대하여 ITS-EKF 알고리듬을 적용한 시뮬레이션을 통해 추적 성능 확인 및 지상 낙하지점을 추정한다. ITS-EKF 알고리듬 적용 결과의 적절성을 확인하기 위하여 ITS와 Particle Filter를 결합한 ITS-PF 알고리듬을 적용하여 구한 추적 성능 및 낙하지점 분포 결과와 비교하여 제시된 알고리듬이 효과적인 실시간 On-line 낙하지점 추정에 사용이 가능함을 확인한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제22권1호
• /
• pp.75-89
• /
• 2018

This paper presents the numerical valuation of the arithmetic Asian option by using the operator-splitting method (OSM). Since there is no closed-form solution for the arithmetic Asian option, finding a good numerical algorithm to value the arithmetic Asian option is important. In this paper, we focus on a two-dimensional PDE. The OSM is famous for dealing with plural-dimensional PDE using finite difference discretization. We provide a detailed numerical algorithm and compare results with MCS method to show the performance of the method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권4호
• /
• pp.201-210
• /
• 2010

We propose a new robust and accurate method for the numerical solution of medical image segmentation. The modified Allen-Cahn equation is used to model the boundaries of the image regions. Its numerical algorithm is based on operator splitting techniques. In the first step of the splitting scheme, we implicitly solve the heat equation with the variable diffusive coefficient and a source term. Then, in the second step, using a closed-form solution for the nonlinear equation, we get an analytic solution. We overcome the time step constraint associated with most numerical implementations of geometric active contours. We demonstrate performance of the proposed image segmentation algorithm on several artificial as well as real image examples.