• Title/Summary/Keyword: intelligent optimization algorithms

Search Result 176, Processing Time 0.038 seconds

Dynamic gesture recognition using a model-based temporal self-similarity and its application to taebo gesture recognition

  • Lee, Kyoung-Mi;Won, Hey-Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2824-2838
    • /
    • 2013
  • There has been a lot of attention paid recently to analyze dynamic human gestures that vary over time. Most attention to dynamic gestures concerns with spatio-temporal features, as compared to analyzing each frame of gestures separately. For accurate dynamic gesture recognition, motion feature extraction algorithms need to find representative features that uniquely identify time-varying gestures. This paper proposes a new feature-extraction algorithm using temporal self-similarity based on a hierarchical human model. Because a conventional temporal self-similarity method computes a whole movement among the continuous frames, the conventional temporal self-similarity method cannot recognize different gestures with the same amount of movement. The proposed model-based temporal self-similarity method groups body parts of a hierarchical model into several sets and calculates movements for each set. While recognition results can depend on how the sets are made, the best way to find optimal sets is to separate frequently used body parts from less-used body parts. Then, we apply a multiclass support vector machine whose optimization algorithm is based on structural support vector machines. In this paper, the effectiveness of the proposed feature extraction algorithm is demonstrated in an application for taebo gesture recognition. We show that the model-based temporal self-similarity method can overcome the shortcomings of the conventional temporal self-similarity method and the recognition results of the model-based method are superior to that of the conventional method.

A New Architecture of Genetically Optimized Self-Organizing Fuzzy Polynomial Neural Networks by Means of Information Granulation

  • Park, Ho-Sung;Oh, Sung-Kwun;Ahn, Tae-Chon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1505-1509
    • /
    • 2005
  • This paper introduces a new architecture of genetically optimized self-organizing fuzzy polynomial neural networks by means of information granulation. The conventional SOFPNNs developed so far are based on mechanisms of self-organization and evolutionary optimization. The augmented genetically optimized SOFPNN using Information Granulation (namely IG_gSOFPNN) results in a structurally and parametrically optimized model and comes with a higher level of flexibility in comparison to the one we encounter in the conventional FPNN. With the aid of the information granulation, we determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. The GA-based design procedure being applied at each layer of genetically optimized self-organizing fuzzy polynomial neural networks leads to the selection of preferred nodes with specific local characteristics (such as the number of input variables, the order of the polynomial, a collection of the specific subset of input variables, and the number of membership function) available within the network. To evaluate the performance of the IG_gSOFPNN, the model is experimented with using gas furnace process data. A comparative analysis shows that the proposed IG_gSOFPNN is model with higher accuracy as well as more superb predictive capability than intelligent models presented previously.

  • PDF

Metaheuristic-hybridized multilayer perceptron in slope stability analysis

  • Ye, Xinyu;Moayedi, Hossein;Khari, Mahdy;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • v.26 no.3
    • /
    • pp.263-275
    • /
    • 2020
  • This research is dedicated to slope stability analysis using novel intelligent models. By coupling a neural network with spotted hyena optimizer (SHO), salp swarm algorithm (SSA), shuffled frog leaping algorithm (SFLA), and league champion optimization algorithm (LCA) metaheuristic algorithms, four predictive ensembles are built for predicting the factor of safety (FOS) of a single-layer cohesive soil slope. The data used to develop the ensembles are provided from a vast finite element analysis. After creating the proposed models, it was observed that the best population size for the SHO, SSA, SFLA, and LCA is 300, 400, 400, and 200, respectively. Evaluation of the results showed that the combination of metaheuristic and neural approaches offers capable tools for estimating the FOS. However, the SSA (error = 0.3532 and correlation = 0.9937), emerged as the most reliable optimizer, followed by LCA (error = 0.5430 and correlation = 0.9843), SFLA (error = 0.8176 and correlation = 0.9645), and SHO (error = 2.0887 and correlation = 0.8614). Due to the high accuracy of the SSA in properly adjusting the computational parameters of the neural network, the corresponding FOS predictive formula is presented to be used as a fast yet accurate substitution for traditional methods.

Optimal EEG Locations for EEG Feature Extraction with Application to User's Intension using a Robust Neuro-Fuzzy System in BCI

  • Lee, Chang Young;Aliyu, Ibrahim;Lim, Chang Gyoon
    • Journal of Integrative Natural Science
    • /
    • v.11 no.4
    • /
    • pp.167-183
    • /
    • 2018
  • Electroencephalogram (EEG) recording provides a new way to support human-machine communication. It gives us an opportunity to analyze the neuro-dynamics of human cognition. Machine learning is a powerful for the EEG classification. In addition, machine learning can compensate for high variability of EEG when analyzing data in real time. However, the optimal EEG electrode location must be prioritized in order to extract the most relevant features from brain wave data. In this paper, we propose an intelligent system model for the extraction of EEG data by training the optimal electrode location of EEG in a specific problem. The proposed system is basically a fuzzy system and uses a neural network structurally. The fuzzy clustering method is used to determine the optimal number of fuzzy rules using the features extracted from the EEG data. The parameters and weight values found in the process of determining the number of rules determined here must be tuned for optimization in the learning process. Genetic algorithms are used to obtain optimized parameters. We present useful results by using optimal rule numbers and non - symmetric membership function using EEG data for four movements with the right arm through various experiments.

