• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.172-176
• /
• 1989

In this paper, a simple method for designing iterative learning control scheme is proposed. The proposed learning algorithm is designed based on series expansion of inverse plant model. The proposed scheme has simple structure and fast convergency so that it is suitable for implementing it on conventional micro processor based controllers. The effectiveness of the proposed algorithm is investigated through a series of computer simulations.

• International Journal of Automotive Technology
• /
• v.7 no.3
• /
• pp.369-375
• /
• 2006

This paper describes a simple proportional and integral control algorithm for a swirl motor controller and its application. The control algorithm may be complicated in order to have desired performance, such as low steady state errors, fast response time, and relatively low overshoot. At the same time, it should be compact so that it can be easily implemented on a low cost microcontroller, which has no floating-point calculation capability and low computing speed. These conflicting requirements are fulfilled by the proposed control algorithm which consists of a gain scheduling proportional controller and an anti-windup integral controller. The mechanical friction, which is caused by gears and a return spring, varies very nonlinearly according to the angular position of the system. This nonlinear static friction is overcome by the proportional controller, which has a two-dimensional look up gain table. It has error axis and angular position axis. The integral controller is designed not only to minimize the steady state error but also to avoid the windup effect, which may be caused by the saturation of a motor driver. The proposed control algorithm is verified by use of a commercial product to prove the feasibility of the algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.8
• /
• pp.727-734
• /
• 2002

A simple algorithm for discriminating voiced sounds in a speech is proposed in this paper. In addition to low-frequency energy and zero-crossing rate (ZCR), both of which have been widely used in the past for identifying voiced sounds, the proposed algorithm incorporates pitch variation to improve the discrimination rate. Based on TIMIT corpus, evaluation result shows an improvement of 13% in the discrimination of voiced phonemes over that of the traditional algorithm using only energy and ZCR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.12
• /
• pp.1101-1105
• /
• 2012

This study proposes a method for improvement of PD type fuzzy controller. The method includes self tuner using gradient algorithm that is one of the optimization algorithms. The proposed controller improves simple Takagi-Sugeno type FLC (Fuzzy Logic Control) system. The simple Takagi-Sugeno type FLC system changes nonlinear characteristic to linear parameters of consequent membership function. The simple FLC system could control the system by calibrating parameter of consequent membership function that changes the system response. While the determination on parameter of the simple FLC system works well only partially, the proposed method is needed to determine parameters that work for overall response. The simple FLC system doesn't predict the response characteristics. While the simple FLC system works just like proportional part of PID, our system includes derivative part to predict the next response. The proposed controller is constructed with P part and D part FLC system that characteristic parameter on system response is changed by self tuner for effective response. Since the proposed controller doesn't include integral part, it can't eliminate steady state error. So we include a gain to eliminate the steady state error.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.161-166
• /
• 2016

This paper suggests heuristic algorithm with O(m) linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for n-years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.131-138
• /
• 2016

In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.811-814
• /
• 2006

There are Monsters for game player in computer game. The Monsters generated by steady methods and data. And There are few methods that can be adapted to environment or player. This paper introduces a reformed Genetic Algorithm for Monster generation. This algorithm is applied to Homologous Chromosomes(HC). In existing GAs, An Individual have only one genome. But, In proposed algorithm, each Individual has a pair of allele genes on each locus. To compare proposed algorithm with Simple Genetic algorithm, I simulated the solution of a simple Binary problem. After experiments, I conclude that the suggested Algorithm reduced the number of generations more than SGA.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.93-101
• /
• 2007

To jointly optimize the spatial registration and the exposure compensation, an iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm, which is based on the histogram transformation function. Based on a simple regression model, a nonparametric estimator, the empirical conditional mean, and its polynomial fitting are used as histogram transformation functions for the exposure compensation. Since the proposed algorithm is composed of separable optimization phases, the proposed algorithm is more advantageous than the joint approaches of Mann and Candocia in the aspect of implementation flexibility. The proposed algorithm performs a better registration for real images than the case of registration that does not consider the exposure difference.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.547-550
• /
• 2009

The object recognition mechanism of human being is not well understood yet. On research of animal experiment using an ape, however, neurons that respond to simple shape (e.g. circle, triangle, square and so on) were found. And Hypothesis has been set up as human being may recognize object as combination of such simple shapes. That mechanism is called Figure Alphabet Hypothesis, and those simple shapes are called Figure Alphabet. As one way to research object recognition algorithm, we focused attention to this Figure Alphabet Hypothesis. Getting idea from it, we proposed the feature extraction algorithm for object recognition. In this paper, we described recognition of binarized images of multifont alphabet characters by the recognition model which combined three-layered neural network in the feature extraction algorithm. First of all, we calculated the difference between the learning image data set and the template by the feature extraction algorithm. The computed finite difference is a feature quantity of the feature extraction algorithm. We had it input the feature quantity to the neural network model and learn by backpropagation (BP method). We had the recognition model recognize the unknown image data set and found the correct answer rate. To estimate the performance of the contriving recognition model, we had the unknown image data set recognized by a conventional neural network. As a result, the contriving recognition model showed a higher correct answer rate than a conventional neural network model. Therefore the validity of the contriving recognition model could be proved. We'll plan the research a recognition of natural image by the contriving recognition model in the future.