• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.555-559
• /
• 2009

난류응력은 순간속도성분을 시간평균성분과 편차성분의 합으로 보고 Navier-Stokes 방정식으로부터 Reynolds 방정식을 유도할 때 나타나게 된다. Reynolds 방정식으로부터 수심 적분된 천수방정식을 유도하는 과정에서 시간 평균된 유속성분을 수심 적분된 유속성분과 편차성분의 합으로 본다면, 분산응력 (dispersion stress)이라고 하는 추가적인 새로운 항이 잔류하게 된다. 점성응력, 난류응력, 그리고 분산응력을 통칭하여 유효응력 (effective stress)이라고 한다. 일반적으로 수심에 비해 수로 폭이 넓은 개수로에서는 유효응력이 흐름특성의 수치 근사해에 큰 영향을 미치지 못한다고 가정하여 2차원 수심적분 모형에서 유효응력을 생략하기도 한다. 또한 유효응력을 적용하더라도, 점성응력이 난류응력에 비해 무시할 만큼 작다고 가정하여 난류응력만을 적용하며, 분산응력은 무시된다. 하지만 만곡부에서는 원심력과 편수위로 인한 횡방향 압력의 불균형이 발생하기 때문에, 만곡부의 이차류가 발생되며, 유속의 연직방향 분포도 일정하지 않게 된다. 따라서 본 연구의 목적은 만곡부의 이차류 특성을 수심적분 2차원 모형에 반영하기 위해 분산응력을 고려한 모형의 개발 및 검증이다. 불규칙한 모의영역을 원활히 나타낼 수 있도록 곡선좌표계를 사용하는 여타 모형들과 달리 유한유소법을 이용하여 수치해를 구하며, 따라서 x, y 좌표축을 사용하는 데카르트 좌표계를 사용하여 지배방정식을 나타낸다. 분산응력의 유 무에 따른 수치결과를 Rozovskii의 $180^{\circ}$ 만곡수로 실내실험 자료와 비교하여 개발 모형을 검증한다.

• Journal of Advanced Navigation Technology
• /
• v.20 no.1
• /
• pp.53-58
• /
• 2016

In this paper, we propose a novel quadratic Kalman filter based object tracking algorithm using moving pictures. Quadratic Kalman filter, which is introduced recently, has not yet been applied to the problem of 3-dimensional (3-D) object tracking. Since the mapping of a position in 2-D moving pictures into a 3-D world involves non-linear transformation, appropriate algorithm must be chosen for object tracking. In this situation, the quadratic Kalman filter can achieve better accuracy than extended Kalman filter. Under the same conditions, we compare extended Kalman filter, unscented Kalman filter and sequential importance resampling particle filter together with the proposed scheme. In conculsion, the proposed scheme decreases the divergence rate by half compared with the scheme based on extended Kalman filter and improves the accuracy by about 1% in comparison with the one based on unscented Kalman filter.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.1-9
• /
• 2014

Generally, integral image used for autostereoscopic 3d display is generated for flat lens array, but flat lens array cannot provide a wide range of view for generated integral image because of narrow range of view. To make up for this flat lens array's weak point, curved lens array has been proposed, and due to technical and cost problem, approximate surface lens array composed of several flat lens array is used instead of ideal curved lens array. In this paper, we constructed an approximate surface lens array arranged for $20{\times}8$ square flat lens in 100mm radius sphere, and we could get about twice angle of view compared to flat lens array. Specially, unlike existing researches which manually generate integral image, we propose an OpenCL GPU parallel process algorithm for generating real-time integral image. As a result, we could get 12-20 frame/sec speed about various 3D volume data from $15{\times}15$ approximate surface lens array.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.74-86
• /
• 2005

In this paper, we proposed an algorithm for the approximation of high order FIR filters by low order IIR filters to efficient implementing two channel 3-D surround sound systems using Head-related transfer functions(HRTFs). The algorithm is based on a concept of the balanced model reduction. The binaural sounds using the approximated HRTFs are reproduced by headphone, and serves as a cue of sound image localization. HRTFs of dummy-head are approximated from 512-order FIR filters by 32-order IIR filters and compare with each other. .Experiment of sound image are carried out for 10 participants. We perform the experiment based on computer simulation and hardware experiment with TMS320C32. The results of the experiments show that the localization using the approximated HRTFs is the same accuracy as the case of FIR filters that simulate the HRTFs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.1
• /
• pp.39-48
• /
• 2013

