1,078 research outputs found
A Survey on Evolutionary Computation for Computer Vision and Image Analysis: Past, Present, and Future Trends
Computer vision (CV) is a big and important field
in artificial intelligence covering a wide range of applications.
Image analysis is a major task in CV aiming to extract, analyse
and understand the visual content of images. However, imagerelated
tasks are very challenging due to many factors, e.g., high
variations across images, high dimensionality, domain expertise
requirement, and image distortions. Evolutionary computation
(EC) approaches have been widely used for image analysis with
significant achievement. However, there is no comprehensive
survey of existing EC approaches to image analysis. To fill
this gap, this paper provides a comprehensive survey covering
all essential EC approaches to important image analysis tasks
including edge detection, image segmentation, image feature
analysis, image classification, object detection, and others. This
survey aims to provide a better understanding of evolutionary
computer vision (ECV) by discussing the contributions of different
approaches and exploring how and why EC is used for
CV and image analysis. The applications, challenges, issues, and
trends associated to this research field are also discussed and
summarised to provide further guidelines and opportunities for
future research
A self-learning particle swarm optimizer for global optimization problems
Copyright @ 2011 IEEE. All Rights Reserved. This article was made available through the Brunel Open Access Publishing Fund.Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means that all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called self-learning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different situations in the search space. The cooperation of the four strategies is implemented by an adaptive learning framework at the individual level, which can enable a particle to choose the optimal strategy according to its own local fitness landscape. The experimental study on a set of 45 test functions and two real-world problems show that SLPSO has a superior performance in comparison with several other peer algorithms.This work was supported by the Engineering and Physical Sciences Research Council of U.K. under Grants EP/E060722/1 and EP/E060722/2
Electrocardiographic signals and swarm-based support vector machine for hypoglycemia detection
Cardiac arrhythmia relating to hypoglycemia is suggested as a cause of death in diabetic patients. This article introduces electrocardiographic (ECG) parameters for artificially induced hypoglycemia detection. In addition, a hybrid technique of swarm-based support vector machine (SVM) is introduced for hypoglycemia detection using the ECG parameters as inputs. In this technique, a particle swarm optimization (PSO) is proposed to optimize the SVM to detect hypoglycemia. In an experiment using medical data of patients with Type 1 diabetes, the introduced ECG parameters show significant contributions to the performance of the hypoglycemia detection and the proposed detection technique performs well in terms of sensitivity and specificity. © 2011 Biomedical Engineering Society
Multiple Cooperative Swarms for Data Clustering
Exploring a set of unlabeled data to extract the similar clusters,
known as data clustering, is an appealing problem in machine
learning. In other words, data clustering organizes the underlying
data into different groups using a notion of similarity between
patterns.
A new approach to solve the data clustering problem based on
multiple cooperative swarms is introduced. The proposed approach is
inspired by the social swarming behavior of biological bird flocks
which search for food situated in several places. The proposed
approach is composed of two main phases, namely, initialization and
exploitation. In the initialization phase, the aim is to distribute
the search space among several swarms. That is, a part of the search
space is assigned to each swarm in this phase. In the exploitation
phase, each swarm searches for the center of its associated cluster
while cooperating with other swarms. The search proceeds to converge
to a near-optimal solution. As compared to the single swarm
clustering approach, the proposed multiple cooperative swarms
provide better solutions in terms of fitness function measure for
the cluster centers, as the dimensionality of data and number of
clusters increase.
The multiple cooperative swarms clustering approach assumes that the
number of clusters is known a priori. The notion of stability
analysis is proposed to extract the number of clusters for the
underlying data using multiple cooperative swarms. The mathematical
explanations demonstrating why the proposed approach leads to more
stable and robust results than those of the single swarm clustering
are also provided.
Application of the proposed multiple cooperative swarms clustering
is considered for one of the most challenging problems in speech
recognition: phoneme recognition. The proposed approach is used to
decompose the recognition task into a number of subtasks or modules.
Each module involves a set of similar phonemes known as a phoneme
family. Basically, the goal is to obtain the best solution for
phoneme families using the proposed multiple cooperative swarms
clustering. The experiments using the standard TIMIT corpus indicate
that using the proposed clustering approach boosts the accuracy of
the modular approach for phoneme recognition considerably
Adaptive and learning-based formation control of swarm robots
Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation
Numerical optimization for vibration and noise of the wheel based on PSO-GA method
Currently, those reported researches conducted optimal design for the wheel only in order to reduce the tread wear and increase the service life, but they did not consider the wheel vibration and radiation noise which seriously influence people’s life and did not achieve obvious noise reduction effects. Aiming at this question, a multi-body dynamic model of the high-speed train was established, and the vertical and radial force was extracted to input into the finite element model of the wheel to compute its vibration characteristics. Then, the wheel was conducted on a multi-objective optimization based on particle swarm optimization improved by genetic algorithm (PSO-GA) method. Finally, the optimized vibration results were mapped to the acoustic element model to compute the radiation noise of the wheel. The computational model was also validated by experimental test. In order to observe the optimized effect, the optimized results were compared with those of the traditional GA and PSO method. Solutions of the traditional GA and PSO method were relatively dispersed during iterations and the algorithm could easily fall into the locally optimal solution. The optimized results of PSO-GA method were obviously better. Compared with the original wheel, the vibration acceleration was reduced by 22.9 %, and the mass was reduced by 1.1 %. Finally, the optimized vibration was mapped to the boundary element model to compute the radiation noise of the wheel, and the computational results were compared with the original wheel. Radiation noises of the original wheel were obviously more than that of the optimized wheel, and there were a lot of obvious peak noises in the original wheel. Radiation noises of the optimized wheel only had two obvious noise peaks in the analyzed frequency. Therefore, a wheel with low noises and lightweight was achieved in this paper
Computational intelligence approaches to robotics, automation, and control [Volume guest editors]
No abstract available
Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the `Rush to Heuristics'
In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems
- …