• KIEE International Transactions on Power Engineering
• /
• v.3A no.4
• /
• pp.181-190
• /
• 2003

This paper presents the design of a fuzzy power system stabilizer (FPSS) using an adaptive evolutionary algorithm (AEA). AEA consists of genetic algorithm (GA) for a global search capability and evolution strategy (ES) for a local search in an adaptive manner when the present generation evolves into the next generation. AEA is used to optimize the membership functions and scaling factors of the FPSS. To evaluate the usefulness of the FPSS, we applied it to a single-machine infinite bus system (SIBS) and a power system simulator at the Korea Electrotechnology Research Institute. The FPSS displays better control performance than the conventional power system stabilizer (CPSS) for a three-phase fault in heavy load, which is used when tuning FPSS. To show the robustness of the FPSS, it is applied with disturbances such as change of mechanical torque and three-phase fault in nominal and heavy load, etc. The FPSS also demonstrates better robustness than the CPSS. Experimental results indicate that the FPSS has good system damping under various disturbances such as one-line to ground faults, line parameter changes, transformer tap changes, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.5
• /
• pp.1019-1028
• /
• 2007

In this paper, adaptive evolutionary algorithm(AEA) is proposed, which uses both genetic algorithm(GA) with good global search capability and evolution strategy(ES) with good local search capability in an adaptive manner, when population evolves to the next generation. In the reproduction procedure, proportion of the population for GA and ES is adaptively determined according to their fitness. The AEA is used to design membership functions and scaling factors of the fuzzy logic controller(FLC). To evaluate the performance of the proposed FLC design method, we make an experiment on the FLC for the speed control of an actual DC series motor system with nonlinear characteristics. Experimental results show that the proposed controller has better performance than PD controller.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1142-1149
• /
• 2004

Motion Estimation(ME) has been developed to reduce temporal redundancy in digital video signals and increase data compression ratio. ME is an Important part of video encoding systems, since it can significantly affect the output quality of encoded sequences. However, ME requires high computational complexity, it is difficult to apply to real time video transmission. for this reason, motion estimation algorithms with low computational complexity are viable solutions. In this paper, we present an efficient method with low computational complexity based on spatial and temporal correlations of motion vectors. The proposed method uses temporally and spatially correlated motion information, the motion vector of the block with the same coordinate in the reference frame and the motion vectors of neighboring blocks around the current block in the current frame, to decide the search pattern and the location of search starting point adaptively. Experiments show that the image quality improvement of the proposed method over MVFAST (Motion Vector Field Adaptive Search Technique) and PMVFAST (Predictive Motion Vector Field Adaptive Search Technique) is 0.01～0.3(dB) better and the speedup improvement is about 1.12～l.33 times faster which resulted from lower computational complexity.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.188-191
• /
• 2002

To reduce the bit-rate of video sequences by removing temporal redundancy, motion estimation techniques have been developed. However, the high computational complexity of the problem makes such techniques very difficult to be applied to high-resolution applications in a real time environment. For this reason, low computational complexity motion estimation algorithms are viable solutions. If a priori knowledge about the motion of the current block is available before the motion estimation, a better starting point for the search of n optimal motion vector on be selected and also the computational complexity will be reduced. In this paper, we present an adaptive block matching algorithm based on temporal correlations of consecutive image frames that defines the search pattern and the location of initial starting point adaptively to reduce computational complexity. Experiments show that, comparing with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(㏈) better than DS in terms of PSNR and improves as much as 50% in terms of the average number of search points per motion estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.209-211
• /
• 2014

This paper proposes a fast motion estimation method which can reduce the computational complexity of HEVC encoding process. While the previous method determines its search range based on a distance between a current and a reference pictures to accelerate the time-consuming motion estimation, the proposed method adaptively sets the search range according to motion vector difference between prediction units. Experimental results show that the proposed method achieves about 10.7% of reduction in processing time of motion estimation under the random access configuration whereas its coding efficiency loss is less than 0.1%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.195-202
• /
• 2005

An adaptive segmentation algorithm is used to efficiently target decisions in local non-stationary images. Until now, several adaptive approaches have been proposed as a method of segmentation. However, they can't be directly used for radar target detection because a radar signal has different characteristics from general images. Generally, a histogram of radar signal shows that targets have a relatively small number of frequency functions compared to the background and distribution of background, which have several shapes as the environment changes. In this paper, we propose an adaptive segmentation algorithm using a histogram chord which is a right-down line from maximum pick of frequency function. The proposed method provides thresholds which are optimum for several radar environments because the used chord for threshold search is not significantly effected by interference conditions. Simulation results show that the proposed method is superior to the traditional algorithms, global threshold method and distribution median method, with respect to detection performance.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.3
• /
• pp.269-279
• /
• 2005

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1851-1856
• /
• 2013

An XML is widely used for web services, such as SOAP(Simple Object Access Protocol) and REST (Representational State Transfer), and also de facto standard for representing data. Since the XML parser using DOM(Document Object Model) requires a preprocessing task creating a DOM-tree, and then storing it into memory, embedded systems with limited resources typically employ a streaming XML parser without preprocessing. In this paper, we propose a new architecture for the streaming XML parser using an APSearch(Adaptive Parallel Search) on FPGA(Field Programmable Gate Array). Compared to other approaches, the proposed APSearch parser dramatically reduces overhead on the software side and achieves about 2.55 and 2.96 times improvement in the time needed for an XML parsing. Therefore, our APSearch parser is suitable for systems to speed up XML parsing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.19-33
• /
• 2008

A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.179-182
• /
• 2003

This paper proposes an adaptive hybrid genetic algorithm (aHGA) for effectively solving the complex reliability optimization problems. The proposed aHGA uses a loca1 search technique and an adaptive scheme for respectively constructing hybrid algorithm and adaptive ability. For more various comparisons with the proposed adaptive algorithm, other aHGAs with conventional adaptive schemes are considered. These aHGAs are tested and analyzed using two complex reliability optimization problems. Numerical result shows that the proposed aHGA outperforms the other competing aHGAs.