• Title/Summary/Keyword: Adaptive Search

Search Result 474, Processing Time 0.025 seconds

Performance Improvement of Adaptive Hierarchical Hexagon Search by Extending the Search Patterns (탐색 패턴 확장에 의한 적응형 계층 육각 탐색의 성능 개선)

  • Kwak, No-Yoon
    • Journal of Digital Contents Society
    • /
    • v.9 no.2
    • /
    • pp.305-315
    • /
    • 2008
  • Pre-proposed AHHS(Adaptive Hierarchical Hexagon Search) is a kind of the fast hierarchical block matching algorithm based on the AHS(Adaptive Hexagon Search). It is characterized as keeping the merits of the AHS capable of fast estimating motion vectors and also adaptively reducing the local minima often occurred in the video sequences with higher spatio-temporal motion activity. The objective of this paper is to propose the method effectively extending the horizontal biased pattern and the vertical biased pattern of the AHHS to improve its predictive image quality. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive image quality and the computational time. The simulation results indicated that the proposed method was both suitable for (quasi-) stationary and large motion searches. While the proposed method increased the computational load on the process extending the hexagon search patterns, it could improve the predictive image quality so as to cancel out the increase of the computational load.

  • PDF

Optimal Design of a Hybrid Structural Control System using a Self-Adaptive Harmony Search Algorithm (자가적응 화음탐색 알고리즘을 이용한 복합형 최적 구조제어 시스템 설계)

  • Park, Wonsuk
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.31 no.6
    • /
    • pp.301-308
    • /
    • 2018
  • This paper presents an optimal design method of a hybrid structural control system considering multi-hazard. Unlike a typical structural control system in which one system is designed for one specific type of hazard, a simultaneous optimal design method for both active and passive control systems is proposed for the mitigation of seismic and wind induced vibration responses of structures. As a numerical example, an optimal design problem is illustrated for a hybrid mass damper(HMD) and 30 viscous dampers which are installed on a 30 story building structure. In order to solve the optimization problem, a self-adaptive Harmony Search(HS) algorithm is adopted. Harmony Search algorithm is one of the meta-heuristic evolutionary methods for the global optimization, which mimics the human player's tuning process of musical instruments. A self-adaptive, dynamic parameter adjustment algorithm is also utilized for the purpose of broad search and fast convergence. The optimization results shows that the performance and effectiveness of the proposed system is superior with respect to a reference hybrid system in which the active and passive systems are independently optimized.

Adaptive Decision Algorithm for an Improvement of RFID Anti-Collision (RFID의 효율적인 태그인식을 위한 Adaptive Decision 알고리즘)

  • Ko, Young-Eun;Oh, Kyoung-Wook;Bang, Sung-Il
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.4
    • /
    • pp.1-9
    • /
    • 2007
  • in this paper, we propose the Adaptive Decision Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Adaptive Decision algorithm identify smaller one ,each Tag_ID bit's sum of bit '1'. In other words, Adaptive Decision algorithm had standard of selection by actively, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Adaptive Decision algorithm had performance test that criterions were reader's number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Adaptive Decision algorithm better than exisiting algorithm.

PC Cluster based Parallel Adaptive Evolutionary Algorithm for Service Restoration of Distribution Systems

  • Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Kim, Hyung-Su;Hwang, Gi-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.4
    • /
    • pp.435-447
    • /
    • 2006
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. 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 the GA and the local search capability of the 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. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

Adaptive control with multiple model (using genetic algorithm)

  • Kwon, Seong-Chul;Park, Juhyun;Won, Sangchul
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.331-334
    • /
    • 1996
  • It is a well-known problem that the adaptive control has a poor transient response. In order to improve this problem, the scheme that model-reference adaptive control (MRAC) uses the genetic algorithm (GA) in the search for parameters is proposed. Use genetic algorithm (GA) in the searching for controller's parameters set and conventional gradient method for fine tuning. And show the reduction of the oscillations in transient response comparing with the conventional MRAC.

  • PDF

Improvement of Search Efficiency in Optimization Algorithm using Self-adaptive Harmony Search Algorithms (매개변수 자가적응 화음탐색 알고리즘의 성능 비교를 통한 최적해 탐색 효율 향상)

  • Choi, Young Hwan;Lee, Ho Min;Yoo, Do Guen;Kim, Joong Hoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.1
    • /
    • pp.1-11
    • /
    • 2018
  • In various engineering fields, determining the appropriate parameter set is a cumbersome and difficult task when solving optimization problems. Despite the appropriate parameter setting through parameter sensitivity analysis, there are limits to evaluating whether the parameters are appropriate for all optimization problems. For this reason, kinds of a Self-adaptive Harmony searches have been developed to solve various engineering problems by the appropriate setting of algorithm's own parameters according to the problem. In this study, various types of Self-adaptive Harmony searches were investigated and the characteristics of optimization were categorized. Six algorithms with a differentiation of optimization process were applied and compared with not only the mathematical optimization problem, but also the engineering problem, which has been applied widely in the algorithm performance comparisons. The performance of each algorithm was compared, and the statistical performance indicators were used to evaluate the application results quantitatively.

