• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.742-744
• /
• 2004

본 논문은 복잡한 배경에서의 얼굴 검출에 있어서 다중 특징 추출 데이터로 학습한 계단식 분류기에 의한 방법을 제안한다 얼굴 검출에서 얼굴의 패턴은 상당히 다양한 영상 표현으로 나타나기 때문에 하나의 특징 추출 방법은 사람의 얼굴을 모델링 하기에는 부족하다. 따라서 여기서는 얼굴의 전체적인 지역적인 특징을 나타내는 Subregion과, 얼굴의 주파수 특성에 따라 좀 더 세밀하고 다양한 속성들을 나타내는 Haar 웨이블릿 변환을 이용하여 다중으로 특징을 추출하여 효과적인 모델링을 시도하였다. 특징을 추출한 얼굴과 비얼굴의 패턴(pattern)을 구분하기 위해서 패턴들의 통계적인 특성을 이용하여 각 추출방법에 맞게 학습된 Bayesian 분류기를 직렬로 연결하여 사용하였으며 비얼굴은 얼굴과 유사한 비얼굴(face-like nonface) 패턴들을 사용하여 모델링 하였다. 제안한 얼굴 검출 방식의 성능은 MIT-CMU 시험 영상들을 이용하여 평가하였다. 그 결과 한 가지 특징 추출을 사용하는 것 보다 두 가지 특징 추출을 병행한 계단식 구성이 더 정확한 검출 결과를 나타내었다.

• Structural Engineering and Mechanics
• /
• v.20 no.2
• /
• pp.225-239
• /
• 2005

Applications of the Trefftz boundary element method (BEM) to anti-plane electroelastic problems are presented in this paper. Both direct and indirect methods with domain decomposition are discussed in details. Each crack is treated as semi-infinite thin slit defined in a subregion, for which a particular solution of the anti-plane problem, satisfying exactly the crack-face condition, is derived. The stress intensity factors defined at each crack tip can be directly computed from the coefficients of the particular solution. The performance of the proposed formulation is assessed by two examples and comparison is made with results obtained by other approaches. The Trefftz boundary element approach is demonstrated to be suitable for the analysis of the anti-plane problem of piezoelectric materials.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.2
• /
• pp.128-138
• /
• 2002

In this paper, we address how to reduce the length of tool retraction in a zigzag pocket machining. Tool retraction, in a zigzag pocket machining, is a non-cutting operation in which the tool moves to any remaining regions for machining. We developed an algorithm of generating tool retraction length in convex or concave polygonal shapes including islands. In the algorithm, we consider concave areas of cutting direction in the polygonal shape. Considering concave areas of cutting direction, the polygonal shape is decomposed to subregions which do not need any tool retraction. Using the proposed algorithm, we calculated the shortest length of tool retraction in cutting direction. Examples are shown to verify the validity of the algorithm.

• Korean Management Science Review
• /
• v.10 no.2
• /
• pp.11-26
• /
• 1993

This paper presents a new interactive procedure for multiple objective linear programming problem (MOLP). In practical multiple objective linear programming applications, there is usually no need for the decision maker to consider solutions which are not efficient. Therefore, the interactive procedure presented here searches only among efficient solutions and terminates with a solution that is guaranteed to be efficient. It also can converge to nonextreme efficient final solutions rather than being restricted to only extreme efficient points of the feasible set. The procedure does not require sophisticated judgements or inputs from the decision maker. One of the most attractive features of the procedure however, is that the method allows the DM to examine the efficient faces it finds. As iteration goes, the DM can explore a wide variety of efficient faces rather than efficient faces confined to only certain subregion of the feasible set of problem MOLP since the efficient faces that the procedure finds need not be adjacent. This helps the DM explore the nature of the efficient set of problem MOLP and also helps the DM have confidence with a final solution. For these reasons, I feel that the procedure offer significant promise in solving multiple objective linear programs rapidly and in a satisfying manner to the DM.

• 전기의세계
• /
• v.30 no.4
• /
• pp.219-226
• /
• 1981

The magnetic field distribution in saturable iron part of electromagnetic energy conversion divices is defined by the nonlinear quasi-Poisson enquation that is described the electromagnetic field characteristics and satisfied the natural boundary condition. The solution of this equation is obtained by minimizing an energy functional by means of trial function that defined in triangular subregion of two-dimensional field region. As a result, the accuracy of the machine design is increased by use of its solution. In this respect, this study is developed the basic theory to analyze the magnetic flux distribution in saturable iron part and air gap of induction motor that its secondary part is short circuit by the variational principle, the minimized theory of energy functional, the application of F.E.M., and treatment of computer. As theoritical data compared with the practics, the validity of the theory in this study is supported by experimental findings.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.804-806
• /
• 1995

This paper discusses Self-organized Distributed Networks(SODN) as identifier of nonlinear dynamical systems. The structure of system identification employs series-parallel model. The identification procedure is based on a discrete-time formulation. The learning with the proposed SODN is fast and precise. Such properties arc caused from the local learning mechanism. Each local networks learns only data in a subregion. Large number of memory requirements and low generalization capability for the untrained region, which are drawbacks of conventional local network learning, are overcomed in the SODN. Through extensive simulation, SODN is shown to be effective for identification of nonlinear dynamical systems.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.4
• /
• pp.574-581
• /
• 1996

The neural network approach has been shown to be a general scheme for nonlinear dynamical system identification. Unfortunately the error surface of a Multilayer Neural Networks(MNN) that widely used is often highly complex. This is a disadvantage and potential traps may exist in the identification procedure. The objective of this paper is to identify a nonlinear dynamical systems based on Self-Organized Distributed Networks (SODN). The learning with the SODN is fast and precise. Such properties are caused from the local learning mechanism. Each local network learns only data in a subregion. This paper also discusses neural network as identifier of nonlinear dynamical systems. The structure of nonlinear system identification employs series-parallel model. The identification procedure is based on a discrete-time formulation. Through extensive simulation, SODN is shown to be effective for identification of nonlinear dynamical systems. (author). 13 refs., 7 figs., 2 tabs.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1182-1185
• /
• 1996

The objective of this paper is to control a nonlinear dynamical systems based on Self-Organized Distributed Networks (SODN). The learning with the SODN is fast and precise. Such properties are caused from the local learning mechanism Each local network learns only data in a subregion. Methods for indirect adaptive control of nonlinear systems using the SODN is presented. Through extensive simulation, the SODN is shown to be effective for adaptive control of nonlinear dynamic systems.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.3
• /
• pp.113-117
• /
• 2021

The data gathering delay and the network lifetime are important indicators to measure the service quality of wireless sensor and actuator networks (WSANs). This study proposes a dynamically cluster head (CH) selection strategy and automatic scheduling scheme of collectors for prolonging the network lifetime and shorting data gathering delay in WSAN. First the monitoring region is equally divided into several subregions and each subregion dynamically selects a sensor node as CH. These can balance the energy consumption of sensor node thereby prolonging the network lifetime. Then a task allocation method based on genetic algorithm is proposed to uniformly assign tasks to actuators. Finally the trajectory of each actuator is optimized by ant colony optimization algorithm. Simulations are conducted to evaluate the effectiveness of the proposed method and the results show that the method performs better to extend network lifetime while also reducing data delay.