• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.7
• /
• pp.673-679
• /
• 2015

In this study, the nondominated sorting genetic algorithm (NSGA-II) is used to obtain the optimized proportional-integral-derivative (PID) gain value that can quickly recover the motion of a quadcopter after a disturbance. Prior to PID control, the four-rotor quadcopter interval was defined using computational fluid dynamics (CFD). Through the definition of this model, the PID control algorithm was generated. To construct a response surface model, D-optimal programming was used for the generation of experimental points. For this purpose, a gain value that satisfies both the roll and altitude PID gain values is obtained. Using the NSGA-II, the gain value of shorten time of the quadcopter motion control can be optimized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.942-949
• /
• 2016

Efficient routing protocols designed for Wireless Sensor Networks (WSN) can be extended and applied to Internet of Things (IoT) data routing, as IoT can be considered to be an extension from WSN. When the size of the data in IoT is often bigger than in conventional WSNs, existing cluster routing protocol such as LEACH may cause high data loss rate due to its incomplete load balancing. We present an enhanced LEACH-based protocol which can minimize the data loss which is an important performance measure in IoT. In our proposed protocol, the base station estimates the location of nodes by the trilateration technique to make sure optimal number of cluster heads and members in a deterministic manner. We evaluate our proposed protocol via computer simulations in terms of data loss rate and average network lifetime.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.2
• /
• pp.48-55
• /
• 1998

The main drawback of filtered-X LMS(FXLMS) algorithm for the ANC of broadband noises is its low convergence speed when the filtered reference signals are strongly correlated, producing a large eigenvalue ratio in correlation matrix. This correlation can be caused either by autocorrelation of the signals of the reference sensors, or by coupling between the error path which introduces intercorrelation in the filtered reference signals. In this paper, we introduce a transform domain FXLMS(TD-FXLMS) algorithm that has a high convergence speed by orthogonal transform's decorrelation properties.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.1
• /
• pp.39-44
• /
• 2011

In this paper, we introduce a novel method to reduce image to a small size, such that the quality of the image is improved when it is up-scaled. Recent hardwares including cameras and display devices allow us to capture and display high-resolution images. However, it is not always realistic to store and transmit those high-resolution images due to limitation of storage and network bandwidth. Therefore, high-resolution images are often down-scaled to be stored and transmitted, and then up-scaled back for display. To improve final image quality in this scenario, we first formulate selected up-scale methods as linear transformations. The optimal reduction methods are obtained as its inverse transformation. Based on this basic idea, we develop down-scale kernel that is optimized for each up-scale method. In our experiment, the proposed method could improve the quality of the up-scaled image noticeable.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.8 no.1
• /
• pp.165-172
• /
• 1988

An optimal network design method using continuous form of design variables is considered. Modified Hooke-and-Jeeves algorithm has been implemented in order to solve nonlinear progamming problem which is approximately equivalent to the real network design problem (NDP) with system. efficiency criteria(i. e. travel time and costs) and construction cost as objective function. Various forms of construction cost function, locations of initial solution, and dimension of initial step size of link improvement are taken into account to show the validity of this approach. The results obtained are quite promising in terms of the numbers of evaluations in solving NDP, and the speed of convergence. Finally, some techniques in choosing efficient intial solution, initial step size and approximation are given.

• Journal of Korean Society of Steel Construction
• /
• v.14 no.6
• /
• pp.783-791
• /
• 2002

An improved formulation for multi-objective optimization was proposed. This formulation was applied to steel seismic loads. The multi-objective optimization problem was formulated with minimum structural weight, maximum strstability. The global criterion method was employed to find a rational solution closest to the ideal solution for the optimization problem using standard steel profile, To efficiently solve the optimization problem, the decomposition meth both system-level and element-level was used. In addition, various techniques including efficient reanalysis technique intermediate variables and sensitivity analysis using an automatic differentiation(AD) were incorporated. Moreover the reamong section properties fitted to the section profile used in order to link the system level and the element level. From numerical investigation, it could be stated that the proposed method will lead to the more rational design compared with one.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.288-294
• /
• 2011

In this paper we define the probability models for determining the disparity map given stereo images and derive the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. The proposed method alternates between estimating the parameters with the intermediate disparity map and estimating the disparity map with the estimated parameters, after computing it with random initial parameters. Our algorithm is applied to the stereo matching algorithms based on the dynamic programming and belief propagation to verify its operation and measure its performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.3
• /
• pp.288-296
• /
• 1992

This paper describes an improved 2D QPS(quadrature polar separable) filter design and its applications to texture processing. The filter kernel pair consists of the product of a radial weighting function based on the finite PSS (prolate spheroidal sequences) and an exponential at tenuation function for the orientational angle. It is quadrature and polar separable in the frequency domain. It is near optimal in the energy loss because we let the orientational angle function approximate the radial weighting function. The filter frequency characteristics is easy to control as it depends only upon the design specifications such as the bandwidth, the directional angle, the attenuation constant, and the shift constant of the central frequency. Some applications of the filter in texture processing, such as the generation of the texture image, the estimation of orientation angles, and the segmentations for the synthetic texture image, are considered. The result shows that the filter with the wide bandwidth can be used for the generation of discrimination of the strong orientational textures and the segmentation results are good.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2000

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

• Journal of Korean Institute of Industrial Engineers
• /
• v.6 no.2
• /
• pp.21-29
• /
• 1980

This paper deals with the capital budgeting problem of a firm where investments are risky and interrelated. The established models might be classified into two categories; One is the chance-constrained programming model and the other is the expected utility maximization model. The former has a rather limited objective function and does not consider the risk in direct manner. The latter, on the other hand, might lead to a wrong decision because it uses an approximate value of expected utility. This paper attempts to extend the applicability of the chance-constrained programming model by modifying its objective function into a more general form. The capital budgeting problem is formulated as a nonlinear 0-1 integer programming problem first, and is formulated into a linear 0-1 integer programming problem for finding a lower-bound solution of the original problem. The optimal solution of the original problem is then obtained by branch & bound algorithm.