A New Adaptive Window Size-based Three Step Search Scheme (적응형 윈도우 크기 기반 NTSS (New Three-Step Search Algorithm) 알고리즘)

  • Yu Jonghoon;Oh Seoung-Jun;Ahn Chang-bum;Park Ho-Chong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.1 s.307
    • /
    • pp.75-84
    • /
    • 2006
  • With considering center-biased characteristic, NTSS(New Three-Step Search Algorithm) can improve the performance of TSS(Three-Step Search Algorithm) which is one of the most popular fast block matching algorithms(BMA) to search a motion vector in a video sequence. Although NTSS has generally better Quality than TSS for a small motion sequence, it is hard to say that NTSS can provide better quality than TSS for a large motion sequence. It even deteriorates the quality to increase a search window size using NTSS. In order to address this drawback, this paper aims to develop a new adaptive window size-based three step search scheme, called AWTSS, which can improve quality at various window sizes in both the small and the large motion video sequences. In this scheme, the search window size is dynamically changed to improve coding efficiency according to the characteristic of motion vectors. AWTSS can improve the video quality more than 0.5dB in case of large motion with keeping the same quality in case of small motion.

Optimal Design of Interior PM Synchronous Machines Using Randomly-Guided Mesh Adaptive Direct Search Algorithms (RG-MADS를 적용한 매입형 영구자석 동기전동기의 최적설계)

  • Kim, Kwang-Duck;Lee, Dong-Su;Jung, Sang-Yong;Kim, Jong-Wook;Lee, Cheol-Gyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.2
    • /
    • pp.216-222
    • /
    • 2012
  • Newly proposed RG-MADS (Randomly Guided Mesh Adaptive Direct Search) has been applied to the optimal design of Interior Permanent Magnet Synchronous Motor (IPMSM) which has the distinctive features of magnetic saturation. RG-MADS, advanced from classical MADS algorithm, has the superiority in computational time and reliable convergence accuracy to the optimal solution, thus it is appropriate to the optimal design of IPMSM coupled with time-consuming Finite Element Analysis (FEA), necessary to the nonlinear magnetic application for better accuracy. Effectiveness of RG-MADS has been verified through the well-known benchmark-functions beforehand. In addition, the proposed RG-MADS has been applied to the optimal design of IPMSM aiming at maximizing the Maximum Torque Per Ampere (MTPA), which is regarded as representative design goal of IPMSM.

The Optimal Controller Design of Buck-Boost Converter by using Adaptive Tabu Search Algorithm Based on State-Space Averaging Model

  • Pakdeeto, Jakkrit;Chanpittayagit, Rangsan;Areerak, Kongpan;Areerak, Kongpol
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1146-1155
    • /
    • 2017
  • Normally, the artificial intelligence algorithms are widely applied to the optimal controller design. Then, it is expected that the best output performance is achieved. Unfortunately, when resulting controller parameters are implemented by using the practical devices, the output performance cannot be the best as expected. Therefore, the paper presents the optimal controller design using the combination between the state-space averaging model and the adaptive Tabu search algorithm with the new criteria as two penalty conditions to handle the mentioned problem. The buck-boost converter regulated by the cascade PI controllers is used as the example power system. The results show that the output performance is better than those from the conventional design method for both input and load variations. Moreover, it is confirmed that the reported controllers can be implemented using the realistic devices without the limitation and the stable operation is also guaranteed. The results are also validated by the simulation using the topology model of MATLAB and also experimentally verified by the testing rig.

An Adaptive Search Strategy using Fuzzy Inference Network (퍼지추론 네트워크를 이용한 적응적 탐색전략)

  • Lee, Sang-Bum;Lee, Sung-Joo;Lee, Mal-Rey
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.2
    • /
    • pp.48-57
    • /
    • 2001
  • In a fuzzy connectionist expert system(FCES), the knowledge base can be constructed of neural logic networks to represent fuzzy rules and their relationship, We call it fuzzy rule inference network. To find out the belief value of a conclusion, the traditional inference strategy in a FCES will back-propagate from a rule term of the conclusion and follow through the entire network sequentially This sequential search strategy is very inefficient. In this paper, to improve the above search strategy, we proposed fuzzy rule inference rule used in a FCES was modified. The proposed adaptive search strategy in fuzzy rule inference network searches the network according to the search priorities.