• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1980-1987
• /
• 1999

Restored image is always lower quality than original one due to distortion and noise. The purpose of image restoration is to improve the image quality by fixing the noise or distortion information. One category of spatial filters for image restoration is linear filter. This filter algorithm is easily implemented and can be suppressed the Gaussian noise effectively, but not so good performance for spot or impulse noise. In this paper, we propose the nonlinear spatial filter algorithm for image restoration called the optimal adaptive multistage filter(OAMF). The OAMF is used to reduce the filtering time, increases the noise suppression ratio and preserves the edge information. The OAMF optimizes the adaptive multistage filter(AMF) by using weight learning algorithm of back-propagation learning algorithm. Simulation results of this filter algorithm are presented and discussed.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.2 s.72
• /
• pp.115-124
• /
• 2006

The 1st and 2nd tension forces of the PSSC(Prestressed Steel and Concrete) grider constructed with commercial rolling beams and concrete are optimally designed. The design variables are the 1st and 2nd tension forces due to multi-step prestressing and live load. The objective function is set to the maximum live load. Design conditions are allowable stresses at the top and bottom of slab, beam and infilled concrete due at the several construction stages. A Matlab based optimization program is developed. The results show that the tendon position as well as concrete compression strength have significant influence on the beam strength.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.3
• /
• pp.453-462
• /
• 2002

Discrete-sizing or standardized steel profiles are used in steel design and construction practice. However, most of numerical optimization methods follow additional step(round-up discrete-sizing routine) to use the standardized steel section profiles, and accordingly the optimality of the resulting design nay be doubtful. Thus, in this paper, an efficient multi-level optimization algorithm is proposed to improve the shortcoming of the conventional optimization methods using the round-up discrete-sizing routine. Also, multi-level optimization technique with a decomposition method that separates both system-level and element-level is incorporated in the algorithm to enhance the performance of the proposed algorithms. The proposed algorithm is expected to achieve considerable improvement on both the efficiency of the numerical process and the accuracy of the global optimum.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.450-453
• /
• 2004

본 연구는 리드타임이 상이한 다단계의 공급 사슬에서 수송비용과 재고비용을 최소화하는 다기간의 차량일정계획 수립에 관한 연구이다. 일반적인 공급사슬모형과 차량일정계획 문제를 통합한 모형으로서, 각 단계의 가용차량과 차량 용량이 제한된 제약조건하에서 비용을 최소화하는 차량일정을 구하는 문제이다. 본 연구에서는 이에 대한 최적화 수리모형과 2단계의 분할해법을 제시하였으며, 다양한 공급사슬모형에 대한 발견적 기법의 성능을 분석하였다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.143-150
• /
• 2004

An optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen for design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size for each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.42-45
• /
• 2002

In this paper, multiphase optimization of machine Tool structure is presented. The final goal is to obtain 1) light weight, 2) statically and dynamically rigid. and 3) thermally stable structure. The entire optimization process is carried out in three phases. In the first phase, multiple static optimization problem with two objective functions is treated using Pareto genetic algorithm. where two objective functions are weight of the structure and static compliance. In the second phase, maximum receptance is minimized using simple genetic algorithm. And the last phase, thermal deflection to moving heat sources is analyzed using Predictor-Corrector Method. The method is applied to a high speed line center design which takes the shape of back-column structure.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.1 s.68
• /
• pp.123-134
• /
• 2004

In this research, a multilevel decomposition technique to enhance the efficiency of the configuration optimization of truss structures was proposed. On the first level, the nonlinear programming problem was formulated considering cross-sectional areas as design variables, weight, or volume as objective function and behavior under multiloading condition as design constraint. Said nonlinear programming problem was transformed into a sequential linear programming problem. which was effective in calculation through the approximation of member forces using behavior space approach. Such approach has proven to be efficient in sensitivity analysis and different form existing shape optimization studies. The modified method of feasible direction (MMFD) was used for the optimization process. On the second level, by treating only shape design variables, the optimum problem was transformed into and unconstrained optimal design problem. A unidirectional search technique was used. As numerical examples, some truss structures were applied to illustrate the applicability. and validity of the formulated algorithm.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.10a
• /
• pp.443-448
• /
• 2000

In this paper, multiphase optimization of machine structure is presented. The goal of first step is to obtain (i) light weight, (ii) rigidity statically. In this step, multiple optimization problem with two objective functions is treated using Pareto Genetic Algorithm. Where two objective functions are weight of the structure, and static compliance. The method is applied to a new machine structure design.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.1
• /
• pp.144-151
• /
• 2003

In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen fur design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size fur each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem. Favorable solution is obtained by the MLO, which is compared to both solutions made by RSM and sequential quadratic programming (SQP) in the OAO problem.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.373-383
• /
• 2001

The distance join is a spatial join which finds data pairs in the order of distance when associating two spatial data sets. This paper proposes several methods to optimize the adaptive multi-stage distance join, presented in [1]. First, we optimize the sweeping index formula which is used for selecting sweeping axis during plane sweeping. Second, to improve the performance of a priority queue used for maintaining node pairs, we propose to use the maximum distance of a node pair as the second priority of the queue. Moreover, we compare trade-offs in estimating the cut-off distance between under uniformity assumption of data distribution and non-uniformity assumption. The experiments show that the proposed methods greatly improve the performance of the algorithm in CPU cost as well as in I/O cost.