• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2574-2587
• /
• 2019

Blind Source Separation (BSS) is a technique used to separate supposed independent sources of signals from a given set of observations. In this paper, the High Exploration Particle Swarm Optimization (HEPSO) algorithm, which is an enhancement of the Particle Swarm Optimization (PSO) algorithm, has been used to separate a set of source signals. Compared to PSO algorithm, HEPSO algorithm depends on two additional operators. The first operator is based on the multi-crossover mechanism of the genetic algorithm while the second one relies on the bee colony mechanism. Both operators have been employed to update the velocity and the position of the particles respectively. Thus, they are used to find the optimal separating matrix. The proposed method enhances the overall efficiency of the standard PSO in terms of good exploration and performance. Based on many tests realized on speech and music signals supplied by the BSS demo, experimental results confirm the robustness and the accuracy of the introduced BSS technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.2889-2909
• /
• 2017

Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

• 한국지능시스템학회논문지
• /
• 제25권1호
• /
• pp.91-96
• /
• 2015

본 연구는 조명변화에 강인한 CT 전처리 기법 기반 개선된 얼굴인식 시스템을 소개한다. 전처리 알고리즘으로 CT알고리즘은 조명이 없는 환경에서도 얼굴의 지역적인 특징만을 추출한다. 얼굴의 지역적인 특징 추출을 가능하게 해준다. 처리된 데이터는 $(2D)^2$ 기반 대표적인 차원축소 알고리즘인 PCA를 사용하여 특징을 추출하였다. 전처리 알고리즘을 통한 특징 데이터는 제안한 방사형 기저함수 신경회로망의 입력으로 사용하였다. 방사형 기저함수 신경회로망의 은닉층은 FCM으로 구성하였고, 연결가중치는 1차 선형식을 사용하였다. 또한 ABC 알고리즘을 이용하여 제안된 분류기의 파라미터, 즉 입력의 수, 퍼지 클러스터링의 퍼지화 계수를 최적화 한다. 본 연구는 제안된 시스템의 성능 평가를 위해 Yale Face database B와 CMU PIE database로 실험하였다.

• 전기학회논문지
• /
• 제64권6호
• /
• pp.900-911
• /
• 2015

In this paper, 3D face recognition model is designed by using Polynomial based RBFNN(Radial Basis Function Neural Network) and PNN(Polynomial Neural Network). Also recognition rate is performed by this model. In existing 2D face recognition model, the degradation of recognition rate may occur in external environments such as face features using a brightness of the video. So 3D face recognition is performed by using 3D scanner for improving disadvantage of 2D face recognition. In the preprocessing part, obtained 3D face images for the variation of each pose are changed as front image by using pose compensation. The depth data of face image shape is extracted by using Multiple point signature. And whole area of face depth information is obtained by using the tip of a nose as a reference point. Parameter optimization is carried out with the aid of both ABC(Artificial Bee Colony) and PSO(Particle Swarm Optimization) for effective training and recognition. Experimental data for face recognition is built up by the face images of students and researchers in IC&CI Lab of Suwon University. By using the images of 3D face extracted in IC&CI Lab. the performance of 3D face recognition is evaluated and compared according to two types of models as well as point signature method based on two kinds of depth data information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• 한국지능시스템학회논문지
• /
• 제24권6호
• /
• pp.586-591
• /
• 2014

본 연구에서는 인공 벌 군집(ABC: Artificial Bee Colony) 알고리즘을 이용하여 주어진 레이더 데이터로부터 강수 사례와 비강수 사례를 분류하는 방사형 기저함수 신경회로망(RBFNNs: Radial Basis Function Neural Networks)분류기를 소개한다. 기상청에서 사용하고 있는 기상 레이더 데이터의 특성 분석을 통해 입력 데이터를 구성한다. 방사형 기저함수 신경회로망의 조건부에서는 Fuzzy C-Means 클러스터링 방법을 이용하여 적합도를 계산하고, 결론부에서는 최소자승법(LSE: Least Square Method)을 이용하여 다항식 계수를 추정한다. 추론부에서 최종출력 값은 퍼지 추론 방법을 이용하여 얻어진다. 제안된 분류기의 성능은 기상청에서 사용하는 QC와 CZ 데이터를 고려하여 비교 및 분석되어진다.

• 전기학회논문지
• /
• 제66권7호
• /
• pp.1131-1140
• /
• 2017

This study is concerned with a design methodology of optimized fuzzy clustering-based neural network classifier for classifying black plastic. Since the amount of waste plastic is increased every year, the technique for recycling waste plastic is getting more attention. The proposed classifier is on a basis of architecture of radial basis function neural network. The hidden layer of the proposed classifier is composed to FCM clustering instead of activation functions, while connection weights are formed as the linear functions and their coefficients are estimated by the local least squares estimator (LLSE)-based learning. Because the raw dataset collected from Raman spectroscopy include high-dimensional variables over about three thousands, principal component analysis(PCA) is applied for the dimensional reduction. In addition, artificial bee colony(ABC), which is one of the evolutionary algorithm, is used in order to identify the architecture and parameters of the proposed network. In experiment, the proposed classifier sorts the three kinds of plastics which is the most largely discharged in the real world. The effectiveness of the proposed classifier is proved through a comparison of performance between dataset obtained from chemical analysis and entire dataset extracted directly from Raman spectroscopy.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• Advances in Computational Design
• /
• 제1권4호
• /
• pp.315-327
• /
• 2016

Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.