• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.268-271
• /
• 2016

In video sequences, foreground object detection being composed of a background model and a background subtraction is an important part of diverse computer vision applications. However, object detection might fail in sudden illumination changes. In this letter, an illumination-robust background detection is proposed to address this problem. The method can provide quick adaption to current illumination condition using two background models with different adaption rates. Since the proposed method is a non-parametric approach, experimental results show that the proposed algorithm outperforms several state-of-art non-parametric approaches and provides low computational cost.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.5
• /
• pp.306-313
• /
• 2009

This paper presents the unique formation process of a volumetric space with the digital algorithm developed for Voronoi diagram in order to generate an effective parametric architectural form. By applying systematic parameters of architectural conditions within digital parametric tools, the interactions among sub-spaces developed by Voronoi diagram are enhanced by manipulating the spatial structures. In this paper, we discuss how the parametric distributing and zoning geometrical system can support designers in developing a free-formed space, and research on how this system creates a 3D volumetric space. With the in-depth research on the system and structure of Voronoi diagram, the approaches to the application of Voronoi diagram into architectural form generation are clarified to be an effective, creative and successful digital tool. The result of the application of the Voronoi diagram improves the design quality with systematic language in the sense that the sub-regions are created and controlled under the systematic and balanced hierarchy having dynamic relationships among each others with the restoration of the equilibrium of forces and tensions. This 3-dimensional Voronoi diagram provides another means for designers to solve architectural issues and to reinforce their design concepts.

• Wind and Structures
• /
• v.36 no.2
• /
• pp.105-120
• /
• 2023

The present study is performed to find the effect of corner recession on a square plan-shaped tall building. A series of numerical simulations have been carried out to find the two orthogonal wind force coefficients on various model configurations using Computational Fluid Dynamics (CFD). Numerical analyses are performed by using ANSYS-CFX (k-ℇ turbulence model) considering the length scale of 1:300. The study is performed for 0° to 360° wind angle of attack. The CFD data thus generated is utilised to fit parametric equations to predict alongwind and crosswind force coefficients, C_fx and C_fy. The precision of the parametric equations is validated by employing a wind tunnel study for the 40% corner recession model, and an excellent match is observed. Upon satisfactory validation, the parametric equations are further used to carry out multiobjective optimization considering two orthogonal force coefficients. Pareto optimal design results are presented to propose suitable percentages of corner recession for the study building. The optimization is based on reducing the alongwind and crosswind forces simultaneously to enhance the aerodynamic performance of the building.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2002.10a
• /
• pp.40-44
• /
• 2002

선박 설계시 최적화에 있어 종래에는 Random search Parametric study, Hook&Jeeves Method등이 사용되어져 왔으나 1960년대 Genetic algorithm이 소개되고 꾸준히 발전함과 함께 선박 설계에서도 Genetic algorithm이 사용되기 시작하였다. 본 논문에서는 이러한 Genetic algorithm 중 Simple Genetic algorithm(SGA), Micro Genetic algorithm(MGA), Threshold Genetic algorithm(TGA), Hybrid Genetic algorithm(HGA)을 선박 설계에 적용하여 그 성능을 비교 검토해 보았다. MGA는 계산 부담을 줄이기 위해 작은 개체로 효율적인 탐색을 하며, TGA는 local optimum에서 쉽게 벗어나게 할 수 있는 특징이 있다. HGA는 Hook&Jeeves Method를 Genetic algorithm과 병합되어 있다. 이를 바탕으로 본 논문에서 망간단괴 수송선의 경제성을 평가한다. 평가 방법은 연간 300만톤을 생산한다고 가정하여 연간 운송 용적을 동호제약으로 해서 최적화를 한 뒤, 이를 이용하여 몇가지 Case로 나누어서 초기 자본, 연간 비용, 20년간 총 비용을 계산하여 가장 경제적인 선박을 선택한다.

• Structural Engineering and Mechanics
• /
• v.21 no.5
• /
• pp.507-518
• /
• 2005

In the shear-lag analysis of structures deterministic procedure is insufficient to provide complete information. Probabilistic analysis is a holistic approach for analyzing shear-lag effects considering uncertainties in structural parameters. This paper proposes an efficient and accurate algorithm to analyze shear-lag effects of structures with parameter uncertainties. The proposed algorithm integrated the advantages of the response surface method (RSM), finite element method (FEM) and Monte Carlo simulation (MCS). Uncertainties in the structural parameters can be taken into account in this algorithm. The algorithm is verified using independently generated finite element data. The proposed algorithm is then used to analyze the shear-lag effects of a simply supported beam with parameter uncertainties. The results show that the proposed algorithm based on the central composite design is the most promising one in view of its accuracy and efficiency. Finally, a parametric study was conducted to investigate the effect of each of the random variables on the statistical moment of structural stress response.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.25-29
• /
• 2001

We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.917-922
• /
• 1990

Pattern classification is an essential step in automatic robotic assembly which joins together finite number of seperated industrial parts. In this paper, a fast and systematic algorithm for classifying occlusion-free objects is proposed, using the notion of incremental circle transform which describes the boundary contour of an object as a parametric vector function of incremental elements. With similarity transform and line integral, normalized determinant curve of an object classifies each object, independent of position, orientation, scaling of an object and cyclic shift of the stating point for the boundary description.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1049-1054
• /
• 1990

We formulate optimal quadratic regulator problems with trajectory sensitivity terms as a optimization problem for a fixed controller structure. Using well-known techniques for parametric LQ problems, we give an algorithm to obtain suboptimal feedback gains by iterative solutions of two Lyapunov equations. A numerical example is given to illustrate the effectiveness of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.51-60
• /
• 1990

In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.