Power Control and DFS Based on Genetic Algorithm in Cognitive Radio System (Cognitive Radio 시스템에서 유전자 알고리즘 기반 전력 제어 및 동적 주파수 선택방법)

  • Lee, Joo-Kwan;Shan, Sung-Hwan;Hong, In;Kim, Jae-Moung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.3
    • /
    • pp.100-111
    • /
    • 2009
  • Cognitive radio is an advanced technology for efficient utilization of under-utilized spectrum via spectrum sensing. CR users should move from current allocating channel to empty channel to avoid the interference to the primary user if the primary user is allocating that channel. Thus, CR system cannot support the CR user's QoS(Quaiity of Service). In this paper, we propose dynamic frequency selection method based on Genetic Algorithm with power control. It is to find the optimization channel for satisfying various CR user's needs with the power control method to minimize the CR user's interference to the primary user. And, we propose the Genetic Algorithm(GA) which determines the best configuration for CR communication systems. The computer simulation results show that the proposed method guaranteed the primary user's decodability and the optimized solution for various channel status.

  • PDF

A Genetic Algorithm for Guideway Network Design of Personal Rapid Transit (유전알고리즘을 이용한 소형궤도차량 선로네트워크 설계)

  • Won, Jin-Myung
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.3
    • /
    • pp.101-117
    • /
    • 2007
  • In this paper, we propose a customized genetic algorithm (GA) to find the minimum-cost guideway network (GN) of personal rapid transit (PRT) subject to connectivity, reliability, and traffic capacity constraints. PRT is a novel transportation concept, where a number of automated taxi-sized vehicles run on an elevated GN. One of the most important problems regarding PRT is how to design its GN topology for given station locations and the associated inter-station traffic demands. We model the GN as a directed graph, where its cost, connectivity, reliability, and node traffics are formulated. Based on this formulation, we develop the GA with special genetic operators well suited for the GN design problem. Such operators include steady state selection, repair algorithm, and directed mutation. We perform numerical experiments to determine the adequate GA parameters and compare its performance to other optimization algorithms previously reported. The experimental results verify the effectiveness and efficiency of the proposed approach for the GN design problem having up to 210 links.

  • PDF

Implementation of Unsupervised Nonlinear Classifier with Binary Harmony Search Algorithm (Binary Harmony Search 알고리즘을 이용한 Unsupervised Nonlinear Classifier 구현)

  • Lee, Tae-Ju;Park, Seung-Min;Ko, Kwang-Eun;Sung, Won-Ki;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.4
    • /
    • pp.354-359
    • /
    • 2013
  • In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