This paper develops a 2-D moving least squares(MLS) difference method for Stefan problem by extending the 1-D version of the conventional method. Unlike to 1-D interfacial modeling, the complex topology change in 2-D domain due to arbitrarily moving boundary is successfully modelled. The MLS derivative approximation that drives the kinetics of moving boundary is derived while the strong merit of MLS Difference Method that utilizes only nodal computation is effectively conserved. The governing equations are differentiated by an implicit scheme for achieving numerical stability and the moving boundary is updated by an explicit scheme for maximizing numerical efficiency. Numerical experiments prove that the MLS Difference Method shows very good accuracy and efficiency in solving complex 2-D Stefan problems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.453-456
• /
• 2003

Spatial database systems achieve filtering steps with MBR(Minimum founding Rectangle) for efficient query processing, and then carry out refinement steps for candidate objects. While most operations require fast execution of filtering, it is necessary to increase the filtering rates and reduce the number of refinement steps in the low computing powered devices. The compact representation method is also needed in the mobile devices with low storage capacity. The paper proposes various approximation methods for efficient spatial operations in the multiplatform environments. This paper also designs a compression technique for MBR, which occupies almost 80% of index data in the two dimensional case. We also analyze the advantages and drawbacks of each method in terms of space utilization, filtering efficiency and speed.

• Journal of Wetlands Research
• /
• v.10 no.2
• /
• pp.67-79
• /
• 2008

The one-dimensional (1D) finite-difference method (FDM) with Abbott-Ionescu scheme and the two-dimensional (2D) finite-volume method (FVM) with an approximate Riemann solver (Osher scheme) for unsteady flow calculation in river are described. The two models have been applied to several problems including flow in a straight channel, flow in a slightly meandering channel and a flow in a meandering channel. The uniform rectangular channel was employed for the purpose of comparing results. A comparison is made between the results of computation on 1D and 2D flows including straight channel, slightly meandering channel and meandering channel application. The implementation of the finite-volume method allows complex boundary geometry represented. Agreement between FVM and FDM results regarding the discharge and stage is considered very satisfactory in straight channel application. It was concluded that a 1D analysis is sufficient if the channel is prismatic and remains straight. For curved (meandering) channels, a 2D or 3D model must be used in order to model the flow accurately.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.4
• /
• pp.375-382
• /
• 2008

The particular integral formulation for two(2D) and three(3D) dimensional inelastic transient dynamic stress analysis is presented. The elastostatic equation is used for the complementary solution. Using the concept of global shape function, the particular integrals for displacement and traction rates are obtained to approximate acceleration of the inhomogeneous equation. The Houbolt time integration scheme is used for the time-marching process. The Newton-Raphson algorithm for plastic multiplier is used to solve the system equation. Numerical results of four example problems are given to demonstrate the validity and accuracy of the present formulation.

• Journal of computational fluids engineering
• /
• v.6 no.2
• /
• pp.9-21
• /
• 2001

초음속 여객기의 천음속 순항 성능을 개선하기 위하여 날개의 플랩 꺽임각을 최적화하였다. 이를 위하여 3차원 Euler 코드와 adjoint 코드를 이용한 최적설계기법을 적용하였다. 설계변수로서, 앞전플랩 5개, 뒷전 플랩 5개 등 총 10개의 플랩의 꺽임각이 사용되었다. 설계과정중에 격자계 내부격자점의 수정을 위해 타원형방정식법을 이용하였다. 계산 시간의 단축을 위해 내부격자의 민감도는 무시하였다. 또한 본 설계문제에 근사구배기법의 적용가능성 여부를 조사하였다. 충격파가 없는 경우 앞전 플렙에 한하여 근사구배기법을 적용할 수 있음을 알았다. 최적설계기법으로 BFGS기법을 적용하여 항력을 최소화하였으며, 양력 및 날개 표면 마하수에 대한 제약조건을 적용하였다. 앞전 플랩의 최적화 및 앞전과 뒷전 플랩의 최적화 등 두 개의 설계 문제를 고려하였다. 성공적인 결과를 얻음으로써 본 설계방법의 타당성 및 효율성을 확인하였다.