A morphable model for the synthesis of 3D faces

Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and self-organized swarms. The well known examples for these swarms are bird flocks, fish schools and the colony of social insects such as termites, ants and bees. In 1990s, especially two approaches based on ant colony and on fish schooling/bird flocking introduced have highly attracted the interest of researchers. Although the self-organization features are required by SI are strongly and clearly seen in honey bee colonies, unfortunately the researchers have recently started to be interested in the behaviour of these swarm systems to describe new intelligent approaches, especially from the beginning of 2000s. During a decade, several algorithms have been developed depending on different intelligent behaviours of honey bee swarms. Among those, artificial bee colony (ABC) is the one which has been most widely studied on and applied to solve the real world problems, so far. Day by day the number of researchers being interested in ABC algorithm increases rapidly. This work presents a comprehensive survey of the advances with ABC and its applications. It is hoped that this survey would be very beneficial for the researchers studying on SI, particularly ABC algorithm.

A comprehensive survey: artificial bee colony (ABC) algorithm and applications

Probability and Measure

Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning and control, as well as multi-objective optimization. This book can serve as an introductory book for graduates, doctoral students and lecturers in computer science, engineering and natural sciences. It can also serve a source of inspiration for new applications. Researchers and engineers as well as experienced experts will also find it a handy reference.Discusses and summarizes the latest developments in nature-inspired algorithms with comprehensive, timely literatureProvides a theoretical understanding as well as practical implementation hintsProvides a step-by-step introduction to each algorithm

Nature-Inspired Optimization Algorithms

We develop a novel maximum neighborhood margin discriminant projection (MNMDP) technique for dimensionality reduction of high-dimensional data. It utilizes both the local information and class information to model the intraclass and interclass neighborhood scatters. By maximizing the margin between intraclass and interclass neighborhoods of all points, MNMDP cannot only detect the true intrinsic manifold structure of the data but also strengthen the pattern discrimination among different classes. To verify the classification performance of the proposed MNMDP, it is applied to the PolyU HRF and FKP databases, the AR face database, and the UCI Musk database, in comparison with the competing methods such as PCA and LDA. The experimental results demonstrate the effectiveness of our MNMDP in pattern classification.

/pdf/maximum-neighborhood-margin-discriminant-projection-for-4vo54g9wbt.pdf

Maximum neighborhood margin discriminant projection for classification

Genetic and Evolutionary Computing

The complexity of the sequence is an important index of quantify the performance of chaotic sequence. In order to select a higher complexity of chaotic sequence and apply it in hardware encryption system, this paper analyzes chaotic complexity quantitative analysis methods and presents the approximate entropy and permutation entropy as criterion of measuring the complexity of the chaotic sequences. Set tent, logistic and henon three kinds of chaotic systems as examples, and we analysis and comparison their complexity. It is proved that the two kinds algorithms are effective, and can distinguish different complex chaos and chaotic sequences. Researches show that the complexity of the Logistic map is greater than that of other chaotic systems. The results of the study provide the theoretical and experimental basis for the application of chaotic sequence in hardware encryption system and the information security communication.

The Complexity Analysis of Chaotic Systems

A new research method for the sleepy lizards based on the KNN algorithm and the traditional social network algorithms is proposed in this paper. The famous paired habit of sleepy lizards is verified here based on our proposed algorithm. In addition, some common population characteristics of the lizards are also introduced by using the traditional social net work algorithms. Good performance of the experimental results shows efficiency of the new research method.

A research on behavior of sleepy lizards based on KNN algorithm

Arithmetic Optimization Algorithm (AOA) has simple structure, few parameters and is easy to implement. It utilizes the distribution behavior of the main arithmetic operators in mathematics. The Multiplication and Division operators are used for exploration, while the Subtraction and Addition are used for exploitation. In this manuscript, the AOA algorithm was converted into binary form with the Multiplication Mathematical Optimizer Operator (MOO) redesigned for better exploration. Then, four families of transfer functions are used in the binary AOA (BAOA). Moreover, in order to further improve the performance, the parallel mechanism is introduced to the BAOA and proposed the Parallel Binary AOA (PBAOA) algorithm. The proposed algorithms are applied for feature selection problem on 10 low-dimensional and 10 high-dimensional datasets from UCI and scikit-feature repository. The results show that the proposed BAOA and PBAOA algorithms are superior to the classical and state-of-the-art algorithms. The Z-shaped transfer functions are more suitable for the proposed algorithms on low-dimensional datasets, while the V-shaped transfer functions are more suitable for high-dimensional datasets. Moreover, no matter what transfer function is used, the parallel mechanism is effective for BAOA. 

Shu-Chuan Chu

Papers

Genetic and Evolutionary Computing

The Complexity Analysis of Chaotic Systems

A research on behavior of sleepy lizards based on KNN algorithm

Parallel binary arithmetic optimization algorithm and its application for feature selection

Optimization of MSFs for watermarking using DWT-DCT-SVD and fish migration optimization with QUATRE