An Empirical Study on Statistical Optimization Model for the Portfolio Construction of Sponsored Search Advertising(SSA) (키워드검색광고 포트폴리오 구성을 위한 통계적 최적화 모델에 대한 실증분석)

  • Yang, Hognkyu;Hong, Juneseok;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.2
    • /
    • pp.167-194
    • /
    • 2019
  • This research starts from the four basic concepts of incentive incompatibility, limited information, myopia and decision variable which are confronted when making decisions in keyword bidding. In order to make these concept concrete, four framework approaches are designed as follows; Strategic approach for the incentive incompatibility, Statistical approach for the limited information, Alternative optimization for myopia, and New model approach for decision variable. The purpose of this research is to propose the statistical optimization model in constructing the portfolio of Sponsored Search Advertising (SSA) in the Sponsor's perspective through empirical tests which can be used in portfolio decision making. Previous research up to date formulates the CTR estimation model using CPC, Rank, Impression, CVR, etc., individually or collectively as the independent variables. However, many of the variables are not controllable in keyword bidding. Only CPC and Rank can be used as decision variables in the bidding system. Classical SSA model is designed on the basic assumption that the CPC is the decision variable and CTR is the response variable. However, this classical model has so many huddles in the estimation of CTR. The main problem is the uncertainty between CPC and Rank. In keyword bid, CPC is continuously fluctuating even at the same Rank. This uncertainty usually raises questions about the credibility of CTR, along with the practical management problems. Sponsors make decisions in keyword bids under the limited information, and the strategic portfolio approach based on statistical models is necessary. In order to solve the problem in Classical SSA model, the New SSA model frame is designed on the basic assumption that Rank is the decision variable. Rank is proposed as the best decision variable in predicting the CTR in many papers. Further, most of the search engine platforms provide the options and algorithms to make it possible to bid with Rank. Sponsors can participate in the keyword bidding with Rank. Therefore, this paper tries to test the validity of this new SSA model and the applicability to construct the optimal portfolio in keyword bidding. Research process is as follows; In order to perform the optimization analysis in constructing the keyword portfolio under the New SSA model, this study proposes the criteria for categorizing the keywords, selects the representing keywords for each category, shows the non-linearity relationship, screens the scenarios for CTR and CPC estimation, selects the best fit model through Goodness-of-Fit (GOF) test, formulates the optimization models, confirms the Spillover effects, and suggests the modified optimization model reflecting Spillover and some strategic recommendations. Tests of Optimization models using these CTR/CPC estimation models are empirically performed with the objective functions of (1) maximizing CTR (CTR optimization model) and of (2) maximizing expected profit reflecting CVR (namely, CVR optimization model). Both of the CTR and CVR optimization test result show that the suggested SSA model confirms the significant improvements and this model is valid in constructing the keyword portfolio using the CTR/CPC estimation models suggested in this study. However, one critical problem is found in the CVR optimization model. Important keywords are excluded from the keyword portfolio due to the myopia of the immediate low profit at present. In order to solve this problem, Markov Chain analysis is carried out and the concept of Core Transit Keyword (CTK) and Expected Opportunity Profit (EOP) are introduced. The Revised CVR Optimization model is proposed and is tested and shows validity in constructing the portfolio. Strategic guidelines and insights are as follows; Brand keywords are usually dominant in almost every aspects of CTR, CVR, the expected profit, etc. Now, it is found that the Generic keywords are the CTK and have the spillover potentials which might increase consumers awareness and lead them to Brand keyword. That's why the Generic keyword should be focused in the keyword bidding. The contribution of the thesis is to propose the novel SSA model based on Rank as decision variable, to propose to manage the keyword portfolio by categories according to the characteristics of keywords, to propose the statistical modelling and managing based on the Rank in constructing the keyword portfolio, and to perform empirical tests and propose a new strategic guidelines to focus on the CTK and to propose the modified CVR optimization objective function reflecting the spillover effect in stead of the previous expected profit models.

Combining Model-based and Heuristic Techniques for Fast Tracking the Global Maximum Power Point of a Photovoltaic String

  • Shi, Ji-Ying;Xue, Fei;Ling, Le-Tao;Li, Xiao-Fei;Qin, Zi-Jian;Li, Ya-Jing;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.17 no.2
    • /
    • pp.476-489
    • /
    • 2017
  • Under partial shading conditions (PSCs), multiple maximums may be exhibited on the P-U curve of string inverter photovoltaic (PV) systems. Under such conditions, heuristic methods are invalid for extracting a global maximum power point (GMPP); intelligent algorithms are time-consuming; and model-based methods are complex and costly. To overcome these shortcomings, a novel hybrid MPPT (MPF-IP&O) based on a model-based peak forecasting (MPF) method and an improved perturbation and observation (IP&O) method is proposed. The MPF considers the influence of temperature and does not require solar radiation measurements. In addition, it can forecast all of the peak values of the PV string without complex computation under PSCs, and it can determine the candidate GMPP after a comparison. Hence, the MPF narrows the searching range tremendously and accelerates the convergence to the GMPP. Additionally, the IP&O with a successive approximation strategy searches for the real GMPP in the neighborhood of the candidate one, which can significantly enhance the tracking efficiency. Finally, simulation and experiment results show that the proposed method has a higher tracking speed and accuracy than the perturbation and observation (P&O) and particle swarm optimization (PSO) methods under PSCs.

On Design Intelligent Control System by Fussionf of Fuzzy Logic and Genetic Algorithms (퍼지논리와 유전자 알고리즘 융합에 의한 지능형 제어 시스템)

  • Lee, Mal-Rye;Kim, Tae-Eun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.952-958
    • /
    • 1999
  • This paper presented the application of GAs as a means of finding optimal solutions over a parameter space in the controller design for a fuzzy control system. The performance can involve a weighted combination of various performance characteristics such as rise-time, settling-time, settling-time, overshoot. The results obtained here are compared with those for a traditional design obtained using the root-locus method. In contrast to traditional methods, the GA-based method does not require the usual mathematical processess or mathematical model of the system. In this paper, the Ga-based Fuzzy control system combining Fuzzy control theory with the GA, that is known to be very effective in the optimization problem, will be proposed The effectiveness of the proposed control system will be demonstrated by computer simulations using task tracking position system in stable and unstable linear systems. It is shown that the GA-based controller is better than the traditional controller used It stable and unstable linear systems.

  • PDF