Classification of Facial Emotions using Guided Particle Swarm Optimization I

2010 ◽  
pp. 36-46
Author(s):  
Bashir Mohammed Ghandi ◽  
Ramachandran Nagarajan ◽  
Hazry Desa
Keyword(s):  
Particle Swarm Optimization ◽  
Video Clip ◽  
Particle Swarm ◽  
Search Space ◽  
Swarm Optimization ◽  
Modified Particle Swarm Optimization ◽  
Novel Approach ◽  
Specific Emotion ◽  
The Face ◽  
Multiple Swarms

This paper presents a novel approach to facial emotion detection using a modified Particle Swarm Optimization algorithm, which we called Guided Particle Swarm Optimization (GPSO). The approach involves tracking the movements of 10 Action Units (AUs) placed at appropriate points on the face of a subject and captured in video clips. Two dimensional rectangular domains are defined around each of the AUs and Particles are then defined to have a component in each domain, effectively creating a 10- dimensional search space within which particles fly in search of a solution. Since there are more than one possible target emotions at any point in time, multiple swarms are used, with each swarm having a specific emotion as its target. At each frame in the video clip, the solution of the swarm that is nearest to its target is accepted as the solution. Our results so far show the approach to have a promising success rate.

scholarly journals Duhem Model-Based Hysteresis Identification in Piezo-Actuated Nano-Stage using Modified Particle Swarm Optimization

Micromachines ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 315
Author(s):  
Khubab Ahmed ◽  
Peng Yan ◽  
Su Li
Keyword(s):  
Particle Swarm Optimization ◽  
Parameter Identification ◽  
Model Identification ◽  
Particle Swarm ◽  
Identification Problem ◽  
Search Space ◽  
Model Parameters ◽  
Swarm Optimization ◽  
Local Optima ◽  
Modified Particle Swarm Optimization

This paper presents modeling and parameter identification of the Duhem model to describe the hysteresis in the Piezoelectric actuated nano-stage. First, the parameter identification problem of the Duhem model is modeled into an optimization problem. A modified particle swarm optimization (MPSO) technique, which escapes the problem of local optima in a traditional PSO algorithm, is proposed to identify the parameters of the Duhem model. In particular, a randomness operator is introduced in the optimization process which acts separately on each dimension of the search space, thus improving convergence and model identification properties of PSO. The effectiveness of the proposed MPSO method was demonstrated using different benchmark functions. The proposed MPSO-based identification scheme was used to identify the Duhem model parameters; then, the results were validated using experimental data. The results show that the proposed MPSO method is more effective in optimizing the complex benchmark functions as well as the real-world model identification problems compared to conventional PSO and genetic algorithm (GA).

Localization of WSN using Distributed Particle Swarm Optimization algorithm with precise references

2016 ◽  
Vol 7 ◽  
pp. 1
Author(s):  
Ravichander Janapati ◽  
Ch. Balaswamy ◽  
K. Soundararajan
Keyword(s):  
Particle Swarm Optimization ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Search Space ◽  
Research Area ◽  
Population Based ◽  
Wireless Sensor ◽  
Cooperative Localization ◽  
Localization Algorithm ◽  
Swarm Optimization

Localization is the key research area in wireless sensor networks. Finding the exact position of the node is known as localization. Different algorithms have been proposed. Here we consider a cooperative localization algorithm with censoring schemes using Crammer Rao bound (CRB). This censoring scheme  can improve the positioning accuracy and reduces computation complexity, traffic and latency. Particle swarm optimization (PSO) is a population based search algorithm based on the swarm intelligence like social behavior of birds, bees or a school of fishes. To improve the algorithm efficiency and localization precision, this paper presents an objective function based on the normal distribution of ranging error and a method of obtaining the search space of particles. In this paper  Distributed localization of wireless sensor networksis proposed using PSO with best censoring technique using CRB. Proposed method shows better results in terms of position accuracy, latency and complexity.  

scholarly journals Improvement of Traveling Salesman Problem Solution Using Hybrid Algorithm Based on Best-Worst Ant System and Particle Swarm Optimization

2021 ◽  
Vol 11 (11) ◽  
pp. 4780
Author(s):  
Muhammad Salman Qamar ◽  
Shanshan Tu ◽  
Farman Ali ◽  
Ammar Armghan ◽  
Muhammad Fahad Munir ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Traveling Salesman Problem ◽  
Particle Swarm ◽  
Standard Test ◽  
Traveling Salesman ◽  
Problem Solution ◽  
Ant System ◽  
Swarm Optimization ◽  
Hybrid Particle Swarm Optimization ◽  
Novel Approach

This work presents a novel Best-Worst Ant System (BWAS) based algorithm to settle the Traveling Salesman Problem (TSP). The researchers has been involved in ordinary Ant Colony Optimization (ACO) technique for TSP due to its versatile and easily adaptable nature. However, additional potential improvement in the arrangement way decrease is yet possible in this approach. In this paper BWAS based incorporated arrangement as a high level type of ACO to upgrade the exhibition of the TSP arrangement is proposed. In addition, a novel approach, based on hybrid Particle Swarm Optimization (PSO) and ACO (BWAS) has also been introduced in this work. The presentation measurements of arrangement quality and assembly time have been utilized in this work and proposed algorithm is tried against various standard test sets to examine the upgrade in search capacity. The outcomes for TSP arrangement show that initial trail setup for the best particle can result in shortening the accumulated process of the optimization by a considerable amount. The exhibition of the mathematical test shows the viability of the proposed calculation over regular ACO and PSO-ACO based strategies.

Sign in / Sign up

Export Citation Format

Share Document